rust/compiler/rustc_data_structures/src/graph/mod.rs, branch auto https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=auto 2025-05-06T04:35:06+00:00 Rename `graph::implementation::Graph` to `LinkedGraph` 2025-05-06T04:35:06+00:00 Zalathar Zalathar@users.noreply.github.com 2025-05-06T02:54:03+00:00 urn:sha1:9e7fb67838ce06e418d078c4d04b0ff578bd1f43 Incorporate `iter_nodes` into `graph::DirectedGraph` 2025-01-26T03:08:42+00:00 Zalathar Zalathar@users.noreply.github.com 2025-01-26T03:00:46+00:00 urn:sha1:d36e2b88d643b3d712c6e2d22b4b0d77fea07209 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. Add wrapper type `ReversedGraph` for swapping successors/predecessors 2025-01-14T12:49:10+00:00 Zalathar Zalathar@users.noreply.github.com 2025-01-12T01:40:03+00:00 urn:sha1:1a23a6fd8b27943ffdbac2d5e4eb088cdecb06ff Add `graph::depth_first_search_as_undirected` 2024-04-15T23:20:52+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-15T18:20:30+00:00 urn:sha1:fa134b5e0f87c44074549af8bd6d7479b0954799 Make `graph::DepthFirstSearch` accept `G` by value 2024-04-15T23:20:52+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-15T18:17:51+00:00 urn:sha1:7d2cb3dda732028c7f8dfa8de5876da5be4bad9d It's required for the next commit. Note that you can still have `G = &H`, since there are implementations of all the graph traits for references. Use RPITIT for `Successors` and `Predecessors` traits 2024-04-15T13:34:08+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-15T13:33:08+00:00 urn:sha1:435db9b9bd404c1bc632fbb6ade8b4ce92c2828c Now with RPITIT instead of GAT! Make `depth_first_search` into a standalone function 2024-04-14T16:03:08+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T16:03:08+00:00 urn:sha1:e8d2221e3bbb4e8971c97395463036ebd6e7b23d Does not necessarily change much, but we never overwrite it, so I see no reason for it to be in the `Successors` trait. (+we already have a similar `is_cyclic`) Document `ControlFlowGraph` 2024-04-14T15:53:38+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:53:38+00:00 urn:sha1:3124fa93107d406dc77e56a0b8a5b372349a73ab Rename `WithNumEdges` => `NumEdges` and `WithStartNode` => `StartNode` 2024-04-14T15:51:29+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:51:29+00:00 urn:sha1:f5144938bd33af48a1b06fc5e11f7f30132be895 Merge `{With,Graph}{Successors,Predecessors}` into `{Successors,Predecessors}` 2024-04-14T15:48:53+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:40:26+00:00 urn:sha1:0d5fc9bf584f0e8700f0c3d2854bb6c70453f624 Now with GAT!