ade-strongly-connected-components 0.1.1

Algorithms for finding strongly connected components (SCCs) in directed graphs.
Documentation
1
2
3
4
5
pub mod pearce_iterative;
pub mod pearce_recursive;

pub use pearce_iterative::scc_iterative;
pub use pearce_recursive::scc;