MCPcopy Index your code
hub / github.com/tirth8205/code-review-graph / FlowAdjacency

Class FlowAdjacency

code_review_graph/graph.py:114–124  ·  view source on GitHub ↗

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.

Source from the content-addressed store, hash-verified

112
113@dataclass
114class 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

Callers 1

load_flow_adjacencyMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected