Module algorithms 

Graph algorithms (BFS, PageRank, clustering, topological, structure, paths)

Phase 2-4 implementations leveraging aprender for sparse matrix operations.

Re-exports

pub use louvain::louvain;

pub use louvain::CommunityDetectionResult;

pub use pagerank::pagerank;

pub use pattern::find_patterns;

pub use pattern::Pattern;

pub use pattern::PatternMatch;

pub use pattern::Severity;

pub use shortest_path::dijkstra;

pub use shortest_path::dijkstra_path;

pub use structure::connected_components;

pub use structure::kosaraju_scc;

pub use topo::is_cyclic;

pub use topo::toposort;

pub use traversal::bfs;

pub use traversal::find_callers;

Modules

louvain

Louvain community detection algorithm

pagerank

PageRank algorithm via aprender sparse matrix operations

pattern

Subgraph pattern matching for anti-pattern detection

shortest_path

Shortest path algorithms: Dijkstra’s algorithm

structure

Graph structure algorithms: connected components and strongly connected components

topo

Topological algorithms: cycle detection and topological sort

traversal

Graph traversal algorithms (BFS, DFS, find_callers)