Struct TopoGraph 

pub struct TopoGraph { /* private fields */ }

Directed graph structure for topological sorting.

Implementations

impl TopoGraph

pub fn new() -> Self

Create a new empty topological graph.

pub fn add_node(&mut self, id: TopoNodeId)

Add a node to the graph.

pub fn add_edge(&mut self, from: TopoNodeId, to: TopoNodeId)

Add a directed edge from from to to.

pub fn node_count(&self) -> usize

Return the number of nodes.

pub fn edge_count(&self) -> usize

Return the number of edges.

pub fn in_degree(&self, id: TopoNodeId) -> usize

Return the in-degree of a node.

pub fn out_degree(&self, id: TopoNodeId) -> usize

Return the out-degree of a node.

pub fn sources(&self) -> Vec<TopoNodeId>

Return all nodes with in-degree zero (source nodes).

pub fn sinks(&self) -> Vec<TopoNodeId>

Return all nodes with out-degree zero (sink nodes).

pub fn sort_kahn(&self) -> Result<Vec<TopoNodeId>, TopoError>

Perform topological sort using Kahn’s algorithm (BFS-based).

Returns nodes in topological order or an error if a cycle exists.

pub fn sort_dfs(&self) -> Result<Vec<TopoNodeId>, TopoError>

Perform topological sort using DFS-based algorithm.

Returns nodes in topological order or an error if a cycle exists.

pub fn is_dag(&self) -> bool

Check if the graph is a DAG (has no cycles).

pub fn longest_path(&self) -> Result<usize, TopoError>

Return the longest path length in the DAG.

pub fn node_depths(&self) -> Result<HashMap<TopoNodeId, usize>, TopoError>

Return the depth (longest path from any source) for each node.

pub fn can_reach(&self, a: TopoNodeId, b: TopoNodeId) -> bool

Check if node a can reach node b (transitively).

Trait Implementations

impl Default for TopoGraph

fn default() -> Self

Returns the “default value” for a type.