Struct CycleGraph 

pub struct CycleGraph { /* private fields */ }

Directed graph for cycle detection.

Implementations

impl CycleGraph

pub fn new() -> Self

Create a new empty graph.

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

Add a node to the graph.

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

Add a directed edge from from to to.

pub fn remove_edge(&mut self, from: CycleNodeId, to: CycleNodeId) -> bool

Remove a directed edge.

pub fn node_count(&self) -> usize

Return the number of nodes.

pub fn edge_count(&self) -> usize

Return the number of edges.

pub fn has_cycle(&self) -> bool

Check if the graph has any cycles using DFS coloring.

pub fn detect_all_cycles(&self) -> CycleDetectionResult

Detect all cycles in the graph using DFS.

pub fn would_create_cycle(&self, from: CycleNodeId, to: CycleNodeId) -> bool

Check if adding an edge from from to to would create a cycle. This performs a BFS from to to see if it can reach from.

pub fn try_add_edge(&mut self, from: CycleNodeId, to: CycleNodeId) -> bool

Add an edge only if it would not create a cycle. Returns true if the edge was added, false if it would create a cycle.

pub fn cyclic_nodes(&self) -> HashSet<CycleNodeId>

Return all nodes that are part of at least one cycle.

pub fn is_in_cycle(&self, id: CycleNodeId) -> bool

Check if a specific node is part of any cycle.

Trait Implementations

impl Default for CycleGraph

fn default() -> Self

Returns the “default value” for a type.