Module flowgraph 

Canonical causal FlowGraph compiler (Wave 3, docs/SYSTEM_DESIGN.md §9).

One graph per entrypoint, built ONLY from evidence:

• Next edges from resolved CALLS paths
• Branch edges from call fanout (one operation -> 2+ distinct callees)
• Retry edges from RETRIES predicates (extracted failure behavior)
• Error edges to failure outcomes (retry exhaustion)
• Async edges from async call attributes
• Publish/Consume edges from queue predicates
• Join edges at convergence; Return/exit detection

Branches NEVER come from generated-text heuristics (e.g. splitting on “, “). The canonical graph preserves topology exactly: alternate execution paths can never be flattened into false sequential causality. Individual operations are retained; component grouping is a display-time concern only (ComponentSpan).

Functions

compile_flow_graphs

Compile the canonical flow graphs for every entrypoint.