Module algorithms 

Algorithm implementations for rust-igraph.

Phase 0 walking-skeleton scope: only traversal::bfs and io::read_edgelist. The full algorithm catalog is filled in by AWUs across Phases 1-10 (see docs/plans/MASTER_PLAN.md).

Modules

community

Community-detection algorithms (ALGO-CO-*). Phase 1: modularity (Newman-Girvan modularity of a partition).

connectivity

Connectivity algorithms. Phase 1: ALGO-CC-001 (weak connected components), ALGO-CC-002 (strongly connected components), ALGO-CC-010 (articulation points), ALGO-CC-013 (is_biconnected), ALGO-CC-014 (bridges), ALGO-CC-020 (reachability counts), ALGO-CC-021 (reachability matrix), ALGO-CC-022 (transitive closure).

io

File I/O for graphs. Phase 0 only ships edgelist.

operators

Graph operators (ALGO-OP-*). Phase 1: simplify (remove loops and/or parallel edges, returning a new crate::Graph).

paths

Path-related algorithms. Phase 1 entries: ALGO-SP-006 (unweighted single-source distances), ALGO-CC-040 (Eulerian path / cycle existence), ALGO-CC-041 (Eulerian path/cycle construction, undirected), ALGO-SP-020 (eccentricity / radius / diameter).

properties

Graph properties — invariants and metrics. Phase 1 entries: ALGO-PR-001 (girth), ALGO-PR-002 (triangles + global/local transitivity), ALGO-PR-003 (density + mean distance), ALGO-PR-004 (reciprocity), ALGO-PR-005 (avg nearest-neighbour degree), ALGO-PR-006 (degree assortativity).

traversal

Graph traversal. Phase 0 ships BFS; ALGO-TR-002 adds DFS; ALGO-TR-001 adds the multi-output BFS variant bfs_tree.