Crate planarian_diagnose 

Deterministic diagnoser (SPEC §13): root-cause over the typed graph, then enumerate the known transitions that could close the divergence, safest and least disruptive first. Pure.

Only Requires edges, and Diagnostic edges with confidence ≥ 0.7, are walked. Ordering and Wants never are, so a failed wanted or ordered- before unit is never blamed for another unit’s failure. Cycles are collapsed into strongly connected components first.

Structs

Candidate

Inputs

Constants

DIAGNOSTIC_EDGE_MIN

Functions

candidates

Candidate transitions for an incident, in the order to try them (§13 steps 2–3).

diverges 🔒

est_tier 🔒

Coarse ordering key standing in for the policy tier (§13 step 3); the executor’s policy decision remains authoritative.

next

The candidate for this attempt: candidates are tried in order across the incident’s attempts, wrapping around (so a lone restart is retried until the budget is spent). None: the diagnoser is exhausted.

rank 🔒

Tie-break (§13): earliest definite Failed, then most failed Readiness probes, then lexical order. Smaller key wins.

root_cause

The deepest divergent unit below target (§13 step 1).

sccs 🔒

Tarjan’s algorithm. Returns the components and each node’s component index.

subgraph 🔒

The divergent units reachable from target through walkable edges, with their walkable edges among themselves.

walkable 🔒