@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/sdk/graph/governance.js.map

@@ -1 +1 @@
-{"version":3,"file":"governance.js","sources":["sdk/graph/governance.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/governance\n *\n * Policy-aware relationship-graph quality audit shared by validation, health,\n * and package governance surfaces. The audit inspects one assembled workspace\n * graph and reports machine-readable findings — integrity gaps, ordering\n * cycles, duplicated edge spellings, stale lifecycle blocks, and coverage\n * outliers — without inventing edges or assuming that sparse connectivity is\n * defective. Findings gate severity on lifecycle: contradictions confined to\n * terminal items downgrade to informational `legacy_*` codes because repairing\n * them would mutate closed history. Every finding names the violated policy,\n * carries a deterministic bounded sample, and proposes a safe next action so\n * agents can plan remediation without re-deriving context.\n */\nimport type { RelationshipEdge } from \"../relationships.js\";\nimport {\n  isTransitiveKind,\n  orientTransitiveEdge,\n  transitiveFamilyKey,\n} from \"./analytics.js\";\nimport type { WorkspaceRelationshipAssembly } from \"./assembly.js\";\n\n/** Severity ladder shared by every relationship audit finding. */\nexport type RelationshipAuditSeverity = \"error\" | \"warning\" | \"info\";\n\n/** Machine-readable identifier for one relationship audit finding family. */\nexport type RelationshipAuditFindingCode =\n  | \"missing_reference_active\"\n  | \"missing_reference_terminal\"\n  | \"legacy_no_blocker_sentinel\"\n  | \"ordering_cycle\"\n  | \"legacy_ordering_cycle\"\n  | \"duplicate_edge\"\n  | \"legacy_duplicate_edge\"\n  | \"stale_lifecycle_block\"\n  | \"isolated_active_node\"\n  | \"sparse_active_node\";\n\n/** One policy-aware relationship audit finding with bounded evidence. */\nexport interface RelationshipAuditFinding {\n  /** Machine-readable finding family identifier. */\n  code: RelationshipAuditFindingCode;\n  /** Severity of the violated policy. */\n  severity: RelationshipAuditSeverity;\n  /** Policy statement this finding violates. */\n  policy: string;\n  /** Human-readable summary including the affected count. */\n  message: string;\n  /** Total number of affected subjects, independent of sample bounding. */\n  count: number;\n  /** Deterministic bounded sample of affected subjects. */\n  sample: string[];\n  /** Whether {@link sample} was truncated by the configured sample bound. */\n  sample_truncated: boolean;\n  /** Safe machine-actionable next step; audits never invent or auto-apply edges. */\n  remediation: string;\n}\n\n/** Aggregate structural coverage metrics for one assembled workspace graph. */\nexport interface RelationshipCoverageProfile {\n  /** Total indexed nodes including materialized missing placeholders. */\n  nodes: number;\n  /** Total deduplicated indexed edges. */\n  edges: number;\n  /** Deterministic per-kind edge counts. */\n  edges_by_kind: Record<string, number>;\n  /** Nodes whose lifecycle status is active (non-terminal, non-missing). */\n  active_nodes: number;\n  /** Materialized placeholder nodes for referenced-but-absent items. */\n  missing_nodes: number;\n  /** Active nodes with no incident edges at all. */\n  isolated_active_nodes: number;\n  /** Active nodes with at most one incident edge, isolates included. */\n  degree_leq_one_active_nodes: number;\n}\n\n/** Tuning and policy inputs accepted by the relationship audit. */\nexport interface RelationshipAuditOptions {\n  /** Terminal-lifecycle predicate; defaults to the built-in closed/canceled statuses. */\n  isTerminal?: (status: string) => boolean;\n  /** Blocked-lifecycle predicate for stale-block detection; defaults to `status === \"blocked\"`. */\n  isBlocked?: (status: string) => boolean;\n  /** Node identifiers that are explicitly valid isolates (roots, archives, scratch work). */\n  exemptIsolates?: readonly string[];\n  /** Maximum sample entries retained per finding; defaults to 25. */\n  maxSampleSize?: number;\n  /** Abort signal checked between finding families. */\n  signal?: AbortSignal;\n}\n\n/** Complete deterministic result of one relationship-graph audit. */\nexport interface RelationshipAuditReport {\n  /** Findings ordered by severity, then code, then first sample subject. */\n  findings: RelationshipAuditFinding[];\n  /** Structural coverage metrics computed during the audit. */\n  profile: RelationshipCoverageProfile;\n}\n\n/** Default bounded sample size applied to every finding family. */\nconst DEFAULT_MAX_SAMPLE_SIZE = 25;\n\n/** Rank used to order findings by decreasing severity. */\nconst SEVERITY_RANK: Record<RelationshipAuditSeverity, number> = {\n  error: 0,\n  warning: 1,\n  info: 2,\n};\n\n/** Internal per-node lifecycle classification resolved once per audit. */\ninterface AuditNodeState {\n  /** Original-case node identifier. */\n  id: string;\n  /** Raw lifecycle status string from assembly details. */\n  status: string;\n  /** Whether the node is a materialized missing placeholder. */\n  missing: boolean;\n  /** Whether the node's lifecycle status is terminal. */\n  terminal: boolean;\n}\n\n/** Mutable state shared by iterative Tarjan frames. */\ninterface TarjanState {\n  /** Discovery index assigned to each visited node. */\n  indexes: Map<string, number>;\n  /** Lowest reachable discovery index per visited node. */\n  lowLinks: Map<string, number>;\n  /** Nodes that still belong to an unfinished component. */\n  onStack: Set<string>;\n  /** Component-membership stack. */\n  stack: string[];\n  /** Completed cyclic components. */\n  components: string[][];\n  /** Discovery index assigned to the next unseen node. */\n  nextIndex: number;\n}\n\n/** One explicit depth-first frame used by iterative Tarjan traversal. */\ninterface TarjanFrame {\n  /** Node currently being expanded. */\n  node: string;\n  /** Index of the next successor to inspect. */\n  neighborIndex: number;\n}\n\n/** Build one finding with deterministic bounded sampling over sorted subjects. */\nfunction buildFinding(\n  code: RelationshipAuditFindingCode,\n  severity: RelationshipAuditSeverity,\n  policy: string,\n  describe: (count: number) => string,\n  subjects: readonly string[],\n  maxSampleSize: number,\n  remediation: string,\n): RelationshipAuditFinding {\n  const sorted = [...subjects].sort((left, right) => left.localeCompare(right));\n  return {\n    code,\n    severity,\n    policy,\n    message: describe(sorted.length),\n    count: sorted.length,\n    sample: sorted.slice(0, maxSampleSize),\n    sample_truncated: sorted.length > maxSampleSize,\n    remediation,\n  };\n}\n/** Resolve the ordering-only successor adjacency for cycle analysis. */\nfunction buildOrderingAdjacency(\n  assembly: WorkspaceRelationshipAssembly,\n): Map<string, string[]> {\n  const registry = assembly.graph.registry();\n  const successors = new Map<string, string[]>();\n  for (const edge of assembly.graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!definition.ordering) continue;\n    // Orient every ordering edge predecessor -> successor so inverse spellings\n    // (blocked_by/blocks) land in one canonical execution-order digraph.\n    const [predecessor, successor] =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"target_before_source\"\n        ? [edge.target, edge.source]\n        : [edge.source, edge.target];\n    const adjacent = successors.get(predecessor);\n    if (adjacent) adjacent.push(successor);\n    else successors.set(predecessor, [successor]);\n  }\n  for (const adjacent of successors.values())\n    adjacent.sort((left, right) => left.localeCompare(right));\n  return successors;\n}\n\n/** Register one newly discovered Tarjan node. */\nfunction registerTarjanNode(node: string, state: TarjanState): void {\n  state.indexes.set(node, state.nextIndex);\n  state.lowLinks.set(node, state.nextIndex);\n  state.nextIndex += 1;\n  state.stack.push(node);\n  state.onStack.add(node);\n}\n\n/** Visit one pending successor, returning whether the frame had work left. */\nfunction visitNextTarjanNeighbor(\n  frame: TarjanFrame,\n  frames: TarjanFrame[],\n  successors: Map<string, string[]>,\n  state: TarjanState,\n): boolean {\n  const neighbors = successors.get(frame.node) ?? [];\n  if (frame.neighborIndex >= neighbors.length) return false;\n  const neighbor = neighbors[frame.neighborIndex]!;\n  frame.neighborIndex += 1;\n  if (!state.indexes.has(neighbor)) {\n    registerTarjanNode(neighbor, state);\n    frames.push({ node: neighbor, neighborIndex: 0 });\n  } else if (state.onStack.has(neighbor)) {\n    state.lowLinks.set(\n      frame.node,\n      Math.min(state.lowLinks.get(frame.node)!, state.indexes.get(neighbor)!),\n    );\n  }\n  return true;\n}\n\n/** Complete one Tarjan frame and emit its component when it is a root. */\nfunction completeTarjanFrame(\n  frame: TarjanFrame,\n  frames: TarjanFrame[],\n  successors: Map<string, string[]>,\n  state: TarjanState,\n): void {\n  frames.pop();\n  const parent = frames.at(-1);\n  if (parent)\n    state.lowLinks.set(\n      parent.node,\n      Math.min(\n        state.lowLinks.get(parent.node)!,\n        state.lowLinks.get(frame.node)!,\n      ),\n    );\n  if (state.lowLinks.get(frame.node) !== state.indexes.get(frame.node)) return;\n  const component: string[] = [];\n  while (true) {\n    const member = state.stack.pop()!;\n    state.onStack.delete(member);\n    component.push(member);\n    if (member === frame.node) break;\n  }\n  if (\n    component.length > 1 ||\n    (component.length === 1 &&\n      successors.get(component[0]!)?.includes(component[0]!))\n  )\n    state.components.push(\n      component.sort((left, right) => left.localeCompare(right)),\n    );\n}\n\n/**\n * Enumerate strongly connected components with more than one member over the\n * ordering-only digraph using an iterative Tarjan traversal. Only order-bearing\n * kinds participate: associative kinds such as `related` cannot create\n * execution-order contradictions and stay out of cycle analysis by policy.\n */\nfunction collectOrderingCycles(successors: Map<string, string[]>): string[][] {\n  const state: TarjanState = {\n    indexes: new Map(),\n    lowLinks: new Map(),\n    onStack: new Set(),\n    stack: [],\n    components: [],\n    nextIndex: 0,\n  };\n  const roots = [...successors.keys()].sort((left, right) =>\n    left.localeCompare(right),\n  );\n  for (const root of roots) {\n    if (state.indexes.has(root)) continue;\n    // Explicit frame stack keeps the traversal safe on deep dependency chains.\n    const frames: TarjanFrame[] = [{ node: root, neighborIndex: 0 }];\n    registerTarjanNode(root, state);\n    while (frames.length > 0) {\n      const frame = frames.at(-1)!;\n      if (visitNextTarjanNeighbor(frame, frames, successors, state)) continue;\n      completeTarjanFrame(frame, frames, successors, state);\n    }\n  }\n  return state.components.sort((left, right) =>\n    left[0]!.localeCompare(right[0]!),\n  );\n}\n\n/** Format one dangling reference as a compact deterministic evidence string. */\nfunction formatDanglingReference(reference: {\n  holder_id: string;\n  target_id: string;\n  kind: string;\n}): string {\n  return `${reference.holder_id} -> ${reference.target_id} (${reference.kind})`;\n}\n\n/** Append one finding only when its subject collection is non-empty. */\nfunction appendFinding(\n  findings: RelationshipAuditFinding[],\n  subjects: readonly string[],\n  maxSampleSize: number,\n  code: RelationshipAuditFindingCode,\n  severity: RelationshipAuditSeverity,\n  policy: string,\n  describe: (count: number) => string,\n  remediation: string,\n): void {\n  if (subjects.length === 0) return;\n  findings.push(\n    buildFinding(\n      code,\n      severity,\n      policy,\n      describe,\n      subjects,\n      maxSampleSize,\n      remediation,\n    ),\n  );\n}\n\n/** Collect dangling-reference and retired-sentinel governance findings. */\nfunction collectIntegrityFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  isTerminal: (status: string) => boolean,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const findings: RelationshipAuditFinding[] = [];\n  const references = [\n    ...assembly.dangling.active,\n    ...assembly.dangling.legacy_terminal,\n  ].filter((reference) => !reference.no_active_blocker_sentinel);\n  appendFinding(\n    findings,\n    references\n      .filter((reference) => !isTerminal(reference.holder_status))\n      .map(formatDanglingReference),\n    maxSampleSize,\n    \"missing_reference_active\",\n    \"error\",\n    \"Active items must not reference absent targets; missing prerequisites distort scheduling.\",\n    (count) => `${count} active dangling reference(s) to absent items`,\n    \"Restore or re-create the referenced item, or remove/retype the reference on the holder.\",\n  );\n  appendFinding(\n    findings,\n    references\n      .filter((reference) => isTerminal(reference.holder_status))\n      .map(formatDanglingReference),\n    maxSampleSize,\n    \"missing_reference_terminal\",\n    \"info\",\n    \"Terminal items may retain historical references, but absent targets remain unexplainable context.\",\n    (count) => `${count} terminal dangling reference(s) to absent items`,\n    \"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.\",\n  );\n  appendFinding(\n    findings,\n    assembly.dangling.no_active_blocker_sentinels.map(formatDanglingReference),\n    maxSampleSize,\n    \"legacy_no_blocker_sentinel\",\n    \"info\",\n    \"The pre-structured-dependency no-active-blocker sentinel is retired; real edges carry blocker state.\",\n    (count) => `${count} legacy no-active-blocker sentinel reference(s)`,\n    \"Delete the sentinel reference; blocker state is derived from blocked_by edges.\",\n  );\n  return findings;\n}\n\n/** Decide whether one audited node still participates in active scheduling. */\nfunction isActiveAuditMember(\n  member: string,\n  nodeStates: Map<string, AuditNodeState>,\n): boolean {\n  const state = nodeStates.get(member);\n  // A trimmed or custom assembly may omit a member's details. Treat that\n  // unknown lifecycle conservatively as active so contradictions are never\n  // silently downgraded to legacy history debt.\n  if (!state) return true;\n  return !state.terminal;\n}\n\n/** Collect ordering-cycle and lifecycle-block governance findings. */\nfunction collectOrderingFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  isBlocked: (status: string) => boolean,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const findings: RelationshipAuditFinding[] = [];\n  const orderingAdjacency = buildOrderingAdjacency(assembly);\n  for (const cycle of collectOrderingCycles(orderingAdjacency)) {\n    // A cycle whose members are all terminal is a historical contradiction:\n    // it cannot make live work unschedulable, and \"repairing\" it would touch\n    // closed items (changelog drag), so it downgrades to informational debt.\n    const active = cycle.some((member) =>\n      isActiveAuditMember(member, nodeStates),\n    );\n    findings.push(\n      active\n        ? buildFinding(\n            \"ordering_cycle\",\n            \"error\",\n            \"Order-bearing relationship kinds must stay acyclic; a cycle makes every member unschedulable.\",\n            (count) => `execution-order cycle across ${count} item(s)`,\n            cycle,\n            maxSampleSize,\n            \"Remove or retype one ordering edge inside the cycle, or split the work so precedence is linear.\",\n          )\n        : buildFinding(\n            \"legacy_ordering_cycle\",\n            \"info\",\n            \"Ordering cycles between exclusively terminal items are historical contradictions with no scheduling effect.\",\n            (count) => `terminal-only execution-order cycle across ${count} item(s)`,\n            cycle,\n            maxSampleSize,\n            \"Leave as history debt, or clean up in a dedicated changelog-safe closed-item batch; never repair closed items ad hoc.\",\n          ),\n    );\n  }\n  const predecessorsByNode = new Map<string, string[]>();\n  for (const [predecessor, adjacent] of orderingAdjacency)\n    for (const successor of adjacent) {\n      const predecessors = predecessorsByNode.get(successor);\n      if (predecessors) predecessors.push(predecessor);\n      else predecessorsByNode.set(successor, [predecessor]);\n    }\n  const staleLifecycleBlocks = [...nodeStates.values()]\n    .filter(\n      (state) =>\n        !state.missing &&\n        !state.terminal &&\n        isBlocked(state.status) &&\n        !(predecessorsByNode.get(state.id) ?? []).some((predecessor) => {\n          const predecessorState = nodeStates.get(predecessor);\n          // A trimmed/custom assembly may omit predecessor details. Treat that\n          // unknown state conservatively as potentially open instead of\n          // falsely declaring the lifecycle block stale.\n          return predecessorState === undefined || !predecessorState.terminal;\n        }),\n    )\n    .map((state) => state.id);\n  appendFinding(\n    findings,\n    staleLifecycleBlocks,\n    maxSampleSize,\n    \"stale_lifecycle_block\",\n    \"warning\",\n    \"A blocked lifecycle status must be backed by at least one open ordering predecessor.\",\n    (count) => `${count} status-blocked item(s) with no open blocker edge`,\n    \"Re-open the missing prerequisite as an edge, or move the item back to an active status.\",\n  );\n  return findings;\n}\n\n/** One duplicate-edge group in semantic orientation with its stored spellings. */\nexport interface DuplicateRelationshipEdgeGroup {\n  /** Semantic tail node shared by every stored spelling. */\n  from: string;\n  /** Semantic head node shared by every stored spelling. */\n  to: string;\n  /** Stored parallel edges sorted by kind. */\n  edges: RelationshipEdge[];\n}\n\n/** Format one duplicate-edge group as a compact deterministic evidence string. */\nexport function formatDuplicateEdgeGroup(\n  group: DuplicateRelationshipEdgeGroup,\n): string {\n  const kinds = group.edges\n    .map((edge) => edge.kind)\n    .sort((left, right) => left.localeCompare(right));\n  return `${group.from} -> ${group.to} (${kinds.join(\" + \")})`;\n}\n\n/**\n * Collect the groups of parallel same-family stored edges over the directed\n * ordering and hierarchy families. Each family joins a kind with its inverse\n * spelling in semantic orientation, so a reciprocal pair such as\n * `A blocked_by B` plus `B blocks A` collapses onto one oriented endpoint\n * pair. Only groups holding at least two stored spellings are returned, in\n * deterministic orientation order with per-group edges sorted by kind, source,\n * then target — the exact stored identities remediation planning targets.\n */\nexport function collectDuplicateRelationshipEdgeGroups(\n  assembly: WorkspaceRelationshipAssembly,\n): DuplicateRelationshipEdgeGroup[] {\n  const registry = assembly.graph.registry();\n  const groups = new Map<string, DuplicateRelationshipEdgeGroup>();\n  for (const edge of assembly.graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!isTransitiveKind(definition)) continue;\n    const oriented = orientTransitiveEdge(edge, definition);\n    if (oriented.from === oriented.to) continue;\n    const key = `${transitiveFamilyKey(definition)}::${oriented.from}::${oriented.to}`;\n    const group = groups.get(key);\n    if (group) group.edges.push(edge);\n    else groups.set(key, { ...oriented, edges: [edge] });\n  }\n  const duplicated = [...groups.values()].filter(\n    (group) => group.edges.length >= 2,\n  );\n  // Within one oriented group every stored spelling has a distinct kind: a\n  // same-kind restatement of the same oriented pair would carry identical\n  // endpoints and is deduplicated by edge identity during graph construction.\n  for (const group of duplicated)\n    group.edges.sort((left, right) => left.kind.localeCompare(right.kind));\n  return duplicated.sort(\n    (left, right) =>\n      left.from.localeCompare(right.from) || left.to.localeCompare(right.to),\n  );\n}\n\n/**\n * Collect duplicate stored-edge findings from the oriented duplicate groups.\n * Transitive-reduction redundancy analysis deliberately skips the direct edge\n * under test, so these exact parallels are invisible there and this is the\n * only surface that reports them.\n */\nfunction collectDuplicateEdgeFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const active: string[] = [];\n  const legacy: string[] = [];\n  for (const group of collectDuplicateRelationshipEdgeGroups(assembly)) {\n    const subjects =\n      isActiveAuditMember(group.from, nodeStates) ||\n      isActiveAuditMember(group.to, nodeStates)\n        ? active\n        : legacy;\n    subjects.push(formatDuplicateEdgeGroup(group));\n  }\n  const findings: RelationshipAuditFinding[] = [];\n  appendFinding(\n    findings,\n    active,\n    maxSampleSize,\n    \"duplicate_edge\",\n    \"info\",\n    \"One semantic relationship should be stored once; parallel same-family spellings (reciprocal inverse pairs included) add no information and skew degree metrics.\",\n    (count) => `${count} duplicated relationship(s) between active endpoints`,\n    \"Remove all but one stored spelling of the relationship; keep the canonical direction the holder declared first.\",\n  );\n  appendFinding(\n    findings,\n    legacy,\n    maxSampleSize,\n    \"legacy_duplicate_edge\",\n    \"info\",\n    \"Duplicated spellings between exclusively terminal items are historical noise with no scheduling effect.\",\n    (count) => `${count} duplicated relationship(s) between terminal endpoints`,\n    \"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.\",\n  );\n  return findings;\n}\n\n/** Compute structural coverage metrics and coverage-policy findings. */\nfunction collectCoverageReport(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  exemptIsolates: Set<string>,\n  maxSampleSize: number,\n  edgesByKind: Record<string, number>,\n): RelationshipAuditReport {\n  let activeNodes = 0;\n  let missingNodes = 0;\n  let isolatedActiveNodes = 0;\n  let degreeLeqOneActive = 0;\n  const isolates: string[] = [];\n  const sparse: string[] = [];\n  for (const id of assembly.graph.nodes()) {\n    const state = nodeStates.get(id);\n    /* c8 ignore next -- every graph node originates from assembly details by construction */\n    if (!state) continue;\n    if (state.missing) {\n      missingNodes += 1;\n      continue;\n    }\n    if (state.terminal) continue;\n    activeNodes += 1;\n    const degree = assembly.graph.incidentEdges(id).length;\n    if (degree > 1) continue;\n    degreeLeqOneActive += 1;\n    if (degree === 0) isolatedActiveNodes += 1;\n    if (exemptIsolates.has(id.toLowerCase())) continue;\n    if (degree === 0) isolates.push(id);\n    else sparse.push(id);\n  }\n  const findings: RelationshipAuditFinding[] = [];\n  appendFinding(\n    findings,\n    isolates,\n    maxSampleSize,\n    \"isolated_active_node\",\n    \"warning\",\n    \"Active work should be reachable from the graph unless explicitly declared a valid isolate.\",\n    (count) => `${count} active item(s) with no relationships`,\n    \"Link the item to its parent, prerequisite, or origin — or register it as an exempt isolate.\",\n  );\n  appendFinding(\n    findings,\n    sparse,\n    maxSampleSize,\n    \"sparse_active_node\",\n    \"info\",\n    \"Active items with a single edge often miss an honest semantic partner; sparse is not automatically defective.\",\n    (count) => `${count} active item(s) with exactly one relationship`,\n    \"Investigate for an honest second edge (story->task, defect family, cross-epic complement); do not fabricate one.\",\n  );\n  return {\n    findings,\n    profile: {\n      nodes: assembly.graph.nodes().length,\n      edges: assembly.graph.edges().length,\n      edges_by_kind: Object.fromEntries(\n        Object.entries(edgesByKind).sort(([left], [right]) =>\n          left.localeCompare(right),\n        ),\n      ),\n      active_nodes: activeNodes,\n      missing_nodes: missingNodes,\n      isolated_active_nodes: isolatedActiveNodes,\n      degree_leq_one_active_nodes: degreeLeqOneActive,\n    },\n  };\n}\n\n/**\n * Audit one assembled workspace relationship graph against the shared\n * governance policy and return deterministic machine-readable findings plus a\n * structural coverage profile.\n *\n * The audit is read-only and never proposes inventing an edge: integrity\n * findings report evidence for investigation, coverage findings honor explicit\n * isolate exemptions, and cycle findings enumerate the strongly connected\n * members so callers can decide which edge to retype, remove, or waive.\n */\nexport function auditWorkspaceRelationshipGraph(\n  assembly: WorkspaceRelationshipAssembly,\n  options: RelationshipAuditOptions = {},\n): RelationshipAuditReport {\n  const isTerminal =\n    options.isTerminal ??\n    ((status: string) => status === \"closed\" || status === \"canceled\");\n  const isBlocked =\n    options.isBlocked ?? ((status: string) => status === \"blocked\");\n  const maxSampleSize = options.maxSampleSize ?? DEFAULT_MAX_SAMPLE_SIZE;\n  if (!Number.isInteger(maxSampleSize) || maxSampleSize < 1)\n    throw new TypeError(\n      `Invalid audit sample bound: ${String(options.maxSampleSize)}`,\n    );\n  const exemptIsolates = new Set(\n    (options.exemptIsolates ?? [])\n      .filter((id): id is string => typeof id === \"string\")\n      .map((id) => id.trim().toLowerCase()),\n  );\n  const nodeStates = new Map<string, AuditNodeState>(\n    assembly.details.map((detail) => [\n      detail.id,\n      {\n        id: detail.id,\n        status: detail.status,\n        missing: assembly.missingIdSet.has(detail.id.toLowerCase()),\n        terminal: isTerminal(detail.status),\n      },\n    ]),\n  );\n  options.signal?.throwIfAborted();\n\n  const edgesByKind: Record<string, number> = {};\n  for (const edge of assembly.graph.edges())\n    edgesByKind[edge.kind] = (edgesByKind[edge.kind] ?? 0) + 1;\n  const findings = collectIntegrityFindings(\n    assembly,\n    isTerminal,\n    maxSampleSize,\n  );\n  options.signal?.throwIfAborted();\n  findings.push(\n    ...collectOrderingFindings(assembly, nodeStates, isBlocked, maxSampleSize),\n  );\n  options.signal?.throwIfAborted();\n  findings.push(\n    ...collectDuplicateEdgeFindings(assembly, nodeStates, maxSampleSize),\n  );\n  options.signal?.throwIfAborted();\n  const coverage = collectCoverageReport(\n    assembly,\n    nodeStates,\n    exemptIsolates,\n    maxSampleSize,\n    edgesByKind,\n  );\n  findings.push(...coverage.findings);\n\n  findings.sort(\n    (left, right) =>\n      SEVERITY_RANK[left.severity] - SEVERITY_RANK[right.severity] ||\n      left.code.localeCompare(right.code) ||\n      left.sample[0]!.localeCompare(right.sample[0]!),\n  );\n  return {\n    findings,\n    profile: coverage.profile,\n  };\n}\n"],"names":[],"mappings":";;AAeA,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AA+ExB,mEAAmE;AACnE,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,0DAA0D;AAC1D,MAAM,aAAa,GAA8C;IAC/D,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,IAAI,EAAE,CAAC;CACR,CAAC;AAsCF,kFAAkF;AAClF,SAAS,YAAY,CACnB,IAAkC,EAClC,QAAmC,EACnC,MAAc,EACd,QAAmC,EACnC,QAA2B,EAC3B,aAAqB,EACrB,WAAmB;IAEnB,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9E,OAAO;QACL,IAAI;QACJ,QAAQ;QACR,MAAM;QACN,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,EAAE,MAAM,CAAC,MAAM;QACpB,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC;QACtC,gBAAgB,EAAE,MAAM,CAAC,MAAM,GAAG,aAAa;QAC/C,WAAW;KACZ,CAAC;AACJ,CAAC;AACD,wEAAwE;AACxE,SAAS,sBAAsB,CAC7B,QAAuC;IAEvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,UAAU,CAAC,QAAQ;YAAE,SAAS;QACnC,2EAA2E;QAC3E,qEAAqE;QACrE,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,GAC5B,CAAC,UAAU,CAAC,UAAU,IAAI,sBAAsB,CAAC;YACjD,sBAAsB;YACpB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAC5B,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC7C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;YAClC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,MAAM,EAAE;QACxC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,iDAAiD;AACjD,SAAS,kBAAkB,CAAC,IAAY,EAAE,KAAkB;IAC1D,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAC1C,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IACrB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,SAAS,uBAAuB,CAC9B,KAAkB,EAClB,MAAqB,EACrB,UAAiC,EACjC,KAAkB;IAElB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACnD,IAAI,KAAK,CAAC,aAAa,IAAI,SAAS,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1D,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,aAAa,CAAE,CAAC;IACjD,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,kBAAkB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAChB,KAAK,CAAC,IAAI,EACV,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CACxE,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0EAA0E;AAC1E,SAAS,mBAAmB,CAC1B,KAAkB,EAClB,MAAqB,EACrB,UAAiC,EACjC,KAAkB;IAElB,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,MAAM;QACR,KAAK,CAAC,QAAQ,CAAC,GAAG,CAChB,MAAM,CAAC,IAAI,EACX,IAAI,CAAC,GAAG,CACN,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,EAChC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAChC,CACF,CAAC;IACJ,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO;IAC7E,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;QAClC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,IAAI,MAAM,KAAK,KAAK,CAAC,IAAI;YAAE,MAAM;IACnC,CAAC;IACD,IACE,SAAS,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;QAEzD,KAAK,CAAC,UAAU,CAAC,IAAI,CACnB,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAC3D,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,UAAiC;IAC9D,MAAM,KAAK,GAAgB;QACzB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,KAAK,EAAE,EAAE;QACT,UAAU,EAAE,EAAE;QACd,SAAS,EAAE,CAAC;KACb,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACxD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAC1B,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACtC,2EAA2E;QAC3E,MAAM,MAAM,GAAkB,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAC7B,IAAI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC;gBAAE,SAAS;YACxE,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC3C,IAAI,CAAC,CAAC,CAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAClC,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,SAAS,uBAAuB,CAAC,SAIhC;IACC,OAAO,GAAG,SAAS,CAAC,SAAS,OAAO,SAAS,CAAC,SAAS,KAAK,SAAS,CAAC,IAAI,GAAG,CAAC;AAChF,CAAC;AAED,wEAAwE;AACxE,SAAS,aAAa,CACpB,QAAoC,EACpC,QAA2B,EAC3B,aAAqB,EACrB,IAAkC,EAClC,QAAmC,EACnC,MAAc,EACd,QAAmC,EACnC,WAAmB;IAEnB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAClC,QAAQ,CAAC,IAAI,CACX,YAAY,CACV,IAAI,EACJ,QAAQ,EACR,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,WAAW,CACZ,CACF,CAAC;AACJ,CAAC;AAED,2EAA2E;AAC3E,SAAS,wBAAwB,CAC/B,QAAuC,EACvC,UAAuC,EACvC,aAAqB;IAErB,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,MAAM,UAAU,GAAG;QACjB,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM;QAC3B,GAAG,QAAQ,CAAC,QAAQ,CAAC,eAAe;KACrC,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,0BAA0B,CAAC,CAAC;IAC/D,aAAa,CACX,QAAQ,EACR,UAAU;SACP,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;SAC3D,GAAG,CAAC,uBAAuB,CAAC,EAC/B,aAAa,EACb,0BAA0B,EAC1B,OAAO,EACP,2FAA2F,EAC3F,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,+CAA+C,EAClE,yFAAyF,CAC1F,CAAC;IACF,aAAa,CACX,QAAQ,EACR,UAAU;SACP,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;SAC1D,GAAG,CAAC,uBAAuB,CAAC,EAC/B,aAAa,EACb,4BAA4B,EAC5B,MAAM,EACN,mGAAmG,EACnG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,iDAAiD,EACpE,oFAAoF,CACrF,CAAC;IACF,aAAa,CACX,QAAQ,EACR,QAAQ,CAAC,QAAQ,CAAC,2BAA2B,CAAC,GAAG,CAAC,uBAAuB,CAAC,EAC1E,aAAa,EACb,4BAA4B,EAC5B,MAAM,EACN,sGAAsG,EACtG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,iDAAiD,EACpE,gFAAgF,CACjF,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+EAA+E;AAC/E,SAAS,mBAAmB,CAC1B,MAAc,EACd,UAAuC;IAEvC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,uEAAuE;IACvE,yEAAyE;IACzE,8CAA8C;IAC9C,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;AACzB,CAAC;AAED,sEAAsE;AACtE,SAAS,uBAAuB,CAC9B,QAAuC,EACvC,UAAuC,EACvC,SAAsC,EACtC,aAAqB;IAErB,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,qBAAqB,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC7D,wEAAwE;QACxE,yEAAyE;QACzE,yEAAyE;QACzE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CACnC,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CACxC,CAAC;QACF,QAAQ,CAAC,IAAI,CACX,MAAM;YACJ,CAAC,CAAC,YAAY,CACV,gBAAgB,EAChB,OAAO,EACP,+FAA+F,EAC/F,CAAC,KAAK,EAAE,EAAE,CAAC,gCAAgC,KAAK,UAAU,EAC1D,KAAK,EACL,aAAa,EACb,iGAAiG,CAClG;YACH,CAAC,CAAC,YAAY,CACV,uBAAuB,EACvB,MAAM,EACN,6GAA6G,EAC7G,CAAC,KAAK,EAAE,EAAE,CAAC,8CAA8C,KAAK,UAAU,EACxE,KAAK,EACL,aAAa,EACb,uHAAuH,CACxH,CACN,CAAC;IACJ,CAAC;IACD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvD,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,iBAAiB;QACrD,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,YAAY;gBAAE,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;gBAC5C,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,MAAM,oBAAoB,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;SAClD,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,CAAC,KAAK,CAAC,OAAO;QACd,CAAC,KAAK,CAAC,QAAQ;QACf,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;QACvB,CAAC,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE;YAC7D,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACrD,qEAAqE;YACrE,8DAA8D;YAC9D,+CAA+C;YAC/C,OAAO,gBAAgB,KAAK,SAAS,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC;QACtE,CAAC,CAAC,CACL;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5B,aAAa,CACX,QAAQ,EACR,oBAAoB,EACpB,aAAa,EACb,uBAAuB,EACvB,SAAS,EACT,sFAAsF,EACtF,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,mDAAmD,EACtE,yFAAyF,CAC1F,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAYD,kFAAkF;AAClF,MAAM,UAAU,wBAAwB,CACtC,KAAqC;IAErC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK;SACtB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;SACxB,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,GAAG,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AAC/D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,sCAAsC,CACpD,QAAuC;IAEvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0C,CAAC;IACjE,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC;YAAE,SAAS;QAC5C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE;YAAE,SAAS;QAC5C,MAAM,GAAG,GAAG,GAAG,mBAAmB,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC;QACnF,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,UAAU,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC5C,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CACnC,CAAC;IACF,yEAAyE;IACzE,wEAAwE;IACxE,4EAA4E;IAC5E,KAAK,MAAM,KAAK,IAAI,UAAU;QAC5B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CACzE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,4BAA4B,CACnC,QAAuC,EACvC,UAAuC,EACvC,aAAqB;IAErB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,sCAAsC,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrE,MAAM,QAAQ,GACZ,mBAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC;YAC3C,mBAAmB,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC;YACvC,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,MAAM,CAAC;QACb,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,MAAM,EACN,iKAAiK,EACjK,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,sDAAsD,EACzE,iHAAiH,CAClH,CAAC;IACF,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,uBAAuB,EACvB,MAAM,EACN,yGAAyG,EACzG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,wDAAwD,EAC3E,oFAAoF,CACrF,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,wEAAwE;AACxE,SAAS,qBAAqB,CAC5B,QAAuC,EACvC,UAAuC,EACvC,cAA2B,EAC3B,aAAqB,EACrB,WAAmC;IAEnC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,yFAAyF;QACzF,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,YAAY,IAAI,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,QAAQ;YAAE,SAAS;QAC7B,WAAW,IAAI,CAAC,CAAC;QACjB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QACvD,IAAI,MAAM,GAAG,CAAC;YAAE,SAAS;QACzB,kBAAkB,IAAI,CAAC,CAAC;QACxB,IAAI,MAAM,KAAK,CAAC;YAAE,mBAAmB,IAAI,CAAC,CAAC;QAC3C,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;YAAE,SAAS;QACnD,IAAI,MAAM,KAAK,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;;YAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,aAAa,CACX,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,sBAAsB,EACtB,SAAS,EACT,4FAA4F,EAC5F,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,uCAAuC,EAC1D,6FAA6F,CAC9F,CAAC;IACF,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,oBAAoB,EACpB,MAAM,EACN,+GAA+G,EAC/G,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,+CAA+C,EAClE,kHAAkH,CACnH,CAAC;IACF,OAAO;QACL,QAAQ;QACR,OAAO,EAAE;YACP,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;YACpC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;YACpC,aAAa,EAAE,MAAM,CAAC,WAAW,CAC/B,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CACnD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAC1B,CACF;YACD,YAAY,EAAE,WAAW;YACzB,aAAa,EAAE,YAAY;YAC3B,qBAAqB,EAAE,mBAAmB;YAC1C,2BAA2B,EAAE,kBAAkB;SAChD;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,+BAA+B,CAC7C,QAAuC,EACvC,UAAoC,EAAE;IAEtC,MAAM,UAAU,GACd,OAAO,CAAC,UAAU;QAClB,CAAC,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,UAAU,CAAC,CAAC;IACrE,MAAM,SAAS,GACb,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAClE,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,uBAAuB,CAAC;IACvE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,aAAa,GAAG,CAAC;QACvD,MAAM,IAAI,SAAS,CACjB,+BAA+B,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAC/D,CAAC;IACJ,MAAM,cAAc,GAAG,IAAI,GAAG,CAC5B,CAAC,OAAO,CAAC,cAAc,IAAI,EAAE,CAAC;SAC3B,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC;SACpD,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CACxC,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,EAAE;QACT;YACE,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,OAAO,EAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;YAC3D,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;SACpC;KACF,CAAC,CACH,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IAEjC,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE;QACvC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,wBAAwB,CACvC,QAAQ,EACR,UAAU,EACV,aAAa,CACd,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CACX,GAAG,uBAAuB,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,CAC3E,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CACX,GAAG,4BAA4B,CAAC,QAAQ,EAAE,UAAU,EAAE,aAAa,CAAC,CACrE,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAG,qBAAqB,CACpC,QAAQ,EACR,UAAU,EACV,cAAc,EACd,aAAa,EACb,WAAW,CACZ,CAAC;IACF,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAEpC,QAAQ,CAAC,IAAI,CACX,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC5D,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAClD,CAAC;IACF,OAAO;QACL,QAAQ;QACR,OAAO,EAAE,QAAQ,CAAC,OAAO;KAC1B,CAAC;AACJ,CAAC","debugId":"a78eee2f-0423-565f-91b6-88d0ab46d529"}
+{"version":3,"file":"governance.js","sources":["sdk/graph/governance.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/governance\n *\n * Policy-aware relationship-graph quality audit shared by validation, health,\n * and package governance surfaces. The audit inspects one assembled workspace\n * graph and reports machine-readable findings — integrity gaps, ordering\n * cycles, duplicated edge spellings, stale lifecycle blocks, and coverage\n * outliers — without inventing edges or assuming that sparse connectivity is\n * defective. Findings gate severity on lifecycle: contradictions confined to\n * terminal items downgrade to informational `legacy_*` codes because repairing\n * them would mutate closed history. Every finding names the violated policy,\n * carries a deterministic bounded sample, and proposes a safe next action so\n * agents can plan remediation without re-deriving context.\n */\nimport type { RelationshipEdge } from \"../relationships.js\";\nimport {\n  isTransitiveKind,\n  orientTransitiveEdge,\n  transitiveFamilyKey,\n} from \"./analytics.js\";\nimport type { WorkspaceRelationshipAssembly } from \"./assembly.js\";\n\n/** Severity ladder shared by every relationship audit finding. */\nexport type RelationshipAuditSeverity = \"error\" | \"warning\" | \"info\";\n\n/** Machine-readable identifier for one relationship audit finding family. */\nexport type RelationshipAuditFindingCode =\n  | \"missing_reference_active\"\n  | \"missing_reference_terminal\"\n  | \"legacy_no_blocker_sentinel\"\n  | \"ordering_cycle\"\n  | \"legacy_ordering_cycle\"\n  | \"duplicate_edge\"\n  | \"legacy_duplicate_edge\"\n  | \"duplicate_dependency_row\"\n  | \"legacy_duplicate_dependency_row\"\n  | \"stale_lifecycle_block\"\n  | \"isolated_active_node\"\n  | \"sparse_active_node\";\n\n/** One policy-aware relationship audit finding with bounded evidence. */\nexport interface RelationshipAuditFinding {\n  /** Machine-readable finding family identifier. */\n  code: RelationshipAuditFindingCode;\n  /** Severity of the violated policy. */\n  severity: RelationshipAuditSeverity;\n  /** Policy statement this finding violates. */\n  policy: string;\n  /** Human-readable summary including the affected count. */\n  message: string;\n  /** Total number of affected subjects, independent of sample bounding. */\n  count: number;\n  /** Deterministic bounded sample of affected subjects. */\n  sample: string[];\n  /** Whether {@link sample} was truncated by the configured sample bound. */\n  sample_truncated: boolean;\n  /** Safe machine-actionable next step; audits never invent or auto-apply edges. */\n  remediation: string;\n}\n\n/** Per-item-type connectivity coverage inside a coverage profile. */\nexport interface RelationshipCoverageTypeProfile {\n  /** Active nodes declaring this item type. */\n  active: number;\n  /** Active nodes of this type with no incident edges. */\n  isolated: number;\n  /** Active nodes of this type with at most one incident edge, isolates included. */\n  degree_leq_one: number;\n}\n\n/** Aggregate structural coverage metrics for one assembled workspace graph. */\nexport interface RelationshipCoverageProfile {\n  /** Total indexed nodes including materialized missing placeholders. */\n  nodes: number;\n  /** Total deduplicated indexed edges. */\n  edges: number;\n  /** Deterministic per-kind edge counts. */\n  edges_by_kind: Record<string, number>;\n  /** Nodes whose lifecycle status is active (non-terminal, non-missing). */\n  active_nodes: number;\n  /** Materialized placeholder nodes for referenced-but-absent items. */\n  missing_nodes: number;\n  /** Active nodes with no incident edges at all. */\n  isolated_active_nodes: number;\n  /** Active nodes with at most one incident edge, isolates included. */\n  degree_leq_one_active_nodes: number;\n  /** Deterministic per-type connectivity coverage; untyped nodes bucket under `(untyped)`. */\n  coverage_by_type: Record<string, RelationshipCoverageTypeProfile>;\n}\n\n/** Tuning and policy inputs accepted by the relationship audit. */\nexport interface RelationshipAuditOptions {\n  /** Terminal-lifecycle predicate; defaults to the built-in closed/canceled statuses. */\n  isTerminal?: (status: string) => boolean;\n  /** Blocked-lifecycle predicate for stale-block detection; defaults to `status === \"blocked\"`. */\n  isBlocked?: (status: string) => boolean;\n  /** Node identifiers that are explicitly valid isolates (roots, archives, scratch work). */\n  exemptIsolates?: readonly string[];\n  /** Item types whose active nodes are policy-valid isolates or sparse nodes (case-insensitive); they stay in the coverage profile but raise no coverage finding. */\n  isolateExemptTypes?: readonly string[];\n  /** Maximum sample entries retained per finding; defaults to 25. */\n  maxSampleSize?: number;\n  /** Abort signal checked between finding families. */\n  signal?: AbortSignal;\n}\n\n/** Complete deterministic result of one relationship-graph audit. */\nexport interface RelationshipAuditReport {\n  /** Findings ordered by severity, then code, then first sample subject. */\n  findings: RelationshipAuditFinding[];\n  /** Structural coverage metrics computed during the audit. */\n  profile: RelationshipCoverageProfile;\n}\n\n/** Default bounded sample size applied to every finding family. */\nconst DEFAULT_MAX_SAMPLE_SIZE = 25;\n\n/** Rank used to order findings by decreasing severity. */\nconst SEVERITY_RANK: Record<RelationshipAuditSeverity, number> = {\n  error: 0,\n  warning: 1,\n  info: 2,\n};\n\n/** Internal per-node lifecycle classification resolved once per audit. */\ninterface AuditNodeState {\n  /** Original-case node identifier. */\n  id: string;\n  /** Raw lifecycle status string from assembly details. */\n  status: string;\n  /** Whether the node is a materialized missing placeholder. */\n  missing: boolean;\n  /** Whether the node's lifecycle status is terminal. */\n  terminal: boolean;\n  /** Declared item type, when the assembly carried one. */\n  type?: string;\n}\n\n/** Mutable state shared by iterative Tarjan frames. */\ninterface TarjanState {\n  /** Discovery index assigned to each visited node. */\n  indexes: Map<string, number>;\n  /** Lowest reachable discovery index per visited node. */\n  lowLinks: Map<string, number>;\n  /** Nodes that still belong to an unfinished component. */\n  onStack: Set<string>;\n  /** Component-membership stack. */\n  stack: string[];\n  /** Completed cyclic components. */\n  components: string[][];\n  /** Discovery index assigned to the next unseen node. */\n  nextIndex: number;\n}\n\n/** One explicit depth-first frame used by iterative Tarjan traversal. */\ninterface TarjanFrame {\n  /** Node currently being expanded. */\n  node: string;\n  /** Index of the next successor to inspect. */\n  neighborIndex: number;\n}\n\n/** Build one finding with deterministic bounded sampling over sorted subjects. */\nfunction buildFinding(\n  code: RelationshipAuditFindingCode,\n  severity: RelationshipAuditSeverity,\n  policy: string,\n  describe: (count: number) => string,\n  subjects: readonly string[],\n  maxSampleSize: number,\n  remediation: string,\n): RelationshipAuditFinding {\n  const sorted = [...subjects].sort((left, right) => left.localeCompare(right));\n  return {\n    code,\n    severity,\n    policy,\n    message: describe(sorted.length),\n    count: sorted.length,\n    sample: sorted.slice(0, maxSampleSize),\n    sample_truncated: sorted.length > maxSampleSize,\n    remediation,\n  };\n}\n/** Resolve the ordering-only successor adjacency for cycle analysis. */\nfunction buildOrderingAdjacency(\n  assembly: WorkspaceRelationshipAssembly,\n): Map<string, string[]> {\n  const registry = assembly.graph.registry();\n  const successors = new Map<string, string[]>();\n  for (const edge of assembly.graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!definition.ordering) continue;\n    // Orient every ordering edge predecessor -> successor so inverse spellings\n    // (blocked_by/blocks) land in one canonical execution-order digraph.\n    const [predecessor, successor] =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"target_before_source\"\n        ? [edge.target, edge.source]\n        : [edge.source, edge.target];\n    const adjacent = successors.get(predecessor);\n    if (adjacent) adjacent.push(successor);\n    else successors.set(predecessor, [successor]);\n  }\n  for (const adjacent of successors.values())\n    adjacent.sort((left, right) => left.localeCompare(right));\n  return successors;\n}\n\n/** Register one newly discovered Tarjan node. */\nfunction registerTarjanNode(node: string, state: TarjanState): void {\n  state.indexes.set(node, state.nextIndex);\n  state.lowLinks.set(node, state.nextIndex);\n  state.nextIndex += 1;\n  state.stack.push(node);\n  state.onStack.add(node);\n}\n\n/** Visit one pending successor, returning whether the frame had work left. */\nfunction visitNextTarjanNeighbor(\n  frame: TarjanFrame,\n  frames: TarjanFrame[],\n  successors: Map<string, string[]>,\n  state: TarjanState,\n): boolean {\n  const neighbors = successors.get(frame.node) ?? [];\n  if (frame.neighborIndex >= neighbors.length) return false;\n  const neighbor = neighbors[frame.neighborIndex]!;\n  frame.neighborIndex += 1;\n  if (!state.indexes.has(neighbor)) {\n    registerTarjanNode(neighbor, state);\n    frames.push({ node: neighbor, neighborIndex: 0 });\n  } else if (state.onStack.has(neighbor)) {\n    state.lowLinks.set(\n      frame.node,\n      Math.min(state.lowLinks.get(frame.node)!, state.indexes.get(neighbor)!),\n    );\n  }\n  return true;\n}\n\n/** Complete one Tarjan frame and emit its component when it is a root. */\nfunction completeTarjanFrame(\n  frame: TarjanFrame,\n  frames: TarjanFrame[],\n  successors: Map<string, string[]>,\n  state: TarjanState,\n): void {\n  frames.pop();\n  const parent = frames.at(-1);\n  if (parent)\n    state.lowLinks.set(\n      parent.node,\n      Math.min(\n        state.lowLinks.get(parent.node)!,\n        state.lowLinks.get(frame.node)!,\n      ),\n    );\n  if (state.lowLinks.get(frame.node) !== state.indexes.get(frame.node)) return;\n  const component: string[] = [];\n  while (true) {\n    const member = state.stack.pop()!;\n    state.onStack.delete(member);\n    component.push(member);\n    if (member === frame.node) break;\n  }\n  if (\n    component.length > 1 ||\n    (component.length === 1 &&\n      successors.get(component[0]!)?.includes(component[0]!))\n  )\n    state.components.push(\n      component.sort((left, right) => left.localeCompare(right)),\n    );\n}\n\n/**\n * Enumerate strongly connected components with more than one member (or a\n * self-loop) over an ordering-only successor digraph using an iterative Tarjan\n * traversal. Only order-bearing kinds should participate: associative kinds\n * such as `related` cannot create execution-order contradictions and stay out\n * of cycle analysis by policy. Exported so incremental consumers (mutation\n * advisories) share one cycle semantics with the workspace audit.\n */\nexport function collectOrderingCycles(\n  successors: Map<string, string[]>,\n): string[][] {\n  const state: TarjanState = {\n    indexes: new Map(),\n    lowLinks: new Map(),\n    onStack: new Set(),\n    stack: [],\n    components: [],\n    nextIndex: 0,\n  };\n  const roots = [...successors.keys()].sort((left, right) =>\n    left.localeCompare(right),\n  );\n  for (const root of roots) {\n    if (state.indexes.has(root)) continue;\n    // Explicit frame stack keeps the traversal safe on deep dependency chains.\n    const frames: TarjanFrame[] = [{ node: root, neighborIndex: 0 }];\n    registerTarjanNode(root, state);\n    while (frames.length > 0) {\n      const frame = frames.at(-1)!;\n      if (visitNextTarjanNeighbor(frame, frames, successors, state)) continue;\n      completeTarjanFrame(frame, frames, successors, state);\n    }\n  }\n  return state.components.sort((left, right) =>\n    left[0]!.localeCompare(right[0]!),\n  );\n}\n\n/** Format one dangling reference as a compact deterministic evidence string. */\nfunction formatDanglingReference(reference: {\n  holder_id: string;\n  target_id: string;\n  kind: string;\n}): string {\n  return `${reference.holder_id} -> ${reference.target_id} (${reference.kind})`;\n}\n\n/** Append one finding only when its subject collection is non-empty. */\nfunction appendFinding(\n  findings: RelationshipAuditFinding[],\n  subjects: readonly string[],\n  maxSampleSize: number,\n  code: RelationshipAuditFindingCode,\n  severity: RelationshipAuditSeverity,\n  policy: string,\n  describe: (count: number) => string,\n  remediation: string,\n): void {\n  if (subjects.length === 0) return;\n  findings.push(\n    buildFinding(\n      code,\n      severity,\n      policy,\n      describe,\n      subjects,\n      maxSampleSize,\n      remediation,\n    ),\n  );\n}\n\n/** Collect dangling-reference and retired-sentinel governance findings. */\nfunction collectIntegrityFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  isTerminal: (status: string) => boolean,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const findings: RelationshipAuditFinding[] = [];\n  const references = [\n    ...assembly.dangling.active,\n    ...assembly.dangling.legacy_terminal,\n  ].filter((reference) => !reference.no_active_blocker_sentinel);\n  appendFinding(\n    findings,\n    references\n      .filter((reference) => !isTerminal(reference.holder_status))\n      .map(formatDanglingReference),\n    maxSampleSize,\n    \"missing_reference_active\",\n    \"error\",\n    \"Active items must not reference absent targets; missing prerequisites distort scheduling.\",\n    (count) => `${count} active dangling reference(s) to absent items`,\n    \"Restore or re-create the referenced item, or remove/retype the reference on the holder.\",\n  );\n  appendFinding(\n    findings,\n    references\n      .filter((reference) => isTerminal(reference.holder_status))\n      .map(formatDanglingReference),\n    maxSampleSize,\n    \"missing_reference_terminal\",\n    \"info\",\n    \"Terminal items may retain historical references, but absent targets remain unexplainable context.\",\n    (count) => `${count} terminal dangling reference(s) to absent items`,\n    \"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.\",\n  );\n  appendFinding(\n    findings,\n    assembly.dangling.no_active_blocker_sentinels.map(formatDanglingReference),\n    maxSampleSize,\n    \"legacy_no_blocker_sentinel\",\n    \"info\",\n    \"The pre-structured-dependency no-active-blocker sentinel is retired; real edges carry blocker state.\",\n    (count) => `${count} legacy no-active-blocker sentinel reference(s)`,\n    \"Delete the sentinel reference; blocker state is derived from blocked_by edges.\",\n  );\n  return findings;\n}\n\n/** Decide whether one audited node still participates in active scheduling. */\nfunction isActiveAuditMember(\n  member: string,\n  nodeStates: Map<string, AuditNodeState>,\n): boolean {\n  const state = nodeStates.get(member);\n  // A trimmed or custom assembly may omit a member's details. Treat that\n  // unknown lifecycle conservatively as active so contradictions are never\n  // silently downgraded to legacy history debt.\n  if (!state) return true;\n  return !state.terminal;\n}\n\n/** Collect ordering-cycle and lifecycle-block governance findings. */\nfunction collectOrderingFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  isBlocked: (status: string) => boolean,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const findings: RelationshipAuditFinding[] = [];\n  const orderingAdjacency = buildOrderingAdjacency(assembly);\n  for (const cycle of collectOrderingCycles(orderingAdjacency)) {\n    // A cycle whose members are all terminal is a historical contradiction:\n    // it cannot make live work unschedulable, and \"repairing\" it would touch\n    // closed items (changelog drag), so it downgrades to informational debt.\n    const active = cycle.some((member) =>\n      isActiveAuditMember(member, nodeStates),\n    );\n    findings.push(\n      active\n        ? buildFinding(\n            \"ordering_cycle\",\n            \"error\",\n            \"Order-bearing relationship kinds must stay acyclic; a cycle makes every member unschedulable.\",\n            (count) => `execution-order cycle across ${count} item(s)`,\n            cycle,\n            maxSampleSize,\n            \"Remove or retype one ordering edge inside the cycle, or split the work so precedence is linear.\",\n          )\n        : buildFinding(\n            \"legacy_ordering_cycle\",\n            \"info\",\n            \"Ordering cycles between exclusively terminal items are historical contradictions with no scheduling effect.\",\n            (count) =>\n              `terminal-only execution-order cycle across ${count} item(s)`,\n            cycle,\n            maxSampleSize,\n            \"Leave as history debt, or clean up in a dedicated changelog-safe closed-item batch; never repair closed items ad hoc.\",\n          ),\n    );\n  }\n  const predecessorsByNode = new Map<string, string[]>();\n  for (const [predecessor, adjacent] of orderingAdjacency)\n    for (const successor of adjacent) {\n      const predecessors = predecessorsByNode.get(successor);\n      if (predecessors) predecessors.push(predecessor);\n      else predecessorsByNode.set(successor, [predecessor]);\n    }\n  const staleLifecycleBlocks = [...nodeStates.values()]\n    .filter(\n      (state) =>\n        !state.missing &&\n        !state.terminal &&\n        isBlocked(state.status) &&\n        !(predecessorsByNode.get(state.id) ?? []).some((predecessor) => {\n          const predecessorState = nodeStates.get(predecessor);\n          // A trimmed/custom assembly may omit predecessor details. Treat that\n          // unknown state conservatively as potentially open instead of\n          // falsely declaring the lifecycle block stale.\n          return predecessorState === undefined || !predecessorState.terminal;\n        }),\n    )\n    .map((state) => state.id);\n  appendFinding(\n    findings,\n    staleLifecycleBlocks,\n    maxSampleSize,\n    \"stale_lifecycle_block\",\n    \"warning\",\n    \"A blocked lifecycle status must be backed by at least one open ordering predecessor.\",\n    (count) => `${count} status-blocked item(s) with no open blocker edge`,\n    \"Re-open the missing prerequisite as an edge, or move the item back to an active status.\",\n  );\n  return findings;\n}\n\n/** One duplicate-edge group in semantic orientation with its stored spellings. */\nexport interface DuplicateRelationshipEdgeGroup {\n  /** Semantic tail node shared by every stored spelling. */\n  from: string;\n  /** Semantic head node shared by every stored spelling. */\n  to: string;\n  /** Stored parallel edges sorted by kind. */\n  edges: RelationshipEdge[];\n}\n\n/** Format one duplicate-edge group as a compact deterministic evidence string. */\nexport function formatDuplicateEdgeGroup(\n  group: DuplicateRelationshipEdgeGroup,\n): string {\n  const kinds = group.edges\n    .map((edge) => edge.kind)\n    .sort((left, right) => left.localeCompare(right));\n  return `${group.from} -> ${group.to} (${kinds.join(\" + \")})`;\n}\n\n/**\n * Collect the groups of parallel same-family stored edges over the directed\n * ordering and hierarchy families. Each family joins a kind with its inverse\n * spelling in semantic orientation, so a reciprocal pair such as\n * `A blocked_by B` plus `B blocks A` collapses onto one oriented endpoint\n * pair. Only groups holding at least two stored spellings are returned, in\n * deterministic orientation order with per-group edges sorted by kind, source,\n * then target — the exact stored identities remediation planning targets.\n */\nexport function collectDuplicateRelationshipEdgeGroups(\n  assembly: WorkspaceRelationshipAssembly,\n): DuplicateRelationshipEdgeGroup[] {\n  const registry = assembly.graph.registry();\n  const groups = new Map<string, DuplicateRelationshipEdgeGroup>();\n  for (const edge of assembly.graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!isTransitiveKind(definition)) continue;\n    const oriented = orientTransitiveEdge(edge, definition);\n    if (oriented.from === oriented.to) continue;\n    const key = `${transitiveFamilyKey(definition)}::${oriented.from}::${oriented.to}`;\n    const group = groups.get(key);\n    if (group) group.edges.push(edge);\n    else groups.set(key, { ...oriented, edges: [edge] });\n  }\n  const duplicated = [...groups.values()].filter(\n    (group) => group.edges.length >= 2,\n  );\n  // Within one oriented group every stored spelling has a distinct kind: a\n  // same-kind restatement of the same oriented pair would carry identical\n  // endpoints and is deduplicated by edge identity during graph construction.\n  for (const group of duplicated)\n    group.edges.sort((left, right) => left.kind.localeCompare(right.kind));\n  return duplicated.sort(\n    (left, right) =>\n      left.from.localeCompare(right.from) || left.to.localeCompare(right.to),\n  );\n}\n\n/**\n * Collect duplicate stored-edge findings from the oriented duplicate groups.\n * Transitive-reduction redundancy analysis deliberately skips the direct edge\n * under test, so these exact parallels are invisible there and this is the\n * only surface that reports them.\n */\nfunction collectDuplicateEdgeFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const active: string[] = [];\n  const legacy: string[] = [];\n  for (const group of collectDuplicateRelationshipEdgeGroups(assembly)) {\n    const subjects =\n      isActiveAuditMember(group.from, nodeStates) ||\n      isActiveAuditMember(group.to, nodeStates)\n        ? active\n        : legacy;\n    subjects.push(formatDuplicateEdgeGroup(group));\n  }\n  const findings: RelationshipAuditFinding[] = [];\n  appendFinding(\n    findings,\n    active,\n    maxSampleSize,\n    \"duplicate_edge\",\n    \"info\",\n    \"One semantic relationship should be stored once; parallel same-family spellings (reciprocal inverse pairs included) add no information and skew degree metrics.\",\n    (count) => `${count} duplicated relationship(s) between active endpoints`,\n    \"Remove all but one stored spelling of the relationship; keep the canonical direction the holder declared first.\",\n  );\n  appendFinding(\n    findings,\n    legacy,\n    maxSampleSize,\n    \"legacy_duplicate_edge\",\n    \"info\",\n    \"Duplicated spellings between exclusively terminal items are historical noise with no scheduling effect.\",\n    (count) => `${count} duplicated relationship(s) between terminal endpoints`,\n    \"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.\",\n  );\n  return findings;\n}\n\n/**\n * Collect storage-integrity findings for raw dependency rows whose exact\n * identity is stored more than once on one holder. Graph edge-identity dedup\n * hides these from every assembled-graph surface (duplicate_edge only covers\n * cross-spelling parallels), so the audit reports them from the pre-assembly\n * scan carried on the assembly.\n */\nfunction collectDuplicateRowFindings(\n  assembly: WorkspaceRelationshipAssembly,\n  maxSampleSize: number,\n): RelationshipAuditFinding[] {\n  const active: string[] = [];\n  const legacy: string[] = [];\n  // Public/JSON-parsed assemblies produced before duplicate-row governance may omit this field.\n  for (const row of assembly.duplicateRows ?? []) {\n    (row.legacy_terminal ? legacy : active).push(\n      `${row.holder_id} -> ${row.target_id} (${row.kind} x${row.occurrences})`,\n    );\n  }\n  const findings: RelationshipAuditFinding[] = [];\n  appendFinding(\n    findings,\n    active,\n    maxSampleSize,\n    \"duplicate_dependency_row\",\n    \"warning\",\n    \"One dependency row must be stored once per holder; identical repeated rows are a storage-layer defect invisible to the assembled graph.\",\n    (count) =>\n      `${count} exactly duplicated stored dependency row(s) on active holder(s)`,\n    \"Remove the repeated rows so the dependency is stored exactly once; graph semantics are unchanged.\",\n  );\n  appendFinding(\n    findings,\n    legacy,\n    maxSampleSize,\n    \"legacy_duplicate_dependency_row\",\n    \"info\",\n    \"Identical repeated dependency rows on terminal holders are historical storage noise with no scheduling effect.\",\n    (count) =>\n      `${count} exactly duplicated stored dependency row(s) on terminal holder(s)`,\n    \"Leave as history debt or clean up in a dedicated changelog-safe closed-item batch.\",\n  );\n  return findings;\n}\n\n/** Compute structural coverage metrics and coverage-policy findings. */\n/** Mutable coverage tallies accumulated across active graph nodes. */\ninterface CoverageTallies {\n  /** Active node count. */\n  active: number;\n  /** Missing placeholder count. */\n  missing: number;\n  /** Isolated active node count. */\n  isolated: number;\n  /** Degree-at-most-one active node count, isolates included. */\n  degreeLeqOne: number;\n  /** Non-exempt isolate finding subjects. */\n  isolates: string[];\n  /** Non-exempt single-edge finding subjects. */\n  sparse: string[];\n  /** Per-type connectivity tallies. */\n  byType: Map<string, RelationshipCoverageTypeProfile>;\n}\n\n/** Fold one active node's degree into the aggregate and per-type coverage tallies. */\nfunction tallyActiveCoverageNode(\n  tallies: CoverageTallies,\n  state: AuditNodeState,\n  degree: number,\n  exemptIsolates: Set<string>,\n  isolateExemptTypes: Set<string>,\n): void {\n  tallies.active += 1;\n  const typeKey = state.type ?? \"(untyped)\";\n  let typeProfile = tallies.byType.get(typeKey);\n  if (!typeProfile) {\n    typeProfile = { active: 0, isolated: 0, degree_leq_one: 0 };\n    tallies.byType.set(typeKey, typeProfile);\n  }\n  typeProfile.active += 1;\n  if (degree > 1) return;\n  tallies.degreeLeqOne += 1;\n  typeProfile.degree_leq_one += 1;\n  if (degree === 0) {\n    tallies.isolated += 1;\n    typeProfile.isolated += 1;\n  }\n  if (\n    exemptIsolates.has(state.id.toLowerCase()) ||\n    isolateExemptTypes.has(typeKey.toLowerCase())\n  )\n    return;\n  if (degree === 0) tallies.isolates.push(state.id);\n  else tallies.sparse.push(state.id);\n}\n\nfunction collectCoverageReport(\n  assembly: WorkspaceRelationshipAssembly,\n  nodeStates: Map<string, AuditNodeState>,\n  exemptIsolates: Set<string>,\n  isolateExemptTypes: Set<string>,\n  maxSampleSize: number,\n  edgesByKind: Record<string, number>,\n): RelationshipAuditReport {\n  const tallies: CoverageTallies = {\n    active: 0,\n    missing: 0,\n    isolated: 0,\n    degreeLeqOne: 0,\n    isolates: [],\n    sparse: [],\n    byType: new Map(),\n  };\n  for (const id of assembly.graph.nodes()) {\n    const state = nodeStates.get(id);\n    /* c8 ignore next -- every graph node originates from assembly details by construction */\n    if (!state) continue;\n    if (state.missing) {\n      tallies.missing += 1;\n      continue;\n    }\n    if (state.terminal) continue;\n    tallyActiveCoverageNode(\n      tallies,\n      state,\n      assembly.graph.incidentEdges(id).length,\n      exemptIsolates,\n      isolateExemptTypes,\n    );\n  }\n  const { isolates, sparse } = tallies;\n  const findings: RelationshipAuditFinding[] = [];\n  appendFinding(\n    findings,\n    isolates,\n    maxSampleSize,\n    \"isolated_active_node\",\n    \"warning\",\n    \"Active work should be reachable from the graph unless explicitly declared a valid isolate.\",\n    (count) => `${count} active item(s) with no relationships`,\n    \"Link the item to its parent, prerequisite, or origin — or register it as an exempt isolate.\",\n  );\n  appendFinding(\n    findings,\n    sparse,\n    maxSampleSize,\n    \"sparse_active_node\",\n    \"info\",\n    \"Active items with a single edge often miss an honest semantic partner; sparse is not automatically defective.\",\n    (count) => `${count} active item(s) with exactly one relationship`,\n    \"Investigate for an honest second edge (story->task, defect family, cross-epic complement); do not fabricate one.\",\n  );\n  return {\n    findings,\n    profile: {\n      nodes: assembly.graph.nodes().length,\n      edges: assembly.graph.edges().length,\n      edges_by_kind: Object.fromEntries(\n        Object.entries(edgesByKind).sort(([left], [right]) =>\n          left.localeCompare(right),\n        ),\n      ),\n      active_nodes: tallies.active,\n      missing_nodes: tallies.missing,\n      isolated_active_nodes: tallies.isolated,\n      degree_leq_one_active_nodes: tallies.degreeLeqOne,\n      coverage_by_type: Object.fromEntries(\n        [...tallies.byType.entries()].sort(([left], [right]) =>\n          left < right ? -1 : 1,\n        ),\n      ),\n    },\n  };\n}\n\n/**\n * Audit one assembled workspace relationship graph against the shared\n * governance policy and return deterministic machine-readable findings plus a\n * structural coverage profile.\n *\n * The audit is read-only and never proposes inventing an edge: integrity\n * findings report evidence for investigation, coverage findings honor explicit\n * isolate exemptions, and cycle findings enumerate the strongly connected\n * members so callers can decide which edge to retype, remove, or waive.\n */\nexport function auditWorkspaceRelationshipGraph(\n  assembly: WorkspaceRelationshipAssembly,\n  options: RelationshipAuditOptions = {},\n): RelationshipAuditReport {\n  const isTerminal =\n    options.isTerminal ??\n    ((status: string) => status === \"closed\" || status === \"canceled\");\n  const isBlocked =\n    options.isBlocked ?? ((status: string) => status === \"blocked\");\n  const maxSampleSize = options.maxSampleSize ?? DEFAULT_MAX_SAMPLE_SIZE;\n  if (!Number.isInteger(maxSampleSize) || maxSampleSize < 1)\n    throw new TypeError(\n      `Invalid audit sample bound: ${String(options.maxSampleSize)}`,\n    );\n  const exemptIsolates = new Set(\n    (options.exemptIsolates ?? [])\n      .filter((id): id is string => typeof id === \"string\")\n      .map((id) => id.trim().toLowerCase()),\n  );\n  const isolateExemptTypes = new Set(\n    (options.isolateExemptTypes ?? [])\n      .filter((type): type is string => typeof type === \"string\")\n      .map((type) => type.trim().toLowerCase()),\n  );\n  const nodeStates = new Map<string, AuditNodeState>(\n    assembly.details.map((detail) => [\n      detail.id,\n      {\n        id: detail.id,\n        status: detail.status,\n        missing: assembly.missingIdSet.has(detail.id.toLowerCase()),\n        terminal: isTerminal(detail.status),\n        ...(detail.type === undefined ? {} : { type: detail.type }),\n      },\n    ]),\n  );\n  options.signal?.throwIfAborted();\n\n  const edgesByKind: Record<string, number> = {};\n  for (const edge of assembly.graph.edges())\n    edgesByKind[edge.kind] = (edgesByKind[edge.kind] ?? 0) + 1;\n  const findings = collectIntegrityFindings(\n    assembly,\n    isTerminal,\n    maxSampleSize,\n  );\n  options.signal?.throwIfAborted();\n  findings.push(\n    ...collectOrderingFindings(assembly, nodeStates, isBlocked, maxSampleSize),\n  );\n  options.signal?.throwIfAborted();\n  findings.push(\n    ...collectDuplicateEdgeFindings(assembly, nodeStates, maxSampleSize),\n    ...collectDuplicateRowFindings(assembly, maxSampleSize),\n  );\n  options.signal?.throwIfAborted();\n  const coverage = collectCoverageReport(\n    assembly,\n    nodeStates,\n    exemptIsolates,\n    isolateExemptTypes,\n    maxSampleSize,\n    edgesByKind,\n  );\n  findings.push(...coverage.findings);\n\n  findings.sort(\n    (left, right) =>\n      SEVERITY_RANK[left.severity] - SEVERITY_RANK[right.severity] ||\n      left.code.localeCompare(right.code) ||\n      left.sample[0]!.localeCompare(right.sample[0]!),\n  );\n  return {\n    findings,\n    profile: coverage.profile,\n  };\n}\n\n/** One persisted point-in-time audit census used for temporal comparison. */\nexport interface RelationshipAuditSnapshot {\n  /** ISO timestamp the snapshot was taken at. */\n  saved_at: string;\n  /** Workspace graph fingerprint of the audited item snapshot. */\n  fingerprint: string;\n  /** Affected-subject counts keyed by finding code at snapshot time. */\n  affected_subjects_by_code: Record<string, number>;\n  /** Structural coverage profile at snapshot time. */\n  profile: RelationshipCoverageProfile;\n}\n\n/** Signed change between two audit snapshots; zero-change keys are dropped. */\nexport interface RelationshipAuditDelta {\n  /** ISO timestamp of the baseline snapshot the delta is measured against. */\n  baseline_saved_at: string;\n  /** Whether both snapshots audited the identical workspace fingerprint. */\n  same_snapshot: boolean;\n  /** Signed affected-subject deltas keyed by finding code. */\n  affected_subjects_by_code: Record<string, number>;\n  /** Signed structural profile deltas. */\n  profile: {\n    /** Node-count change including missing placeholders. */\n    nodes: number;\n    /** Deduplicated edge-count change. */\n    edges: number;\n    /** Active-node-count change. */\n    active_nodes: number;\n    /** Missing-placeholder-count change. */\n    missing_nodes: number;\n    /** Isolated-active-node-count change. */\n    isolated_active_nodes: number;\n    /** Degree-at-most-one active-node-count change. */\n    degree_leq_one_active_nodes: number;\n    /** Signed per-kind edge-count deltas; unchanged kinds are dropped. */\n    edges_by_kind: Record<string, number>;\n    /** Signed per-type coverage deltas; unchanged types are dropped. */\n    coverage_by_type: Record<string, RelationshipCoverageTypeProfile>;\n  };\n}\n\n/** Subtract two count records, keeping only non-zero signed deltas in sorted key order. */\nfunction diffCountRecords(\n  baseline: Record<string, number>,\n  current: Record<string, number>,\n): Record<string, number> {\n  const keys = [\n    ...new Set([...Object.keys(baseline), ...Object.keys(current)]),\n  ].sort();\n  const deltas: Record<string, number> = {};\n  for (const key of keys) {\n    const delta = (current[key] ?? 0) - (baseline[key] ?? 0);\n    if (delta !== 0) deltas[key] = delta;\n  }\n  return deltas;\n}\n\n/** Read per-type coverage defensively from current or legacy runtime snapshots. */\nfunction readSnapshotCoverageByType(\n  snapshot: RelationshipAuditSnapshot,\n): Record<string, RelationshipCoverageTypeProfile> {\n  return snapshot.profile.coverage_by_type ?? {};\n}\n\n/**\n * Compare two point-in-time audit snapshots and return the signed change in\n * findings and structural coverage. This is the temporal primitive behind\n * change-since-baseline audit reporting: agents track census drift across\n * sessions without re-deriving or storing full finding collections.\n */\nexport function diffRelationshipAuditSnapshots(\n  baseline: RelationshipAuditSnapshot,\n  current: RelationshipAuditSnapshot,\n): RelationshipAuditDelta {\n  const coverageByType: Record<string, RelationshipCoverageTypeProfile> = {};\n  // Public SDK callers may compare legacy or JSON-decoded snapshots created\n  // before per-type coverage was added, even though current typed snapshots\n  // always carry this field.\n  const baselineCoverageByType = readSnapshotCoverageByType(baseline);\n  const currentCoverageByType = readSnapshotCoverageByType(current);\n  const typeKeys = [\n    ...new Set([\n      ...Object.keys(baselineCoverageByType),\n      ...Object.keys(currentCoverageByType),\n    ]),\n  ].sort();\n  for (const type of typeKeys) {\n    const before = baselineCoverageByType[type];\n    const after = currentCoverageByType[type];\n    const delta = {\n      active: (after?.active ?? 0) - (before?.active ?? 0),\n      isolated: (after?.isolated ?? 0) - (before?.isolated ?? 0),\n      degree_leq_one:\n        (after?.degree_leq_one ?? 0) - (before?.degree_leq_one ?? 0),\n    };\n    if (Object.values(delta).some((value) => value !== 0))\n      coverageByType[type] = delta;\n  }\n  return {\n    baseline_saved_at: baseline.saved_at,\n    same_snapshot: baseline.fingerprint === current.fingerprint,\n    affected_subjects_by_code: diffCountRecords(\n      baseline.affected_subjects_by_code,\n      current.affected_subjects_by_code,\n    ),\n    profile: {\n      nodes: current.profile.nodes - baseline.profile.nodes,\n      edges: current.profile.edges - baseline.profile.edges,\n      active_nodes:\n        current.profile.active_nodes - baseline.profile.active_nodes,\n      missing_nodes:\n        current.profile.missing_nodes - baseline.profile.missing_nodes,\n      isolated_active_nodes:\n        current.profile.isolated_active_nodes -\n        baseline.profile.isolated_active_nodes,\n      degree_leq_one_active_nodes:\n        current.profile.degree_leq_one_active_nodes -\n        baseline.profile.degree_leq_one_active_nodes,\n      edges_by_kind: diffCountRecords(\n        baseline.profile.edges_by_kind,\n        current.profile.edges_by_kind,\n      ),\n      coverage_by_type: coverageByType,\n    },\n  };\n}\n"],"names":[],"mappings":";;AAeA,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AA+FxB,mEAAmE;AACnE,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,0DAA0D;AAC1D,MAAM,aAAa,GAA8C;IAC/D,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,IAAI,EAAE,CAAC;CACR,CAAC;AAwCF,kFAAkF;AAClF,SAAS,YAAY,CACnB,IAAkC,EAClC,QAAmC,EACnC,MAAc,EACd,QAAmC,EACnC,QAA2B,EAC3B,aAAqB,EACrB,WAAmB;IAEnB,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9E,OAAO;QACL,IAAI;QACJ,QAAQ;QACR,MAAM;QACN,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,EAAE,MAAM,CAAC,MAAM;QACpB,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC;QACtC,gBAAgB,EAAE,MAAM,CAAC,MAAM,GAAG,aAAa;QAC/C,WAAW;KACZ,CAAC;AACJ,CAAC;AACD,wEAAwE;AACxE,SAAS,sBAAsB,CAC7B,QAAuC;IAEvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,UAAU,CAAC,QAAQ;YAAE,SAAS;QACnC,2EAA2E;QAC3E,qEAAqE;QACrE,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,GAC5B,CAAC,UAAU,CAAC,UAAU,IAAI,sBAAsB,CAAC;YACjD,sBAAsB;YACpB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAC5B,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC7C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;YAClC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,MAAM,EAAE;QACxC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,iDAAiD;AACjD,SAAS,kBAAkB,CAAC,IAAY,EAAE,KAAkB;IAC1D,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAC1C,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IACrB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,SAAS,uBAAuB,CAC9B,KAAkB,EAClB,MAAqB,EACrB,UAAiC,EACjC,KAAkB;IAElB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACnD,IAAI,KAAK,CAAC,aAAa,IAAI,SAAS,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1D,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,aAAa,CAAE,CAAC;IACjD,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,kBAAkB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAChB,KAAK,CAAC,IAAI,EACV,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CACxE,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0EAA0E;AAC1E,SAAS,mBAAmB,CAC1B,KAAkB,EAClB,MAAqB,EACrB,UAAiC,EACjC,KAAkB;IAElB,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,MAAM;QACR,KAAK,CAAC,QAAQ,CAAC,GAAG,CAChB,MAAM,CAAC,IAAI,EACX,IAAI,CAAC,GAAG,CACN,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,EAChC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAChC,CACF,CAAC;IACJ,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO;IAC7E,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;QAClC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,IAAI,MAAM,KAAK,KAAK,CAAC,IAAI;YAAE,MAAM;IACnC,CAAC;IACD,IACE,SAAS,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YACrB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;QAEzD,KAAK,CAAC,UAAU,CAAC,IAAI,CACnB,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAC3D,CAAC;AACN,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAiC;IAEjC,MAAM,KAAK,GAAgB;QACzB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,KAAK,EAAE,EAAE;QACT,UAAU,EAAE,EAAE;QACd,SAAS,EAAE,CAAC;KACb,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACxD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAC1B,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACtC,2EAA2E;QAC3E,MAAM,MAAM,GAAkB,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAC7B,IAAI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC;gBAAE,SAAS;YACxE,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC3C,IAAI,CAAC,CAAC,CAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAClC,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,SAAS,uBAAuB,CAAC,SAIhC;IACC,OAAO,GAAG,SAAS,CAAC,SAAS,OAAO,SAAS,CAAC,SAAS,KAAK,SAAS,CAAC,IAAI,GAAG,CAAC;AAChF,CAAC;AAED,wEAAwE;AACxE,SAAS,aAAa,CACpB,QAAoC,EACpC,QAA2B,EAC3B,aAAqB,EACrB,IAAkC,EAClC,QAAmC,EACnC,MAAc,EACd,QAAmC,EACnC,WAAmB;IAEnB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAClC,QAAQ,CAAC,IAAI,CACX,YAAY,CACV,IAAI,EACJ,QAAQ,EACR,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,WAAW,CACZ,CACF,CAAC;AACJ,CAAC;AAED,2EAA2E;AAC3E,SAAS,wBAAwB,CAC/B,QAAuC,EACvC,UAAuC,EACvC,aAAqB;IAErB,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,MAAM,UAAU,GAAG;QACjB,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM;QAC3B,GAAG,QAAQ,CAAC,QAAQ,CAAC,eAAe;KACrC,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,0BAA0B,CAAC,CAAC;IAC/D,aAAa,CACX,QAAQ,EACR,UAAU;SACP,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;SAC3D,GAAG,CAAC,uBAAuB,CAAC,EAC/B,aAAa,EACb,0BAA0B,EAC1B,OAAO,EACP,2FAA2F,EAC3F,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,+CAA+C,EAClE,yFAAyF,CAC1F,CAAC;IACF,aAAa,CACX,QAAQ,EACR,UAAU;SACP,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;SAC1D,GAAG,CAAC,uBAAuB,CAAC,EAC/B,aAAa,EACb,4BAA4B,EAC5B,MAAM,EACN,mGAAmG,EACnG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,iDAAiD,EACpE,oFAAoF,CACrF,CAAC;IACF,aAAa,CACX,QAAQ,EACR,QAAQ,CAAC,QAAQ,CAAC,2BAA2B,CAAC,GAAG,CAAC,uBAAuB,CAAC,EAC1E,aAAa,EACb,4BAA4B,EAC5B,MAAM,EACN,sGAAsG,EACtG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,iDAAiD,EACpE,gFAAgF,CACjF,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+EAA+E;AAC/E,SAAS,mBAAmB,CAC1B,MAAc,EACd,UAAuC;IAEvC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,uEAAuE;IACvE,yEAAyE;IACzE,8CAA8C;IAC9C,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;AACzB,CAAC;AAED,sEAAsE;AACtE,SAAS,uBAAuB,CAC9B,QAAuC,EACvC,UAAuC,EACvC,SAAsC,EACtC,aAAqB;IAErB,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,qBAAqB,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC7D,wEAAwE;QACxE,yEAAyE;QACzE,yEAAyE;QACzE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CACnC,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CACxC,CAAC;QACF,QAAQ,CAAC,IAAI,CACX,MAAM;YACJ,CAAC,CAAC,YAAY,CACV,gBAAgB,EAChB,OAAO,EACP,+FAA+F,EAC/F,CAAC,KAAK,EAAE,EAAE,CAAC,gCAAgC,KAAK,UAAU,EAC1D,KAAK,EACL,aAAa,EACb,iGAAiG,CAClG;YACH,CAAC,CAAC,YAAY,CACV,uBAAuB,EACvB,MAAM,EACN,6GAA6G,EAC7G,CAAC,KAAK,EAAE,EAAE,CACR,8CAA8C,KAAK,UAAU,EAC/D,KAAK,EACL,aAAa,EACb,uHAAuH,CACxH,CACN,CAAC;IACJ,CAAC;IACD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvD,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,iBAAiB;QACrD,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,YAAY;gBAAE,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;gBAC5C,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,MAAM,oBAAoB,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;SAClD,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,CAAC,KAAK,CAAC,OAAO;QACd,CAAC,KAAK,CAAC,QAAQ;QACf,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC;QACvB,CAAC,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE;YAC7D,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACrD,qEAAqE;YACrE,8DAA8D;YAC9D,+CAA+C;YAC/C,OAAO,gBAAgB,KAAK,SAAS,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC;QACtE,CAAC,CAAC,CACL;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5B,aAAa,CACX,QAAQ,EACR,oBAAoB,EACpB,aAAa,EACb,uBAAuB,EACvB,SAAS,EACT,sFAAsF,EACtF,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,mDAAmD,EACtE,yFAAyF,CAC1F,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAYD,kFAAkF;AAClF,MAAM,UAAU,wBAAwB,CACtC,KAAqC;IAErC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK;SACtB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;SACxB,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,GAAG,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;AAC/D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,sCAAsC,CACpD,QAAuC;IAEvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0C,CAAC;IACjE,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC;YAAE,SAAS;QAC5C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE;YAAE,SAAS;QAC5C,MAAM,GAAG,GAAG,GAAG,mBAAmB,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC;QACnF,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,UAAU,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC5C,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CACnC,CAAC;IACF,yEAAyE;IACzE,wEAAwE;IACxE,4EAA4E;IAC5E,KAAK,MAAM,KAAK,IAAI,UAAU;QAC5B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CACzE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,4BAA4B,CACnC,QAAuC,EACvC,UAAuC,EACvC,aAAqB;IAErB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,sCAAsC,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrE,MAAM,QAAQ,GACZ,mBAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC;YAC3C,mBAAmB,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC;YACvC,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,MAAM,CAAC;QACb,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,gBAAgB,EAChB,MAAM,EACN,iKAAiK,EACjK,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,sDAAsD,EACzE,iHAAiH,CAClH,CAAC;IACF,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,uBAAuB,EACvB,MAAM,EACN,yGAAyG,EACzG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,wDAAwD,EAC3E,oFAAoF,CACrF,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,2BAA2B,CAClC,QAAuC,EACvC,aAAqB;IAErB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,8FAA8F;IAC9F,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,aAAa,IAAI,EAAE,EAAE,CAAC;QAC/C,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAC1C,GAAG,GAAG,CAAC,SAAS,OAAO,GAAG,CAAC,SAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,WAAW,GAAG,CACzE,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,0BAA0B,EAC1B,SAAS,EACT,yIAAyI,EACzI,CAAC,KAAK,EAAE,EAAE,CACR,GAAG,KAAK,kEAAkE,EAC5E,mGAAmG,CACpG,CAAC;IACF,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,iCAAiC,EACjC,MAAM,EACN,gHAAgH,EAChH,CAAC,KAAK,EAAE,EAAE,CACR,GAAG,KAAK,oEAAoE,EAC9E,oFAAoF,CACrF,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAqBD,sFAAsF;AACtF,SAAS,uBAAuB,CAC9B,OAAwB,EACxB,KAAqB,EACrB,MAAc,EACd,cAA2B,EAC3B,kBAA+B;IAE/B,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IACpB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,IAAI,WAAW,CAAC;IAC1C,IAAI,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9C,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,WAAW,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;QAC5D,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAC3C,CAAC;IACD,WAAW,CAAC,MAAM,IAAI,CAAC,CAAC;IACxB,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO;IACvB,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;IAC1B,WAAW,CAAC,cAAc,IAAI,CAAC,CAAC;IAChC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;QACtB,WAAW,CAAC,QAAQ,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,IACE,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAC1C,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;QAE7C,OAAO;IACT,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;QAC7C,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,qBAAqB,CAC5B,QAAuC,EACvC,UAAuC,EACvC,cAA2B,EAC3B,kBAA+B,EAC/B,aAAqB,EACrB,WAAmC;IAEnC,MAAM,OAAO,GAAoB;QAC/B,MAAM,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,CAAC;QACX,YAAY,EAAE,CAAC;QACf,QAAQ,EAAE,EAAE;QACZ,MAAM,EAAE,EAAE;QACV,MAAM,EAAE,IAAI,GAAG,EAAE;KAClB,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,yFAAyF;QACzF,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,QAAQ;YAAE,SAAS;QAC7B,uBAAuB,CACrB,OAAO,EACP,KAAK,EACL,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,EACvC,cAAc,EACd,kBAAkB,CACnB,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IACrC,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAChD,aAAa,CACX,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,sBAAsB,EACtB,SAAS,EACT,4FAA4F,EAC5F,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,uCAAuC,EAC1D,6FAA6F,CAC9F,CAAC;IACF,aAAa,CACX,QAAQ,EACR,MAAM,EACN,aAAa,EACb,oBAAoB,EACpB,MAAM,EACN,+GAA+G,EAC/G,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,+CAA+C,EAClE,kHAAkH,CACnH,CAAC;IACF,OAAO;QACL,QAAQ;QACR,OAAO,EAAE;YACP,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;YACpC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;YACpC,aAAa,EAAE,MAAM,CAAC,WAAW,CAC/B,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CACnD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAC1B,CACF;YACD,YAAY,EAAE,OAAO,CAAC,MAAM;YAC5B,aAAa,EAAE,OAAO,CAAC,OAAO;YAC9B,qBAAqB,EAAE,OAAO,CAAC,QAAQ;YACvC,2BAA2B,EAAE,OAAO,CAAC,YAAY;YACjD,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAClC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CACrD,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtB,CACF;SACF;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,+BAA+B,CAC7C,QAAuC,EACvC,UAAoC,EAAE;IAEtC,MAAM,UAAU,GACd,OAAO,CAAC,UAAU;QAClB,CAAC,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,UAAU,CAAC,CAAC;IACrE,MAAM,SAAS,GACb,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,MAAc,EAAE,EAAE,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAClE,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,uBAAuB,CAAC;IACvE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,aAAa,GAAG,CAAC;QACvD,MAAM,IAAI,SAAS,CACjB,+BAA+B,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAC/D,CAAC;IACJ,MAAM,cAAc,GAAG,IAAI,GAAG,CAC5B,CAAC,OAAO,CAAC,cAAc,IAAI,EAAE,CAAC;SAC3B,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC;SACpD,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CACxC,CAAC;IACF,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAChC,CAAC,OAAO,CAAC,kBAAkB,IAAI,EAAE,CAAC;SAC/B,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC;SAC1D,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAC5C,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,EAAE;QACT;YACE,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,OAAO,EAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;YAC3D,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;YACnC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;SAC5D;KACF,CAAC,CACH,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IAEjC,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE;QACvC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,wBAAwB,CACvC,QAAQ,EACR,UAAU,EACV,aAAa,CACd,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CACX,GAAG,uBAAuB,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,CAC3E,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CACX,GAAG,4BAA4B,CAAC,QAAQ,EAAE,UAAU,EAAE,aAAa,CAAC,EACpE,GAAG,2BAA2B,CAAC,QAAQ,EAAE,aAAa,CAAC,CACxD,CAAC;IACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAG,qBAAqB,CACpC,QAAQ,EACR,UAAU,EACV,cAAc,EACd,kBAAkB,EAClB,aAAa,EACb,WAAW,CACZ,CAAC;IACF,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAEpC,QAAQ,CAAC,IAAI,CACX,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC5D,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAClD,CAAC;IACF,OAAO;QACL,QAAQ;QACR,OAAO,EAAE,QAAQ,CAAC,OAAO;KAC1B,CAAC;AACJ,CAAC;AA2CD,2FAA2F;AAC3F,SAAS,gBAAgB,CACvB,QAAgC,EAChC,OAA+B;IAE/B,MAAM,IAAI,GAAG;QACX,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;KAChE,CAAC,IAAI,EAAE,CAAC;IACT,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACzD,IAAI,KAAK,KAAK,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,mFAAmF;AACnF,SAAS,0BAA0B,CACjC,QAAmC;IAEnC,OAAO,QAAQ,CAAC,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,8BAA8B,CAC5C,QAAmC,EACnC,OAAkC;IAElC,MAAM,cAAc,GAAoD,EAAE,CAAC;IAC3E,0EAA0E;IAC1E,0EAA0E;IAC1E,2BAA2B;IAC3B,MAAM,sBAAsB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;IACpE,MAAM,qBAAqB,GAAG,0BAA0B,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAG;QACf,GAAG,IAAI,GAAG,CAAC;YACT,GAAG,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC;YACtC,GAAG,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC;SACtC,CAAC;KACH,CAAC,IAAI,EAAE,CAAC;IACT,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG;YACZ,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;YACpD,QAAQ,EAAE,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,CAAC;YAC1D,cAAc,EACZ,CAAC,KAAK,EAAE,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,cAAc,IAAI,CAAC,CAAC;SAC/D,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;YACnD,cAAc,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IACD,OAAO;QACL,iBAAiB,EAAE,QAAQ,CAAC,QAAQ;QACpC,aAAa,EAAE,QAAQ,CAAC,WAAW,KAAK,OAAO,CAAC,WAAW;QAC3D,yBAAyB,EAAE,gBAAgB,CACzC,QAAQ,CAAC,yBAAyB,EAClC,OAAO,CAAC,yBAAyB,CAClC;QACD,OAAO,EAAE;YACP,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK;YACrD,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK;YACrD,YAAY,EACV,OAAO,CAAC,OAAO,CAAC,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,YAAY;YAC9D,aAAa,EACX,OAAO,CAAC,OAAO,CAAC,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,aAAa;YAChE,qBAAqB,EACnB,OAAO,CAAC,OAAO,CAAC,qBAAqB;gBACrC,QAAQ,CAAC,OAAO,CAAC,qBAAqB;YACxC,2BAA2B,EACzB,OAAO,CAAC,OAAO,CAAC,2BAA2B;gBAC3C,QAAQ,CAAC,OAAO,CAAC,2BAA2B;YAC9C,aAAa,EAAE,gBAAgB,CAC7B,QAAQ,CAAC,OAAO,CAAC,aAAa,EAC9B,OAAO,CAAC,OAAO,CAAC,aAAa,CAC9B;YACD,gBAAgB,EAAE,cAAc;SACjC;KACF,CAAC;AACJ,CAAC","debugId":"4b36a9d4-2621-5560-831f-7fd026072cf1"}

package/dist/sdk/graph/index.d.ts

@@ -7,11 +7,14 @@
  * relationship audit. Everything here layers on the dependency-free kernel in
  * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.
  */
-export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, type GraphCommunityOptions, type GraphDominatorOptions, type GraphRedundancyOptions, type RedundantRelationshipEdge, type RelationshipCommunity, type RelationshipCommunityAnalysis, type RelationshipDominatorAnalysis, type RelationshipDominatorRow, } from "./analytics.js";
-export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectMissingDependencyTargetIds, type DanglingDependencyReference, type DanglingDependencyReferenceSummary, type DependencyReferenceHolder, type DependencyReferenceSource, type WorkspaceRelationshipAssembly, type WorkspaceRelationshipItem, type WorkspaceRelationshipNodeDetails, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, formatDuplicateEdgeGroup, type DuplicateRelationshipEdgeGroup, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipCoverageProfile, } from "./governance.js";
+export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, forEachMatchedRelationshipEdge, type GraphCommunityOptions, type GraphDominatorOptions, type GraphRedundancyOptions, type RedundantRelationshipEdge, type RelationshipCommunity, type RelationshipCommunityAnalysis, type RelationshipDominatorAnalysis, type RelationshipDominatorRow, } from "./analytics.js";
+export { computeRelationshipCentrality, findRelationshipCutStructure, type GraphCentralityOptions, type GraphCutStructureOptions, type RelationshipBridge, type RelationshipCentralityAnalysis, type RelationshipCentralityRow, type RelationshipCutStructure, } from "./centrality.js";
+export { analyzeRelationshipSchedule, type GraphScheduleOptions, type RelationshipScheduleAnalysis, type RelationshipScheduleRow, } from "./scheduling.js";
+export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, type DanglingDependencyReference, type DanglingDependencyReferenceSummary, type DependencyReferenceHolder, type DependencyReferenceSource, type DuplicateDependencyRow, type WorkspaceRelationshipAssembly, type WorkspaceRelationshipItem, type WorkspaceRelationshipNodeDetails, } from "./assembly.js";
+export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, type DuplicateRelationshipEdgeGroup, type RelationshipAuditDelta, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipAuditSnapshot, type RelationshipCoverageProfile, type RelationshipCoverageTypeProfile, } from "./governance.js";
+export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, type DurableGraphCacheEnvelope, type DurableGraphCacheStatus, type DurableGraphCacheView, } from "./durable-cache.js";
 export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, type GraphPathOptions, type GraphTraversalOptions, type RelationshipPath, } from "./traversal.js";
 export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, type GraphCacheMetadata, type WorkspaceGraphCacheLookup, } from "./cache.js";
 export { planRelationshipRemediation, type RelationshipRemediationCode, type RelationshipRemediationConfidence, type RelationshipRemediationOperation, type RelationshipRemediationPlan, type RelationshipRemediationPlanOptions, type RelationshipRemediationStep, } from "./remediation.js";
 export { collectNewOrderingCycleWarnings } from "./mutation-advisory.js";
-export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, type GraphAnalyzeResult, type GraphAuditResult, type GraphCommandOptions, type GraphCommunitiesResult, type GraphCommunityRow, type GraphDominatorRow, type GraphDominatorsResult, type GraphExecutionSummary, type GraphImpactResult, type GraphImpactRow, type GraphKnowledgeSummary, type GraphPathRow, type GraphPathsResult, type GraphPlanResult, type GraphQueryCost, type GraphRedundancyResult, type GraphRedundancyRow, type GraphResult, type GraphSubcommand, type GraphTraversalResult, } from "./run.js";
+export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, type GraphAnalyzeResult, type GraphArticulationResult, type GraphAuditResult, type GraphBridgeRow, type GraphCentralityResult, type GraphCentralityRow, type GraphCommandOptions, type GraphCommunitiesResult, type GraphCommunityRow, type GraphDominatorRow, type GraphDominatorsResult, type GraphExecutionSummary, type GraphImpactResult, type GraphImpactRow, type GraphIndexResult, type GraphKnowledgeSummary, type GraphPathRow, type GraphPathsResult, type GraphPlanResult, type GraphQueryCost, type GraphRedundancyResult, type GraphRedundancyRow, type GraphResult, type GraphScheduleRow, type GraphSlackResult, type GraphSubcommand, type GraphTraversalResult, } from "./run.js";

package/dist/sdk/graph/index.js

@@ -8,14 +8,17 @@
  * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.
  */
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="d123a5fc-d172-5644-8cce-abf975f187d8")}catch(e){}}();
-export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, } from "./analytics.js";
-export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectMissingDependencyTargetIds, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, formatDuplicateEdgeGroup, } from "./governance.js";
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="94a76dca-4199-582e-882e-9525a42319db")}catch(e){}}();
+export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, forEachMatchedRelationshipEdge, } from "./analytics.js";
+export { computeRelationshipCentrality, findRelationshipCutStructure, } from "./centrality.js";
+export { analyzeRelationshipSchedule, } from "./scheduling.js";
+export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
+export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, } from "./governance.js";
+export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, } from "./durable-cache.js";
 export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, } from "./traversal.js";
 export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, } from "./cache.js";
 export { planRelationshipRemediation, } from "./remediation.js";
 export { collectNewOrderingCycleWarnings } from "./mutation-advisory.js";
 export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, } from "./run.js";
 //# sourceMappingURL=index.js.map
-//# debugId=d123a5fc-d172-5644-8cce-abf975f187d8
+//# debugId=94a76dca-4199-582e-882e-9525a42319db

package/dist/sdk/graph/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["sdk/graph/index.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph\n *\n * Public workspace graph toolkit: one-pass relationship assembly with\n * missing-reference governance, registry-semantics traversal (hierarchy,\n * execution order, bounded path enumeration), and the policy-aware\n * relationship audit. Everything here layers on the dependency-free kernel in\n * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.\n */\nexport {\n  computeRelationshipDominators,\n  detectRelationshipCommunities,\n  findRedundantRelationshipEdges,\n  type GraphCommunityOptions,\n  type GraphDominatorOptions,\n  type GraphRedundancyOptions,\n  type RedundantRelationshipEdge,\n  type RelationshipCommunity,\n  type RelationshipCommunityAnalysis,\n  type RelationshipDominatorAnalysis,\n  type RelationshipDominatorRow,\n} from \"./analytics.js\";\nexport {\n  assembleWorkspaceRelationshipGraph,\n  collectDanglingDependencyReferences,\n  collectMissingDependencyTargetIds,\n  type DanglingDependencyReference,\n  type DanglingDependencyReferenceSummary,\n  type DependencyReferenceHolder,\n  type DependencyReferenceSource,\n  type WorkspaceRelationshipAssembly,\n  type WorkspaceRelationshipItem,\n  type WorkspaceRelationshipNodeDetails,\n} from \"./assembly.js\";\nexport {\n  auditWorkspaceRelationshipGraph,\n  collectDuplicateRelationshipEdgeGroups,\n  formatDuplicateEdgeGroup,\n  type DuplicateRelationshipEdgeGroup,\n  type RelationshipAuditFinding,\n  type RelationshipAuditFindingCode,\n  type RelationshipAuditOptions,\n  type RelationshipAuditReport,\n  type RelationshipAuditSeverity,\n  type RelationshipCoverageProfile,\n} from \"./governance.js\";\nexport {\n  enumerateRelationshipPaths,\n  hierarchyAncestors,\n  hierarchyDescendants,\n  orderingPredecessors,\n  orderingSuccessors,\n  type GraphPathOptions,\n  type GraphTraversalOptions,\n  type RelationshipPath,\n} from \"./traversal.js\";\nexport {\n  computeWorkspaceGraphFingerprint,\n  resetWorkspaceGraphCache,\n  workspaceGraphCache,\n  WorkspaceGraphCache,\n  type GraphCacheMetadata,\n  type WorkspaceGraphCacheLookup,\n} from \"./cache.js\";\nexport {\n  planRelationshipRemediation,\n  type RelationshipRemediationCode,\n  type RelationshipRemediationConfidence,\n  type RelationshipRemediationOperation,\n  type RelationshipRemediationPlan,\n  type RelationshipRemediationPlanOptions,\n  type RelationshipRemediationStep,\n} from \"./remediation.js\";\nexport { collectNewOrderingCycleWarnings } from \"./mutation-advisory.js\";\nexport {\n  GRAPH_SUBCOMMAND_VALUES,\n  parseGraphSubcommand,\n  runGraph,\n  type GraphAnalyzeResult,\n  type GraphAuditResult,\n  type GraphCommandOptions,\n  type GraphCommunitiesResult,\n  type GraphCommunityRow,\n  type GraphDominatorRow,\n  type GraphDominatorsResult,\n  type GraphExecutionSummary,\n  type GraphImpactResult,\n  type GraphImpactRow,\n  type GraphKnowledgeSummary,\n  type GraphPathRow,\n  type GraphPathsResult,\n  type GraphPlanResult,\n  type GraphQueryCost,\n  type GraphRedundancyResult,\n  type GraphRedundancyRow,\n  type GraphResult,\n  type GraphSubcommand,\n  type GraphTraversalResult,\n} from \"./run.js\";\n"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;;;AACH,OAAO,EACL,6BAA6B,EAC7B,6BAA6B,EAC7B,8BAA8B,GAS/B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,kCAAkC,EAClC,mCAAmC,EACnC,iCAAiC,GAQlC,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,+BAA+B,EAC/B,sCAAsC,EACtC,wBAAwB,GAQzB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,0BAA0B,EAC1B,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,EACpB,kBAAkB,GAInB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,gCAAgC,EAChC,wBAAwB,EACxB,mBAAmB,EACnB,mBAAmB,GAGpB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,2BAA2B,GAO5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,+BAA+B,EAAE,MAAM,wBAAwB,CAAC;AACzE,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,QAAQ,GAqBT,MAAM,UAAU,CAAC","debugId":"d123a5fc-d172-5644-8cce-abf975f187d8"}
+{"version":3,"file":"index.js","sources":["sdk/graph/index.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph\n *\n * Public workspace graph toolkit: one-pass relationship assembly with\n * missing-reference governance, registry-semantics traversal (hierarchy,\n * execution order, bounded path enumeration), and the policy-aware\n * relationship audit. Everything here layers on the dependency-free kernel in\n * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.\n */\nexport {\n  computeRelationshipDominators,\n  detectRelationshipCommunities,\n  findRedundantRelationshipEdges,\n  forEachMatchedRelationshipEdge,\n  type GraphCommunityOptions,\n  type GraphDominatorOptions,\n  type GraphRedundancyOptions,\n  type RedundantRelationshipEdge,\n  type RelationshipCommunity,\n  type RelationshipCommunityAnalysis,\n  type RelationshipDominatorAnalysis,\n  type RelationshipDominatorRow,\n} from \"./analytics.js\";\nexport {\n  computeRelationshipCentrality,\n  findRelationshipCutStructure,\n  type GraphCentralityOptions,\n  type GraphCutStructureOptions,\n  type RelationshipBridge,\n  type RelationshipCentralityAnalysis,\n  type RelationshipCentralityRow,\n  type RelationshipCutStructure,\n} from \"./centrality.js\";\nexport {\n  analyzeRelationshipSchedule,\n  type GraphScheduleOptions,\n  type RelationshipScheduleAnalysis,\n  type RelationshipScheduleRow,\n} from \"./scheduling.js\";\nexport {\n  assembleWorkspaceRelationshipGraph,\n  collectDanglingDependencyReferences,\n  collectDuplicateDependencyRows,\n  collectMissingDependencyTargetIds,\n  normalizeDependencyGraphTarget,\n  resolveWorkspaceRelationshipKindRegistry,\n  type DanglingDependencyReference,\n  type DanglingDependencyReferenceSummary,\n  type DependencyReferenceHolder,\n  type DependencyReferenceSource,\n  type DuplicateDependencyRow,\n  type WorkspaceRelationshipAssembly,\n  type WorkspaceRelationshipItem,\n  type WorkspaceRelationshipNodeDetails,\n} from \"./assembly.js\";\nexport {\n  auditWorkspaceRelationshipGraph,\n  collectDuplicateRelationshipEdgeGroups,\n  collectOrderingCycles,\n  diffRelationshipAuditSnapshots,\n  formatDuplicateEdgeGroup,\n  type DuplicateRelationshipEdgeGroup,\n  type RelationshipAuditDelta,\n  type RelationshipAuditFinding,\n  type RelationshipAuditFindingCode,\n  type RelationshipAuditOptions,\n  type RelationshipAuditReport,\n  type RelationshipAuditSeverity,\n  type RelationshipAuditSnapshot,\n  type RelationshipCoverageProfile,\n  type RelationshipCoverageTypeProfile,\n} from \"./governance.js\";\nexport {\n  clearDurableGraphCache,\n  durableGraphCachePath,\n  durableGraphCacheStatus,\n  GRAPH_DURABLE_CACHE_MIN_ITEMS,\n  GRAPH_DURABLE_CACHE_VERSION,\n  graphAuditBaselinePath,\n  loadGraphAuditBaseline,\n  openDurableGraphCache,\n  persistDurableGraphResult,\n  saveGraphAuditBaseline,\n  shouldPersistDurableGraphCache,\n  type DurableGraphCacheEnvelope,\n  type DurableGraphCacheStatus,\n  type DurableGraphCacheView,\n} from \"./durable-cache.js\";\nexport {\n  enumerateRelationshipPaths,\n  hierarchyAncestors,\n  hierarchyDescendants,\n  orderingPredecessors,\n  orderingSuccessors,\n  type GraphPathOptions,\n  type GraphTraversalOptions,\n  type RelationshipPath,\n} from \"./traversal.js\";\nexport {\n  computeWorkspaceGraphFingerprint,\n  resetWorkspaceGraphCache,\n  workspaceGraphCache,\n  WorkspaceGraphCache,\n  type GraphCacheMetadata,\n  type WorkspaceGraphCacheLookup,\n} from \"./cache.js\";\nexport {\n  planRelationshipRemediation,\n  type RelationshipRemediationCode,\n  type RelationshipRemediationConfidence,\n  type RelationshipRemediationOperation,\n  type RelationshipRemediationPlan,\n  type RelationshipRemediationPlanOptions,\n  type RelationshipRemediationStep,\n} from \"./remediation.js\";\nexport { collectNewOrderingCycleWarnings } from \"./mutation-advisory.js\";\nexport {\n  GRAPH_SUBCOMMAND_VALUES,\n  parseGraphSubcommand,\n  runGraph,\n  type GraphAnalyzeResult,\n  type GraphArticulationResult,\n  type GraphAuditResult,\n  type GraphBridgeRow,\n  type GraphCentralityResult,\n  type GraphCentralityRow,\n  type GraphCommandOptions,\n  type GraphCommunitiesResult,\n  type GraphCommunityRow,\n  type GraphDominatorRow,\n  type GraphDominatorsResult,\n  type GraphExecutionSummary,\n  type GraphImpactResult,\n  type GraphImpactRow,\n  type GraphIndexResult,\n  type GraphKnowledgeSummary,\n  type GraphPathRow,\n  type GraphPathsResult,\n  type GraphPlanResult,\n  type GraphQueryCost,\n  type GraphRedundancyResult,\n  type GraphRedundancyRow,\n  type GraphResult,\n  type GraphScheduleRow,\n  type GraphSlackResult,\n  type GraphSubcommand,\n  type GraphTraversalResult,\n} from \"./run.js\";\n"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;;;AACH,OAAO,EACL,6BAA6B,EAC7B,6BAA6B,EAC7B,8BAA8B,EAC9B,8BAA8B,GAS/B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,6BAA6B,EAC7B,4BAA4B,GAO7B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,2BAA2B,GAI5B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,kCAAkC,EAClC,mCAAmC,EACnC,8BAA8B,EAC9B,iCAAiC,EACjC,8BAA8B,EAC9B,wCAAwC,GASzC,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,+BAA+B,EAC/B,sCAAsC,EACtC,qBAAqB,EACrB,8BAA8B,EAC9B,wBAAwB,GAWzB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,sBAAsB,EACtB,qBAAqB,EACrB,uBAAuB,EACvB,6BAA6B,EAC7B,2BAA2B,EAC3B,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,yBAAyB,EACzB,sBAAsB,EACtB,8BAA8B,GAI/B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,0BAA0B,EAC1B,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,EACpB,kBAAkB,GAInB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,gCAAgC,EAChC,wBAAwB,EACxB,mBAAmB,EACnB,mBAAmB,GAGpB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,2BAA2B,GAO5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,+BAA+B,EAAE,MAAM,wBAAwB,CAAC;AACzE,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,QAAQ,GA4BT,MAAM,UAAU,CAAC","debugId":"94a76dca-4199-582e-882e-9525a42319db"}

package/dist/sdk/graph/mutation-advisory.d.ts

@@ -3,17 +3,48 @@
  *
  * Detects newly introduced execution-order cycles across immutable workspace
  * snapshots so mutation clients can warn without rejecting legacy graph debt.
+ * Detection is incremental: instead of assembling the full workspace
+ * relationship graph and running whole-graph cycle analysis twice per
+ * mutation, both snapshots build only a lightweight ordering digraph and scope
+ * cycle enumeration to the changed item's weakly connected ordering component
+ * — a cycle containing the changed item can never span nodes outside it.
  */
 import type { ItemMetadata } from "../../types/index.js";
-import type { RelationshipGraph } from "../relationships.js";
-declare function buildOrderingAdjacency(graph: RelationshipGraph): Map<string, string[]>;
-declare function findCyclePath(graph: RelationshipGraph, component: readonly string[], changedItemId: string): string[];
+import type { RelationshipKindRegistry } from "../relationships.js";
+/** Lightweight ordering digraph over one immutable item snapshot. */
+interface OrderingDigraph {
+    /** Sorted successor adjacency oriented predecessor -> successor. */
+    successors: Map<string, string[]>;
+    /** Sorted predecessor adjacency, the reverse orientation of successors. */
+    predecessors: Map<string, string[]>;
+    /** Canonical original-case ids keyed by their lowercase spelling. */
+    canonicalIds: Map<string, string>;
+}
+/**
+ * Build the ordering-only digraph for one item snapshot without assembling a
+ * full relationship graph: one linear pass over the legacy scalar blocker and
+ * structured dependency rows of every item.
+ */
+declare function buildOrderingDigraph(items: readonly ItemMetadata[], registry: RelationshipKindRegistry): OrderingDigraph;
+/**
+ * Collect the changed item's weakly connected ordering component: every node
+ * reachable through ordering edges in either orientation. Cycle enumeration
+ * restricted to this member set is exact for cycles containing the changed
+ * item, because a strongly connected component is always contained in a
+ * weakly connected one.
+ */
+declare function collectWeakComponent(digraph: OrderingDigraph, start: string): Set<string>;
+/** Restrict a successor adjacency to edges whose endpoints are both members. */
+declare function induceSuccessors(digraph: OrderingDigraph, members: ReadonlySet<string>): Map<string, string[]>;
+declare function findCyclePath(adjacency: ReadonlyMap<string, readonly string[]>, component: readonly string[], changedItemId: string): string[];
 declare function findPathBackToStart(adjacency: ReadonlyMap<string, readonly string[]>, members: ReadonlySet<string>, start: string, first: string): string[] | undefined;
 /** Return actionable warnings only for ordering cycles created by the later snapshot and containing the changed item. */
 export declare function collectNewOrderingCycleWarnings(beforeItems: readonly ItemMetadata[], afterItems: readonly ItemMetadata[], changedItemId: string): string[];
 /** White-box graph-path helpers for exhaustive SDK primitive verification. */
 export declare const mutationAdvisoryTestOnly: {
-    buildOrderingAdjacency: typeof buildOrderingAdjacency;
+    buildOrderingDigraph: typeof buildOrderingDigraph;
+    collectWeakComponent: typeof collectWeakComponent;
+    induceSuccessors: typeof induceSuccessors;
     findCyclePath: typeof findCyclePath;
     findPathBackToStart: typeof findPathBackToStart;
 };

package/dist/sdk/graph/mutation-advisory.js

@@ -1,33 +1,124 @@
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="b116c910-3783-5ebc-8b6a-e9a64573107e")}catch(e){}}();
-import { analyzeRelationshipExecution } from "../relationship-analytics.js";
-import { assembleWorkspaceRelationshipGraph } from "./assembly.js";
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="9dcd2523-3a8a-5667-bd6b-d51c385be111")}catch(e){}}();
+import { normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
+import { collectOrderingCycles } from "./governance.js";
 function cycleKey(component) {
-    return [...component]
-        .sort((left, right) => left.localeCompare(right))
-        .join("\u0000");
+    return [...component].sort().join("\u0000");
 }
-function buildOrderingAdjacency(graph) {
-    const adjacency = new Map(graph.nodes().map((node) => [node, []]));
-    for (const edge of graph.edges()) {
-        const definition = graph.registry().require(edge.kind);
-        if (!definition.ordering)
-            continue;
-        const sourceFirst = (definition.precedence ?? "source_before_target") ===
-            "source_before_target";
-        adjacency
-            .get(sourceFirst ? edge.source : edge.target)
-            ?.push(sourceFirst ? edge.target : edge.source);
+/** Append one oriented ordering edge to both adjacency orientations. */
+function addOrderingEdge(digraph, predecessor, successor) {
+    const forward = digraph.successors.get(predecessor);
+    if (forward)
+        forward.push(successor);
+    else
+        digraph.successors.set(predecessor, [successor]);
+    const backward = digraph.predecessors.get(successor);
+    if (backward)
+        backward.push(predecessor);
+    else
+        digraph.predecessors.set(successor, [predecessor]);
+}
+/**
+ * Orient one candidate reference into the digraph when its kind is a
+ * registry-known order-bearing kind and its target resolves to a real item.
+ * Associative kinds, unknown kinds, retired sentinels, and references to
+ * absent items are skipped because none of them can create an
+ * execution-order cycle — a referenced-but-absent item has no stored
+ * out-edges.
+ */
+function orientOrderingEdge(digraph, registry, source, target, kind) {
+    const definition = registry.resolve(kind);
+    if (definition?.ordering !== true)
+        return;
+    const normalized = normalizeDependencyGraphTarget(target);
+    const canonicalTarget = normalized === undefined
+        ? undefined
+        : digraph.canonicalIds.get(normalized.toLowerCase());
+    if (canonicalTarget === undefined)
+        return;
+    const sourceFirst = (definition.precedence ?? "source_before_target") ===
+        "source_before_target";
+    addOrderingEdge(digraph, sourceFirst ? source : canonicalTarget, sourceFirst ? canonicalTarget : source);
+}
+/**
+ * Build the ordering-only digraph for one item snapshot without assembling a
+ * full relationship graph: one linear pass over the legacy scalar blocker and
+ * structured dependency rows of every item.
+ */
+function buildOrderingDigraph(items, registry) {
+    const digraph = {
+        successors: new Map(),
+        predecessors: new Map(),
+        canonicalIds: new Map(),
+    };
+    const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
+    for (const item of safeItems) {
+        const id = item.id.trim();
+        digraph.canonicalIds.set(id.toLowerCase(), id);
+    }
+    for (const item of safeItems) {
+        const id = item.id.trim();
+        orientOrderingEdge(digraph, registry, id, item.blocked_by, "blocked_by");
+        for (const dependency of item.dependencies ?? []) {
+            if (typeof dependency !== "object" || dependency === null)
+                continue;
+            orientOrderingEdge(digraph, registry, id, dependency.id, typeof dependency.kind === "string" ? dependency.kind : "related");
+        }
     }
-    for (const neighbors of adjacency.values()) {
-        neighbors.sort((left, right) => left.localeCompare(right));
+    for (const adjacency of [digraph.successors, digraph.predecessors])
+        for (const neighbors of adjacency.values())
+            neighbors.sort();
+    return digraph;
+}
+/**
+ * Collect the changed item's weakly connected ordering component: every node
+ * reachable through ordering edges in either orientation. Cycle enumeration
+ * restricted to this member set is exact for cycles containing the changed
+ * item, because a strongly connected component is always contained in a
+ * weakly connected one.
+ */
+function collectWeakComponent(digraph, start) {
+    const members = new Set([start]);
+    const queue = [start];
+    while (queue.length > 0) {
+        const node = queue.pop();
+        for (const adjacency of [digraph.successors, digraph.predecessors]) {
+            for (const neighbor of adjacency.get(node) ?? []) {
+                if (members.has(neighbor))
+                    continue;
+                members.add(neighbor);
+                queue.push(neighbor);
+            }
+        }
     }
-    return adjacency;
+    return members;
+}
+/** Restrict a successor adjacency to edges whose endpoints are both members. */
+function induceSuccessors(digraph, members) {
+    const induced = new Map();
+    for (const member of members) {
+        const neighbors = (digraph.successors.get(member) ?? []).filter((node) => members.has(node));
+        if (neighbors.length > 0)
+            induced.set(member, neighbors);
+    }
+    return induced;
+}
+/** Enumerate component-scoped ordering cycles around one canonical item id. */
+function collectScopedCycles(items, registry, changedItemId) {
+    const digraph = buildOrderingDigraph(items, registry);
+    const canonical = digraph.canonicalIds.get(changedItemId.trim().toLowerCase());
+    if (canonical === undefined)
+        return { cycles: [], successors: new Map(), canonical: changedItemId };
+    const successors = induceSuccessors(digraph, collectWeakComponent(digraph, canonical));
+    return {
+        cycles: collectOrderingCycles(successors).filter((component) => component.includes(canonical)),
+        successors,
+        canonical,
+    };
 }
-function findCyclePath(graph, component, changedItemId) {
+function findCyclePath(adjacency, component, changedItemId) {
     const members = new Set(component);
     const start = members.has(changedItemId) ? changedItemId : component[0];
-    const adjacency = buildOrderingAdjacency(graph);
     if (adjacency.get(start)?.includes(start))
         return [start, start];
     for (const first of adjacency.get(start) ?? []) {
@@ -58,23 +149,21 @@ function findPathBackToStart(adjacency, members, start, first) {
 }
 /** Return actionable warnings only for ordering cycles created by the later snapshot and containing the changed item. */
 export function collectNewOrderingCycleWarnings(beforeItems, afterItems, changedItemId) {
-    const beforeGraph = assembleWorkspaceRelationshipGraph(beforeItems).graph;
-    const afterGraph = assembleWorkspaceRelationshipGraph(afterItems).graph;
-    const beforeCycles = new Set(analyzeRelationshipExecution(beforeGraph, {
-        registry: beforeGraph.registry(),
-    }).cycles.map(cycleKey));
-    return analyzeRelationshipExecution(afterGraph, {
-        registry: afterGraph.registry(),
-    }).cycles
-        .filter((component) => component.includes(changedItemId) &&
-        !beforeCycles.has(cycleKey(component)))
-        .map((component) => `ordering_cycle_created:${findCyclePath(afterGraph, component, changedItemId).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`);
+    const registry = resolveWorkspaceRelationshipKindRegistry();
+    const before = collectScopedCycles(beforeItems, registry, changedItemId);
+    const after = collectScopedCycles(afterItems, registry, changedItemId);
+    const beforeCycles = new Set(before.cycles.map(cycleKey));
+    return after.cycles
+        .filter((component) => !beforeCycles.has(cycleKey(component)))
+        .map((component) => `ordering_cycle_created:${findCyclePath(after.successors, component, after.canonical).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`);
 }
 /** White-box graph-path helpers for exhaustive SDK primitive verification. */
 export const mutationAdvisoryTestOnly = {
-    buildOrderingAdjacency,
+    buildOrderingDigraph,
+    collectWeakComponent,
+    induceSuccessors,
     findCyclePath,
     findPathBackToStart,
 };
 //# sourceMappingURL=mutation-advisory.js.map
-//# debugId=b116c910-3783-5ebc-8b6a-e9a64573107e
+//# debugId=9dcd2523-3a8a-5667-bd6b-d51c385be111