Module live_graph 

Local SCC analysis over a recorded live-edge list (Stage 2 of the runtime-cycle-verdicts work, RFC #112).

evaluate_scc_unit records live edges as (from_idx, to_idx) pairs over the member index space of one statically-cyclic SCC (from reads to, i.e. from depends on to). This module classifies that small index graph:

• which members sit on a live cycle (SCC of size > 1, or a self-loop),
• a deterministic live-topological order (dependencies before dependents) used for stale-reader settling and the post-stamp consistency pass.

The scheduler’s Tarjan reads dependency-graph adjacency, not edge lists, so this is a separate ~80-line iterative implementation. It is deterministic given a deterministic edge list: callers must pass sorted edges (the collector hands out a hash set; sort before calling).