Vadim Petrochenkov 96697d41ed LinkedGraph: support adding nodes and edges in arbitrary order ...

If an edge uses some not-yet-known node, we just leave the node's data empty, that data can be added later.

Use this support to avoid skipping edges in DepGraphQuery

2026-02-22 10:53:56 +03:00

..

dominators

Rustfmt

2025-02-08 22:12:13 +00:00

iterate

coverage: Completely overhaul counter assignment, using node-flow graphs

2025-01-16 22:07:18 +11:00

linked_graph

LinkedGraph: support adding nodes and edges in arbitrary order

2026-02-22 10:53:56 +03:00

scc

Borrowck: Simplify SCC annotation computation, placeholder rewriting

2026-01-27 14:22:53 +01:00

vec_graph

Reformat use declarations.

2024-07-29 08:26:52 +10:00

mod.rs

Rename graph::implementation::Graph to LinkedGraph

2025-05-06 14:35:06 +10: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

Add unreachable_pub to RUSTC_LINT_FLAGS for compiler/ crates.

2025-03-11 13:14:21 +11:00