Struct BeliefGraph 

pub struct BeliefGraph { /* private fields */ }

Dependency graph for beliefs (hypotheses)

Edge direction: A -> B means “A depends on B” So B is a “dependee” of A, and A is a “dependent” of B

Implementations

impl BeliefGraph

pub fn new() -> Self

pub fn add_dependency( &mut self, hypothesis_id: HypothesisId, depends_on: HypothesisId, ) -> Result<()>

Add a dependency edge: hypothesis_id depends on depends_on

Returns error if this would create a cycle

pub fn remove_dependency( &mut self, hypothesis_id: HypothesisId, depends_on: HypothesisId, ) -> Result<bool>

Remove a dependency edge

pub fn dependents( &self, hypothesis_id: HypothesisId, ) -> Result<IndexSet<HypothesisId>>

Get all hypotheses that depend on the given hypothesis (incoming edges)

If A depends on B, then A is in B’s dependents list

pub fn dependees( &self, hypothesis_id: HypothesisId, ) -> Result<IndexSet<HypothesisId>>

Get all hypotheses that the given hypothesis depends on (outgoing edges)

If A depends on B, then B is in A’s dependees list

pub fn dependency_chain( &self, hypothesis_id: HypothesisId, ) -> Result<IndexSet<HypothesisId>>

Get full dependency chain (transitive closure) for a hypothesis

Returns all hypotheses that this hypothesis transitively depends on

pub fn reverse_dependency_chain( &self, hypothesis_id: HypothesisId, ) -> Result<IndexSet<HypothesisId>>

Get all hypotheses that transitively depend on this hypothesis (reverse chain)

pub fn detect_cycles(&self) -> Vec<Vec<HypothesisId>>

Detect all cycles in the belief dependency graph

pub fn would_create_cycle( &self, hypothesis_id: HypothesisId, depends_on: HypothesisId, ) -> bool

Check if adding an edge would create a cycle

Returns true if adding the edge WOULD create a cycle (cycle detected). Returns false if the edge is safe to add (no cycle).

pub fn nodes(&self) -> IndexSet<HypothesisId>

Get all nodes in the graph

pub fn remove_hypothesis(&mut self, hypothesis_id: HypothesisId) -> Result<bool>

Remove a hypothesis and all its edges from the graph

pub fn all_edges(&self) -> Vec<(HypothesisId, HypothesisId)>

Returns all dependency edges as (dependent, dependee) pairs

If A depends on B, returns (A, B)

Trait Implementations

impl Default for BeliefGraph

fn default() -> Self

Returns the “default value” for a type.