In-memory adjacency structure for flow tracing. Loaded once via :meth:`GraphStore.load_flow_adjacency` and passed to ``trace_flows`` / ``compute_criticality`` to avoid per-edge SQLite point queries on large graphs.
| 112 | |
| 113 | @dataclass |
| 114 | class FlowAdjacency: |
| 115 | """In-memory adjacency structure for flow tracing. |
| 116 | |
| 117 | Loaded once via :meth:`GraphStore.load_flow_adjacency` and passed to |
| 118 | ``trace_flows`` / ``compute_criticality`` to avoid per-edge SQLite |
| 119 | point queries on large graphs. |
| 120 | """ |
| 121 | calls_out: dict[str, list[str]] |
| 122 | has_tested_by: set[str] |
| 123 | nodes_by_qn: dict[str, "GraphNode"] |
| 124 | nodes_by_id: dict[int, "GraphNode"] |
| 125 | |
| 126 | |
| 127 | @dataclass |