/**
 * Tarjan SCC primitives — `buildAdjacency` and `tarjanSccIds`.
 *
 * `graph-view-model.test.ts` exercises the SCC pass end-to-end through the
 * projector, but only along the "happy" structural paths (clean two-package
 * cycles, self-loops). These tests drive the lower-level primitives directly
 * to lock the defensive/edge branches the projector never produces:
 *
 *  - `buildAdjacency`: an edge whose `source` is not a known node (dropped),
 *    and a duplicate edge (deduped — `includes` guard).
 *  - `tarjanSccIds`: a node id with no adjacency entry (the `?? []` fallback),
 *    a cross-edge into an already-finished node NOT on the stack (the
 *    `onStack` false branch), a self-loop singleton (cyclic), and a trivial
 *    singleton (omitted → null).
 */
export {};
//# sourceMappingURL=dashboard-graph-scc.test.d.ts.map