This assumes that the set of valid node IDs is exactly `0..num_nodes`. In practice, we have a lot of graph-algorithm code that already assumes that nodes are densely numbered, by using `num_nodes` to allocate per-node indexed data structures. |
||
|---|---|---|
| .. | ||
| dominators | ||
| implementation | ||
| iterate | ||
| scc | ||
| vec_graph | ||
| mod.rs | ||
| reference.rs | ||
| reversed.rs | ||
| tests.rs | ||