Expand description
Minimal Graph for the Phase 0 walking skeleton.
Only undirected, unweighted graphs with u32 vertex ids. Adjacency stored as
Vec<Vec<u32>>. This will be replaced by the full igraph_t-equivalent
structure in Phase 1 (see ALGO-CORE-001); the public surface kept here is
the strict subset that bfs, read_edgelist, and the oracle tests need.
Structs§
- Graph
- Undirected, unweighted graph backed by an adjacency list.
Type Aliases§
- Vertex
Id - Vertex id. Phase 0 fixes this to
u32; Phase 1 may switch to a generic integer type behind a feature flag. See plan §3.3.