rust/compiler/rustc_data_structures/src/graph
Zalathar d36e2b88d6 Incorporate iter_nodes into graph::DirectedGraph
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.
2025-01-26 14:08:42 +11:00
..
dominators Replace an FTP link in comments with an equivalent HTTPS link 2024-10-24 17:02:11 +11:00
implementation rename BitSet to DenseBitSet 2025-01-11 11:34:01 +00:00
iterate coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-16 22:07:18 +11:00
scc Incorporate iter_nodes into graph::DirectedGraph 2025-01-26 14:08:42 +11:00
vec_graph Reformat use declarations. 2024-07-29 08:26:52 +10:00
mod.rs Incorporate iter_nodes into graph::DirectedGraph 2025-01-26 14:08:42 +11:00
reference.rs Use RPITIT for Successors and Predecessors traits 2024-04-15 13:34:08 +00:00
reversed.rs Add wrapper type ReversedGraph for swapping successors/predecessors 2025-01-14 23:49:10 +11:00
tests.rs Reformat use declarations. 2024-07-29 08:26:52 +10:00