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
..
2025-01-21 16:48:44 +03:00
2025-01-26 14:08:42 +11:00
2024-12-02 22:51:18 +00:00
2024-09-22 19:11:29 -04:00
2024-07-29 08:26:52 +10:00
2024-07-29 08:26:52 +10:00
2024-07-29 08:26:52 +10:00
2025-01-11 11:34:01 +00:00
2024-11-12 13:38:58 +00:00
2025-01-12 14:56:10 +00:00
2024-11-15 18:20:32 -05:00
2024-09-02 07:42:38 +02:00
2024-09-22 19:11:29 -04:00
2024-07-29 08:26:52 +10:00
2024-12-22 17:12:42 -03:00
2024-09-02 07:42:38 +02:00
2024-07-29 08:26:52 +10:00
2024-12-13 10:21:22 +00:00
2024-11-19 02:07:48 +00:00
2025-01-12 14:56:10 +00:00
2024-11-12 13:38:58 +00:00
2024-12-27 10:57:46 +00:00
2024-12-22 17:12:42 -03:00
2024-11-12 13:38:58 +00:00
2024-07-29 08:26:52 +10:00
2025-01-11 11:34:01 +00:00
2024-10-01 17:21:56 -04:00
2024-10-15 20:30:23 -07:00
2024-07-29 08:26:52 +10:00
2024-11-12 13:38:58 +00:00
2025-01-12 14:56:10 +00:00
2024-07-29 08:26:52 +10:00
2024-10-12 15:17:03 +01:00
2024-08-07 13:37:52 +02:00
2024-10-05 07:34:14 +03:00
2024-11-20 18:11:37 +01:00
2024-11-15 18:20:32 -05:00
2025-01-11 11:34:01 +00:00