@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/cli-bundle/chunks/chunk-6C2ZZX5Z.js

@@ -1,286 +0,0 @@
-
-!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]="5638f886-de83-5daf-8c42-386c898c57c0")}catch(e){}}();
-import {
-  createRelationshipKindRegistry
-} from "./chunk-HYW67VJ5.js";
-
-// dist/sdk/relationship-analytics.js
-function appendNeighbor(adjacency, source, target) {
-  adjacency.get(source).add(target);
-}
-function createAdjacency(nodes) {
-  return new Map(nodes.map((node) => [node, /* @__PURE__ */ new Set()]));
-}
-function sortComponents(components) {
-  for (const component of components)
-    component.sort();
-  return components.sort((left, right) => right.length - left.length || left[0].localeCompare(right[0]));
-}
-function stableJsonValue(value) {
-  if (Array.isArray(value))
-    return value.map((entry) => stableJsonValue(entry));
-  if (value === null || typeof value !== "object")
-    return value;
-  const toJSON = value.toJSON;
-  if (typeof toJSON === "function")
-    return stableJsonValue(toJSON.call(value));
-  return Object.fromEntries(Object.entries(value).sort(([left], [right]) => left.localeCompare(right)).map(([key, entry]) => [key, stableJsonValue(entry)]));
-}
-function relationshipEdgeKey(edge) {
-  return JSON.stringify(stableJsonValue(edge));
-}
-function appendFinishingOrder(start, adjacency, visited, order) {
-  const stack = [{ id: start, expanded: false }];
-  while (stack.length > 0) {
-    const current = stack.pop();
-    if (current.expanded) {
-      order.push(current.id);
-      continue;
-    }
-    if (visited.has(current.id))
-      continue;
-    visited.add(current.id);
-    stack.push({ id: current.id, expanded: true });
-    const neighbors = [...adjacency.get(current.id)].sort().reverse();
-    for (const neighbor of neighbors)
-      if (!visited.has(neighbor))
-        stack.push({ id: neighbor, expanded: false });
-  }
-}
-function computeFinishingOrder(nodes, adjacency) {
-  const visited = /* @__PURE__ */ new Set();
-  const order = [];
-  for (const start of nodes)
-    if (!visited.has(start))
-      appendFinishingOrder(start, adjacency, visited, order);
-  return order;
-}
-function collectReverseComponents(order, reverse) {
-  const visited = /* @__PURE__ */ new Set();
-  const components = [];
-  for (const start of [...order].reverse()) {
-    if (visited.has(start))
-      continue;
-    const component = [];
-    const stack = [start];
-    visited.add(start);
-    while (stack.length > 0) {
-      const current = stack.pop();
-      component.push(current);
-      for (const neighbor of reverse.get(current)) {
-        if (visited.has(neighbor))
-          continue;
-        visited.add(neighbor);
-        stack.push(neighbor);
-      }
-    }
-    components.push(component);
-  }
-  return sortComponents(components);
-}
-function stronglyConnectedComponents(nodes, adjacency) {
-  const reverse = createAdjacency(nodes);
-  for (const [source, targets] of adjacency)
-    for (const target of targets)
-      appendNeighbor(reverse, target, source);
-  return collectReverseComponents(computeFinishingOrder(nodes, adjacency), reverse);
-}
-function buildExecutionAdjacency(graph, registry) {
-  const adjacency = createAdjacency(graph.nodes());
-  for (const edge of graph.edges()) {
-    const definition = registry.require(edge.kind);
-    if (!definition.ordering)
-      continue;
-    const sourceFirst = (definition.precedence ?? "source_before_target") === "source_before_target";
-    appendNeighbor(adjacency, sourceFirst ? edge.source : edge.target, sourceFirst ? edge.target : edge.source);
-  }
-  return adjacency;
-}
-function topologicalLayers(nodes, adjacency) {
-  const indegree = new Map(nodes.map((node) => [node, 0]));
-  for (const targets of adjacency.values())
-    for (const target of targets)
-      indegree.set(target, indegree.get(target) + 1);
-  let frontier = nodes.filter((node) => indegree.get(node) === 0).sort();
-  const layers = [];
-  while (frontier.length > 0) {
-    layers.push(frontier);
-    const next = [];
-    for (const source of frontier) {
-      for (const target of adjacency.get(source)) {
-        const remaining = indegree.get(target) - 1;
-        indegree.set(target, remaining);
-        if (remaining === 0)
-          next.push(target);
-      }
-    }
-    frontier = next.sort();
-  }
-  return layers;
-}
-function longestPath(order, adjacency) {
-  const depth = new Map(order.map((node) => [node, 0]));
-  const parent = /* @__PURE__ */ new Map();
-  for (const source of order) {
-    for (const target of adjacency.get(source)) {
-      if (!depth.has(target))
-        continue;
-      const candidate = depth.get(source) + 1;
-      const currentParent = parent.get(target);
-      if (candidate > depth.get(target) || candidate === depth.get(target) && (currentParent === void 0 || source.localeCompare(currentParent) < 0)) {
-        depth.set(target, candidate);
-        parent.set(target, source);
-      }
-    }
-  }
-  const end = [...order].sort((left, right) => depth.get(right) - depth.get(left) || left.localeCompare(right))[0];
-  const path = end === void 0 ? [] : [end];
-  while (path[0] !== void 0 && parent.has(path[0]))
-    path.unshift(parent.get(path[0]));
-  return { depth: Object.fromEntries(depth), path };
-}
-function reconstructImpactPath(root, target, parents) {
-  const path = [target];
-  let cursor = target;
-  while (cursor !== root) {
-    cursor = parents.get(cursor);
-    path.push(cursor);
-  }
-  return path.reverse();
-}
-function analyzeRelationshipExecution(graph, options = {}) {
-  const registry = options.registry ?? createRelationshipKindRegistry();
-  const nodes = [...graph.nodes()];
-  const adjacency = buildExecutionAdjacency(graph, registry);
-  const layers = topologicalLayers(nodes, adjacency);
-  const order = layers.flat();
-  const acyclic = order.length === nodes.length;
-  const cycles = acyclic ? [] : stronglyConnectedComponents(nodes, adjacency).filter((component) => component.length > 1 || adjacency.get(component[0]).has(component[0]));
-  const longest = longestPath(order, adjacency);
-  return {
-    exact: true,
-    acyclic,
-    order,
-    layers,
-    frontier: layers[0] ?? [],
-    depth: longest.depth,
-    criticalPath: longest.path,
-    criticalPathLength: Math.max(0, longest.path.length - 1),
-    cycles,
-    provenance: { algorithm: "kahn-longest-path", edgeFamily: "ordering" }
-  };
-}
-function analyzeGraphImpact(graph, root, options = {}) {
-  const direction = options.direction ?? "outgoing";
-  const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-  const limit = options.limit ?? Number.POSITIVE_INFINITY;
-  const queue = [{ id: root, depth: 0 }];
-  const seen = /* @__PURE__ */ new Set([root]);
-  const parents = /* @__PURE__ */ new Map();
-  const affected = [];
-  let visitedNodes = 0;
-  let inspectedEdges = 0;
-  let truncated = false;
-  traversal: for (let index = 0; index < queue.length; index += 1) {
-    options.signal?.throwIfAborted();
-    const current = queue[index];
-    visitedNodes += 1;
-    const adjacent = graph.adjacency(current.id, {
-      direction,
-      kinds: options.kinds,
-      signal: options.signal
-    });
-    inspectedEdges += adjacent.meta.inspectedEdges;
-    if (current.depth >= maxDepth) {
-      if (adjacent.value.some((id) => !seen.has(id)))
-        truncated = true;
-      continue;
-    }
-    for (const id of adjacent.value) {
-      if (seen.has(id))
-        continue;
-      if (affected.length >= limit) {
-        truncated = true;
-        break traversal;
-      }
-      seen.add(id);
-      parents.set(id, current.id);
-      const depth = current.depth + 1;
-      affected.push({
-        id,
-        distance: depth,
-        path: reconstructImpactPath(root, id, parents)
-      });
-      queue.push({ id, depth });
-    }
-  }
-  return {
-    root,
-    affected,
-    exact: true,
-    truncated,
-    cost: { visitedNodes, inspectedEdges }
-  };
-}
-function analyzeKnowledgeGraph(graph) {
-  const nodes = [...graph.nodes()];
-  const weak = createAdjacency(nodes);
-  const directed = createAdjacency(nodes);
-  for (const edge of graph.edges()) {
-    appendNeighbor(weak, edge.source, edge.target);
-    appendNeighbor(weak, edge.target, edge.source);
-    appendNeighbor(directed, edge.source, edge.target);
-  }
-  const components = [];
-  const visited = /* @__PURE__ */ new Set();
-  for (const start of nodes) {
-    if (visited.has(start))
-      continue;
-    const component = [];
-    const stack = [start];
-    visited.add(start);
-    while (stack.length > 0) {
-      const current = stack.pop();
-      component.push(current);
-      for (const neighbor of weak.get(current)) {
-        if (visited.has(neighbor))
-          continue;
-        visited.add(neighbor);
-        stack.push(neighbor);
-      }
-    }
-    components.push(component);
-  }
-  const degrees = nodes.map((id) => ({ id, degree: weak.get(id).size }));
-  const maximum = Math.max(0, ...degrees.map(({ degree }) => degree));
-  return {
-    components: sortComponents(components),
-    stronglyConnected: stronglyConnectedComponents(nodes, directed),
-    orphans: degrees.filter(({ degree }) => degree === 0).map(({ id }) => id),
-    hubs: degrees.filter(({ degree }) => degree > 0 && degree === maximum),
-    exact: true,
-    provenance: { algorithm: "component-degree", edgeFamily: "all" }
-  };
-}
-function compareRelationshipSnapshots(before, after) {
-  const earlier = new Map(before.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
-  const later = new Map(after.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
-  return {
-    fromVersion: before.version,
-    toVersion: after.version,
-    added: [...later].filter(([key]) => !earlier.has(key)).map(([, edge]) => edge),
-    removed: [...earlier].filter(([key]) => !later.has(key)).map(([, edge]) => edge),
-    unchangedCount: [...earlier.keys()].filter((key) => later.has(key)).length,
-    exact: true
-  };
-}
-
-export {
-  analyzeRelationshipExecution,
-  analyzeGraphImpact,
-  analyzeKnowledgeGraph,
-  compareRelationshipSnapshots
-};
-//# sourceMappingURL=chunk-6C2ZZX5Z.js.map
-
-//# debugId=5638f886-de83-5daf-8c42-386c898c57c0

package/dist/cli-bundle/chunks/chunk-6C2ZZX5Z.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../sdk/relationship-analytics.ts"],"sourcesContent":["/**\n * @module sdk/relationship-analytics\n *\n * Provides exact, deterministic graph analytics with explicit semantics and\n * provenance suitable for planning, impact analysis, and context selection.\n */\nimport type { RelationshipSnapshot } from \"./relationship-history.js\";\nimport {\n  RelationshipGraph,\n  RelationshipKindRegistry,\n  createRelationshipKindRegistry,\n  type RelationshipEdge,\n  type RelationshipQueryOptions,\n} from \"./relationships.js\";\n\n/** Exact execution-graph analysis over registered ordering kinds. */\nexport interface RelationshipExecutionAnalysis {\n  /** Whether the result is exact rather than sampled or approximate. */\n  exact: true;\n  /** Whether the order-bearing graph is acyclic. */\n  acyclic: boolean;\n  /** Deterministic topological order for acyclic nodes. */\n  order: string[];\n  /** Parallelizable topological layers. */\n  layers: string[][];\n  /** Nodes with no prerequisites. */\n  frontier: string[];\n  /** Longest prerequisite distance for each acyclic node. */\n  depth: Record<string, number>;\n  /** Longest deterministic execution path. */\n  criticalPath: string[];\n  /** Edge count of the critical path. */\n  criticalPathLength: number;\n  /** Strongly connected order-bearing components that represent cycles. */\n  cycles: string[][];\n  /** Semantic provenance for the analysis. */\n  provenance: { algorithm: \"kahn-longest-path\"; edgeFamily: \"ordering\" };\n}\n\n/** One affected node with its exact shortest explanation path. */\nexport interface RelationshipImpactRow {\n  /** Affected node identifier. */\n  id: string;\n  /** Shortest relationship distance from the root. */\n  distance: number;\n  /** Exact path explaining why the node is affected. */\n  path: string[];\n}\n\n/** Bounded reverse- or forward-impact result. */\nexport interface RelationshipImpactAnalysis {\n  /** Impact origin. */\n  root: string;\n  /** Deterministic affected-node rows. */\n  affected: RelationshipImpactRow[];\n  /** Returned rows are exact even when the bounded result is incomplete. */\n  exact: true;\n  /** Whether configured traversal bounds omitted reachable work. */\n  truncated: boolean;\n  /** Query work retained for performance and explainability. */\n  cost: { visitedNodes: number; inspectedEdges: number };\n}\n\n/** Exact structural summary of the complete graph snapshot. */\nexport interface RelationshipKnowledgeAnalysis {\n  /** Weakly connected components, largest then lexicographic. */\n  components: string[][];\n  /** Strongly connected components over directed stored edges. */\n  stronglyConnected: string[][];\n  /** Nodes with no relationship edges. */\n  orphans: string[];\n  /** Maximum-degree nodes and their unique-neighbor degree. */\n  hubs: { id: string; degree: number }[];\n  /** Whether the result is exact. */\n  exact: true;\n  /** Semantic provenance for the analysis. */\n  provenance: { algorithm: \"component-degree\"; edgeFamily: \"all\" };\n}\n\n/** Edge-level delta between two immutable snapshots. */\nexport interface RelationshipSnapshotComparison {\n  /** Earlier snapshot version. */\n  fromVersion: number;\n  /** Later snapshot version. */\n  toVersion: number;\n  /** Edges introduced in the later snapshot. */\n  added: RelationshipEdge[];\n  /** Edges absent from the later snapshot. */\n  removed: RelationshipEdge[];\n  /** Number of byte-equivalent edges retained. */\n  unchangedCount: number;\n  /** Whether the comparison is exact. */\n  exact: true;\n}\n\n/** Registry override for custom domain semantics. */\nexport interface RelationshipAnalyticsOptions {\n  /** Registry used to interpret ordering direction and custom kinds. */\n  registry?: RelationshipKindRegistry;\n}\n\nfunction appendNeighbor(\n  adjacency: Map<string, Set<string>>,\n  source: string,\n  target: string,\n): void {\n  adjacency.get(source)!.add(target);\n}\n\nfunction createAdjacency(nodes: readonly string[]): Map<string, Set<string>> {\n  return new Map(nodes.map((node) => [node, new Set<string>()]));\n}\n\nfunction sortComponents(components: string[][]): string[][] {\n  for (const component of components) component.sort();\n  return components.sort(\n    (left, right) =>\n      right.length - left.length || left[0]!.localeCompare(right[0]!),\n  );\n}\n\nfunction stableJsonValue(value: unknown): unknown {\n  if (Array.isArray(value)) return value.map((entry) => stableJsonValue(entry));\n  if (value === null || typeof value !== \"object\") return value;\n  const toJSON = (value as { toJSON?: (this: object) => unknown }).toJSON;\n  if (typeof toJSON === \"function\") return stableJsonValue(toJSON.call(value));\n  return Object.fromEntries(\n    Object.entries(value)\n      .sort(([left], [right]) => left.localeCompare(right))\n      .map(([key, entry]) => [key, stableJsonValue(entry)]),\n  );\n}\n\nfunction relationshipEdgeKey(edge: RelationshipEdge): string {\n  return JSON.stringify(stableJsonValue(edge));\n}\n\nfunction appendFinishingOrder(\n  start: string,\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n  visited: Set<string>,\n  order: string[],\n): void {\n  const stack = [{ id: start, expanded: false }];\n  while (stack.length > 0) {\n    const current = stack.pop()!;\n    if (current.expanded) {\n      order.push(current.id);\n      continue;\n    }\n    if (visited.has(current.id)) continue;\n    visited.add(current.id);\n    stack.push({ id: current.id, expanded: true });\n    const neighbors = [...adjacency.get(current.id)!].sort().reverse();\n    for (const neighbor of neighbors)\n      if (!visited.has(neighbor)) stack.push({ id: neighbor, expanded: false });\n  }\n}\n\nfunction computeFinishingOrder(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[] {\n  const visited = new Set<string>();\n  const order: string[] = [];\n  for (const start of nodes)\n    if (!visited.has(start))\n      appendFinishingOrder(start, adjacency, visited, order);\n  return order;\n}\n\nfunction collectReverseComponents(\n  order: readonly string[],\n  reverse: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const visited = new Set<string>();\n  const components: string[][] = [];\n  for (const start of [...order].reverse()) {\n    if (visited.has(start)) continue;\n    const component: string[] = [];\n    const stack = [start];\n    visited.add(start);\n    while (stack.length > 0) {\n      const current = stack.pop()!;\n      component.push(current);\n      for (const neighbor of reverse.get(current)!) {\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        stack.push(neighbor);\n      }\n    }\n    components.push(component);\n  }\n  return sortComponents(components);\n}\n\nfunction stronglyConnectedComponents(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const reverse = createAdjacency(nodes);\n  for (const [source, targets] of adjacency)\n    for (const target of targets) appendNeighbor(reverse, target, source);\n  return collectReverseComponents(\n    computeFinishingOrder(nodes, adjacency),\n    reverse,\n  );\n}\n\nfunction buildExecutionAdjacency(\n  graph: RelationshipGraph,\n  registry: RelationshipKindRegistry,\n): Map<string, Set<string>> {\n  const adjacency = createAdjacency(graph.nodes());\n  for (const edge of graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!definition.ordering) continue;\n    // Legacy and JSON-parsed definitions may predate explicit precedence.\n    const sourceFirst =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"source_before_target\";\n    appendNeighbor(\n      adjacency,\n      sourceFirst ? edge.source : edge.target,\n      sourceFirst ? edge.target : edge.source,\n    );\n  }\n  return adjacency;\n}\n\nfunction topologicalLayers(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const indegree = new Map(nodes.map((node) => [node, 0]));\n  for (const targets of adjacency.values())\n    for (const target of targets)\n      indegree.set(target, indegree.get(target)! + 1);\n  let frontier = nodes.filter((node) => indegree.get(node) === 0).sort();\n  const layers: string[][] = [];\n  while (frontier.length > 0) {\n    layers.push(frontier);\n    const next: string[] = [];\n    for (const source of frontier) {\n      for (const target of adjacency.get(source)!) {\n        const remaining = indegree.get(target)! - 1;\n        indegree.set(target, remaining);\n        if (remaining === 0) next.push(target);\n      }\n    }\n    frontier = next.sort();\n  }\n  return layers;\n}\n\nfunction longestPath(\n  order: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): { depth: Record<string, number>; path: string[] } {\n  const depth = new Map(order.map((node) => [node, 0]));\n  const parent = new Map<string, string>();\n  for (const source of order) {\n    for (const target of adjacency.get(source)!) {\n      if (!depth.has(target)) continue;\n      const candidate = depth.get(source)! + 1;\n      const currentParent = parent.get(target);\n      if (\n        candidate > depth.get(target)! ||\n        (candidate === depth.get(target)! &&\n          (currentParent === undefined ||\n            source.localeCompare(currentParent) < 0))\n      ) {\n        depth.set(target, candidate);\n        parent.set(target, source);\n      }\n    }\n  }\n  const end = [...order].sort(\n    (left, right) =>\n      depth.get(right)! - depth.get(left)! || left.localeCompare(right),\n  )[0];\n  const path = end === undefined ? [] : [end];\n  while (path[0] !== undefined && parent.has(path[0]!))\n    path.unshift(parent.get(path[0]!)!);\n  return { depth: Object.fromEntries(depth), path };\n}\n\nfunction reconstructImpactPath(\n  root: string,\n  target: string,\n  parents: ReadonlyMap<string, string>,\n): string[] {\n  const path = [target];\n  let cursor = target;\n  while (cursor !== root) {\n    cursor = parents.get(cursor)!;\n    path.push(cursor);\n  }\n  return path.reverse();\n}\n\n/** Analyze registered order-bearing relationships without treating associative cycles as blockers. */\nexport function analyzeRelationshipExecution(\n  graph: RelationshipGraph,\n  options: RelationshipAnalyticsOptions = {},\n): RelationshipExecutionAnalysis {\n  const registry = options.registry ?? createRelationshipKindRegistry();\n  const nodes = [...graph.nodes()];\n  const adjacency = buildExecutionAdjacency(graph, registry);\n  const layers = topologicalLayers(nodes, adjacency);\n  const order = layers.flat();\n  const acyclic = order.length === nodes.length;\n  const cycles = acyclic\n    ? []\n    : stronglyConnectedComponents(nodes, adjacency).filter(\n        (component) =>\n          component.length > 1 ||\n          adjacency.get(component[0]!)!.has(component[0]!),\n      );\n  const longest = longestPath(order, adjacency);\n  return {\n    exact: true,\n    acyclic,\n    order,\n    layers,\n    frontier: layers[0] ?? [],\n    depth: longest.depth,\n    criticalPath: longest.path,\n    criticalPathLength: Math.max(0, longest.path.length - 1),\n    cycles,\n    provenance: { algorithm: \"kahn-longest-path\", edgeFamily: \"ordering\" },\n  };\n}\n\n/** Compute bounded impact rows and exact shortest explanation paths. */\nexport function analyzeGraphImpact(\n  graph: RelationshipGraph,\n  root: string,\n  options: RelationshipQueryOptions = {},\n): RelationshipImpactAnalysis {\n  const direction = options.direction ?? \"outgoing\";\n  const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n  const limit = options.limit ?? Number.POSITIVE_INFINITY;\n  const queue = [{ id: root, depth: 0 }];\n  const seen = new Set([root]);\n  const parents = new Map<string, string>();\n  const affected: RelationshipImpactRow[] = [];\n  let visitedNodes = 0;\n  let inspectedEdges = 0;\n  let truncated = false;\n  traversal: for (let index = 0; index < queue.length; index += 1) {\n    options.signal?.throwIfAborted();\n    const current = queue[index]!;\n    visitedNodes += 1;\n    const adjacent = graph.adjacency(current.id, {\n      direction,\n      kinds: options.kinds,\n      signal: options.signal,\n    });\n    inspectedEdges += adjacent.meta.inspectedEdges;\n    if (current.depth >= maxDepth) {\n      if (adjacent.value.some((id) => !seen.has(id))) truncated = true;\n      continue;\n    }\n    for (const id of adjacent.value) {\n      if (seen.has(id)) continue;\n      if (affected.length >= limit) {\n        truncated = true;\n        break traversal;\n      }\n      seen.add(id);\n      parents.set(id, current.id);\n      const depth = current.depth + 1;\n      affected.push({\n        id,\n        distance: depth,\n        path: reconstructImpactPath(root, id, parents),\n      });\n      queue.push({ id, depth });\n    }\n  }\n  return {\n    root,\n    affected,\n    exact: true,\n    truncated,\n    cost: { visitedNodes, inspectedEdges },\n  };\n}\n\n/** Analyze weak/strong components, isolates, and exact unique-neighbor hubs. */\nexport function analyzeKnowledgeGraph(\n  graph: RelationshipGraph,\n): RelationshipKnowledgeAnalysis {\n  const nodes = [...graph.nodes()];\n  const weak = createAdjacency(nodes);\n  const directed = createAdjacency(nodes);\n  for (const edge of graph.edges()) {\n    appendNeighbor(weak, edge.source, edge.target);\n    appendNeighbor(weak, edge.target, edge.source);\n    appendNeighbor(directed, edge.source, edge.target);\n  }\n  const components: string[][] = [];\n  const visited = new Set<string>();\n  for (const start of nodes) {\n    if (visited.has(start)) continue;\n    const component: string[] = [];\n    const stack = [start];\n    visited.add(start);\n    while (stack.length > 0) {\n      const current = stack.pop()!;\n      component.push(current);\n      for (const neighbor of weak.get(current)!) {\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        stack.push(neighbor);\n      }\n    }\n    components.push(component);\n  }\n  const degrees = nodes.map((id) => ({ id, degree: weak.get(id)!.size }));\n  const maximum = Math.max(0, ...degrees.map(({ degree }) => degree));\n  return {\n    components: sortComponents(components),\n    stronglyConnected: stronglyConnectedComponents(nodes, directed),\n    orphans: degrees.filter(({ degree }) => degree === 0).map(({ id }) => id),\n    hubs: degrees.filter(({ degree }) => degree > 0 && degree === maximum),\n    exact: true,\n    provenance: { algorithm: \"component-degree\", edgeFamily: \"all\" },\n  };\n}\n\n/** Compare two immutable relationship snapshots by full normalized edge value. */\nexport function compareRelationshipSnapshots(\n  before: RelationshipSnapshot,\n  after: RelationshipSnapshot,\n): RelationshipSnapshotComparison {\n  const earlier = new Map(\n    before.edges.map((edge) => [relationshipEdgeKey(edge), edge]),\n  );\n  const later = new Map(\n    after.edges.map((edge) => [relationshipEdgeKey(edge), edge]),\n  );\n  return {\n    fromVersion: before.version,\n    toVersion: after.version,\n    added: [...later]\n      .filter(([key]) => !earlier.has(key))\n      .map(([, edge]) => edge),\n    removed: [...earlier]\n      .filter(([key]) => !later.has(key))\n      .map(([, edge]) => edge),\n    unchangedCount: [...earlier.keys()].filter((key) => later.has(key)).length,\n    exact: true,\n  };\n}\n"],"names":[],"mappings":";;;;;;;AAqGA,SAAS,eACP,WACA,QACA,QAAc;AAEd,YAAU,IAAI,MAAM,EAAG,IAAI,MAAM;AACnC;AAEA,SAAS,gBAAgB,OAAwB;AAC/C,SAAO,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,oBAAI,IAAG,CAAU,CAAC,CAAC;AAC/D;AAEA,SAAS,eAAe,YAAsB;AAC5C,aAAW,aAAa;AAAY,cAAU,KAAI;AAClD,SAAO,WAAW,KAChB,CAAC,MAAM,UACL,MAAM,SAAS,KAAK,UAAU,KAAK,CAAC,EAAG,cAAc,MAAM,CAAC,CAAE,CAAC;AAErE;AAEA,SAAS,gBAAgB,OAAc;AACrC,MAAI,MAAM,QAAQ,KAAK;AAAG,WAAO,MAAM,IAAI,CAAC,UAAU,gBAAgB,KAAK,CAAC;AAC5E,MAAI,UAAU,QAAQ,OAAO,UAAU;AAAU,WAAO;AACxD,QAAM,SAAU,MAAiD;AACjE,MAAI,OAAO,WAAW;AAAY,WAAO,gBAAgB,OAAO,KAAK,KAAK,CAAC;AAC3E,SAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,EACjB,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC,EACnD,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,gBAAgB,KAAK,CAAC,CAAC,CAAC;AAE3D;AAEA,SAAS,oBAAoB,MAAsB;AACjD,SAAO,KAAK,UAAU,gBAAgB,IAAI,CAAC;AAC7C;AAEA,SAAS,qBACP,OACA,WACA,SACA,OAAe;AAEf,QAAM,QAAQ,CAAC,EAAE,IAAI,OAAO,UAAU,MAAK,CAAE;AAC7C,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,IAAG;AACzB,QAAI,QAAQ,UAAU;AACpB,YAAM,KAAK,QAAQ,EAAE;AACrB;IACF;AACA,QAAI,QAAQ,IAAI,QAAQ,EAAE;AAAG;AAC7B,YAAQ,IAAI,QAAQ,EAAE;AACtB,UAAM,KAAK,EAAE,IAAI,QAAQ,IAAI,UAAU,KAAI,CAAE;AAC7C,UAAM,YAAY,CAAC,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAE,EAAE,KAAI,EAAG,QAAO;AAChE,eAAW,YAAY;AACrB,UAAI,CAAC,QAAQ,IAAI,QAAQ;AAAG,cAAM,KAAK,EAAE,IAAI,UAAU,UAAU,MAAK,CAAE;EAC5E;AACF;AAEA,SAAS,sBACP,OACA,WAAmD;AAEnD,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,QAAkB,CAAA;AACxB,aAAW,SAAS;AAClB,QAAI,CAAC,QAAQ,IAAI,KAAK;AACpB,2BAAqB,OAAO,WAAW,SAAS,KAAK;AACzD,SAAO;AACT;AAEA,SAAS,yBACP,OACA,SAAiD;AAEjD,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,aAAyB,CAAA;AAC/B,aAAW,SAAS,CAAC,GAAG,KAAK,EAAE,QAAO,GAAI;AACxC,QAAI,QAAQ,IAAI,KAAK;AAAG;AACxB,UAAM,YAAsB,CAAA;AAC5B,UAAM,QAAQ,CAAC,KAAK;AACpB,YAAQ,IAAI,KAAK;AACjB,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,IAAG;AACzB,gBAAU,KAAK,OAAO;AACtB,iBAAW,YAAY,QAAQ,IAAI,OAAO,GAAI;AAC5C,YAAI,QAAQ,IAAI,QAAQ;AAAG;AAC3B,gBAAQ,IAAI,QAAQ;AACpB,cAAM,KAAK,QAAQ;MACrB;IACF;AACA,eAAW,KAAK,SAAS;EAC3B;AACA,SAAO,eAAe,UAAU;AAClC;AAEA,SAAS,4BACP,OACA,WAAmD;AAEnD,QAAM,UAAU,gBAAgB,KAAK;AACrC,aAAW,CAAC,QAAQ,OAAO,KAAK;AAC9B,eAAW,UAAU;AAAS,qBAAe,SAAS,QAAQ,MAAM;AACtE,SAAO,yBACL,sBAAsB,OAAO,SAAS,GACtC,OAAO;AAEX;AAEA,SAAS,wBACP,OACA,UAAkC;AAElC,QAAM,YAAY,gBAAgB,MAAM,MAAK,CAAE;AAC/C,aAAW,QAAQ,MAAM,MAAK,GAAI;AAChC,UAAM,aAAa,SAAS,QAAQ,KAAK,IAAI;AAC7C,QAAI,CAAC,WAAW;AAAU;AAE1B,UAAM,eACH,WAAW,cAAc,4BAC1B;AACF,mBACE,WACA,cAAc,KAAK,SAAS,KAAK,QACjC,cAAc,KAAK,SAAS,KAAK,MAAM;EAE3C;AACA,SAAO;AACT;AAEA,SAAS,kBACP,OACA,WAAmD;AAEnD,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;AACvD,aAAW,WAAW,UAAU,OAAM;AACpC,eAAW,UAAU;AACnB,eAAS,IAAI,QAAQ,SAAS,IAAI,MAAM,IAAK,CAAC;AAClD,MAAI,WAAW,MAAM,OAAO,CAAC,SAAS,SAAS,IAAI,IAAI,MAAM,CAAC,EAAE,KAAI;AACpE,QAAM,SAAqB,CAAA;AAC3B,SAAO,SAAS,SAAS,GAAG;AAC1B,WAAO,KAAK,QAAQ;AACpB,UAAM,OAAiB,CAAA;AACvB,eAAW,UAAU,UAAU;AAC7B,iBAAW,UAAU,UAAU,IAAI,MAAM,GAAI;AAC3C,cAAM,YAAY,SAAS,IAAI,MAAM,IAAK;AAC1C,iBAAS,IAAI,QAAQ,SAAS;AAC9B,YAAI,cAAc;AAAG,eAAK,KAAK,MAAM;MACvC;IACF;AACA,eAAW,KAAK,KAAI;EACtB;AACA,SAAO;AACT;AAEA,SAAS,YACP,OACA,WAAmD;AAEnD,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;AACpD,QAAM,SAAS,oBAAI,IAAG;AACtB,aAAW,UAAU,OAAO;AAC1B,eAAW,UAAU,UAAU,IAAI,MAAM,GAAI;AAC3C,UAAI,CAAC,MAAM,IAAI,MAAM;AAAG;AACxB,YAAM,YAAY,MAAM,IAAI,MAAM,IAAK;AACvC,YAAM,gBAAgB,OAAO,IAAI,MAAM;AACvC,UACE,YAAY,MAAM,IAAI,MAAM,KAC3B,cAAc,MAAM,IAAI,MAAM,MAC5B,kBAAkB,UACjB,OAAO,cAAc,aAAa,IAAI,IAC1C;AACA,cAAM,IAAI,QAAQ,SAAS;AAC3B,eAAO,IAAI,QAAQ,MAAM;MAC3B;IACF;EACF;AACA,QAAM,MAAM,CAAC,GAAG,KAAK,EAAE,KACrB,CAAC,MAAM,UACL,MAAM,IAAI,KAAK,IAAK,MAAM,IAAI,IAAI,KAAM,KAAK,cAAc,KAAK,CAAC,EACnE,CAAC;AACH,QAAM,OAAO,QAAQ,SAAY,CAAA,IAAK,CAAC,GAAG;AAC1C,SAAO,KAAK,CAAC,MAAM,UAAa,OAAO,IAAI,KAAK,CAAC,CAAE;AACjD,SAAK,QAAQ,OAAO,IAAI,KAAK,CAAC,CAAE,CAAE;AACpC,SAAO,EAAE,OAAO,OAAO,YAAY,KAAK,GAAG,KAAI;AACjD;AAEA,SAAS,sBACP,MACA,QACA,SAAoC;AAEpC,QAAM,OAAO,CAAC,MAAM;AACpB,MAAI,SAAS;AACb,SAAO,WAAW,MAAM;AACtB,aAAS,QAAQ,IAAI,MAAM;AAC3B,SAAK,KAAK,MAAM;EAClB;AACA,SAAO,KAAK,QAAO;AACrB;AAGM,SAAU,6BACd,OACA,UAAwC,CAAA,GAAE;AAE1C,QAAM,WAAW,QAAQ,YAAY,+BAA8B;AACnE,QAAM,QAAQ,CAAC,GAAG,MAAM,MAAK,CAAE;AAC/B,QAAM,YAAY,wBAAwB,OAAO,QAAQ;AACzD,QAAM,SAAS,kBAAkB,OAAO,SAAS;AACjD,QAAM,QAAQ,OAAO,KAAI;AACzB,QAAM,UAAU,MAAM,WAAW,MAAM;AACvC,QAAM,SAAS,UACX,CAAA,IACA,4BAA4B,OAAO,SAAS,EAAE,OAC5C,CAAC,cACC,UAAU,SAAS,KACnB,UAAU,IAAI,UAAU,CAAC,CAAE,EAAG,IAAI,UAAU,CAAC,CAAE,CAAC;AAExD,QAAM,UAAU,YAAY,OAAO,SAAS;AAC5C,SAAO;IACL,OAAO;IACP;IACA;IACA;IACA,UAAU,OAAO,CAAC,KAAK,CAAA;IACvB,OAAO,QAAQ;IACf,cAAc,QAAQ;IACtB,oBAAoB,KAAK,IAAI,GAAG,QAAQ,KAAK,SAAS,CAAC;IACvD;IACA,YAAY,EAAE,WAAW,qBAAqB,YAAY,WAAU;;AAExE;AAGM,SAAU,mBACd,OACA,MACA,UAAoC,CAAA,GAAE;AAEtC,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,WAAW,QAAQ,YAAY,OAAO;AAC5C,QAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,QAAM,QAAQ,CAAC,EAAE,IAAI,MAAM,OAAO,EAAC,CAAE;AACrC,QAAM,OAAO,oBAAI,IAAI,CAAC,IAAI,CAAC;AAC3B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAoC,CAAA;AAC1C,MAAI,eAAe;AACnB,MAAI,iBAAiB;AACrB,MAAI,YAAY;AAChB,YAAW,UAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AAC/D,YAAQ,QAAQ,eAAc;AAC9B,UAAM,UAAU,MAAM,KAAK;AAC3B,oBAAgB;AAChB,UAAM,WAAW,MAAM,UAAU,QAAQ,IAAI;MAC3C;MACA,OAAO,QAAQ;MACf,QAAQ,QAAQ;KACjB;AACD,sBAAkB,SAAS,KAAK;AAChC,QAAI,QAAQ,SAAS,UAAU;AAC7B,UAAI,SAAS,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;AAAG,oBAAY;AAC5D;IACF;AACA,eAAW,MAAM,SAAS,OAAO;AAC/B,UAAI,KAAK,IAAI,EAAE;AAAG;AAClB,UAAI,SAAS,UAAU,OAAO;AAC5B,oBAAY;AACZ,cAAM;MACR;AACA,WAAK,IAAI,EAAE;AACX,cAAQ,IAAI,IAAI,QAAQ,EAAE;AAC1B,YAAM,QAAQ,QAAQ,QAAQ;AAC9B,eAAS,KAAK;QACZ;QACA,UAAU;QACV,MAAM,sBAAsB,MAAM,IAAI,OAAO;OAC9C;AACD,YAAM,KAAK,EAAE,IAAI,MAAK,CAAE;IAC1B;EACF;AACA,SAAO;IACL;IACA;IACA,OAAO;IACP;IACA,MAAM,EAAE,cAAc,eAAc;;AAExC;AAGM,SAAU,sBACd,OAAwB;AAExB,QAAM,QAAQ,CAAC,GAAG,MAAM,MAAK,CAAE;AAC/B,QAAM,OAAO,gBAAgB,KAAK;AAClC,QAAM,WAAW,gBAAgB,KAAK;AACtC,aAAW,QAAQ,MAAM,MAAK,GAAI;AAChC,mBAAe,MAAM,KAAK,QAAQ,KAAK,MAAM;AAC7C,mBAAe,MAAM,KAAK,QAAQ,KAAK,MAAM;AAC7C,mBAAe,UAAU,KAAK,QAAQ,KAAK,MAAM;EACnD;AACA,QAAM,aAAyB,CAAA;AAC/B,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,SAAS,OAAO;AACzB,QAAI,QAAQ,IAAI,KAAK;AAAG;AACxB,UAAM,YAAsB,CAAA;AAC5B,UAAM,QAAQ,CAAC,KAAK;AACpB,YAAQ,IAAI,KAAK;AACjB,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,IAAG;AACzB,gBAAU,KAAK,OAAO;AACtB,iBAAW,YAAY,KAAK,IAAI,OAAO,GAAI;AACzC,YAAI,QAAQ,IAAI,QAAQ;AAAG;AAC3B,gBAAQ,IAAI,QAAQ;AACpB,cAAM,KAAK,QAAQ;MACrB;IACF;AACA,eAAW,KAAK,SAAS;EAC3B;AACA,QAAM,UAAU,MAAM,IAAI,CAAC,QAAQ,EAAE,IAAI,QAAQ,KAAK,IAAI,EAAE,EAAG,KAAI,EAAG;AACtE,QAAM,UAAU,KAAK,IAAI,GAAG,GAAG,QAAQ,IAAI,CAAC,EAAE,OAAM,MAAO,MAAM,CAAC;AAClE,SAAO;IACL,YAAY,eAAe,UAAU;IACrC,mBAAmB,4BAA4B,OAAO,QAAQ;IAC9D,SAAS,QAAQ,OAAO,CAAC,EAAE,OAAM,MAAO,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,GAAE,MAAO,EAAE;IACxE,MAAM,QAAQ,OAAO,CAAC,EAAE,OAAM,MAAO,SAAS,KAAK,WAAW,OAAO;IACrE,OAAO;IACP,YAAY,EAAE,WAAW,oBAAoB,YAAY,MAAK;;AAElE;AAGM,SAAU,6BACd,QACA,OAA2B;AAE3B,QAAM,UAAU,IAAI,IAClB,OAAO,MAAM,IAAI,CAAC,SAAS,CAAC,oBAAoB,IAAI,GAAG,IAAI,CAAC,CAAC;AAE/D,QAAM,QAAQ,IAAI,IAChB,MAAM,MAAM,IAAI,CAAC,SAAS,CAAC,oBAAoB,IAAI,GAAG,IAAI,CAAC,CAAC;AAE9D,SAAO;IACL,aAAa,OAAO;IACpB,WAAW,MAAM;IACjB,OAAO,CAAC,GAAG,KAAK,EACb,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,IAAI,GAAG,CAAC,EACnC,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM,IAAI;IACzB,SAAS,CAAC,GAAG,OAAO,EACjB,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,EACjC,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM,IAAI;IACzB,gBAAgB,CAAC,GAAG,QAAQ,KAAI,CAAE,EAAE,OAAO,CAAC,QAAQ,MAAM,IAAI,GAAG,CAAC,EAAE;IACpE,OAAO;;AAEX","debugId":"5638f886-de83-5daf-8c42-386c898c57c0"}