Skip to main content

Module flow

the_code_graph_domain::analysis

Module flow 

Source

Functions§

brandes_betweenness
Compute betweenness centrality for all nodes using Brandes’ algorithm. Only traverses High-confidence edges (Calls, Extends, Implements, Embeds). Returns normalized scores in [0.0, 1.0] using directed graph factor (n-1)(n-2).
detect_entry_points
Detect entry points from symbols and edges.
enumerate_flows
Enumerate execution flows from entry points via bounded DFS. Only traverses High-confidence edges. Respects depth limit, global flow cap, and per-entry-point visit budget. Uses per-path cycle detection.