@unbrained/pm-cli 2026.9.6 → 2026.9.8

package/dist/sdk/relationship-analytics.js

@@ -1,411 +1,2 @@
-
-!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]="3167c288-0bcc-5a66-8aa0-ca5876ed7d36")}catch(e){}}();
-import { createQueryFingerprint, decodeQueryCursor, encodeQueryCursor, } from "./pagination.js";
-import { createRelationshipKindRegistry, } from "./relationships.js";
-function visitImpactNeighbor(state, id, parent, root, after, limit) {
-    if (state.seen.has(id))
-        return "skip";
-    if (state.cursorFound && state.affected.length >= limit)
-        return "truncate";
-    state.seen.add(id);
-    state.parents.set(id, parent.id);
-    const depth = parent.depth + 1;
-    state.queue.push({ id, depth });
-    if (!state.cursorFound) {
-        state.cursorFound = id === after;
-        return "skip";
-    }
-    state.affected.push({
-        id,
-        distance: depth,
-        path: reconstructImpactPath(root, id, state.parents),
-    });
-    return "continue";
-}
-/**
- * Bind a continuation cursor to traversal semantics while allowing callers to
- * choose a different page size when they resume.
- */
-function resolveImpactCursor(root, options, direction, maxDepth) {
-    const fingerprint = createQueryFingerprint("graph impact", {
-        root,
-        direction,
-        kinds: [...(options.kinds ?? [])].sort(),
-        max_depth: Number.isFinite(maxDepth) ? maxDepth : "unbounded",
-    });
-    return {
-        fingerprint,
-        after: options.after === undefined
-            ? undefined
-            : decodeQueryCursor(options.after, fingerprint),
-    };
-}
-function appendNeighbor(adjacency, source, target) {
-    adjacency.get(source).add(target);
-}
-function createAdjacency(nodes) {
-    return new Map(nodes.map((node) => [node, 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 = 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 = 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;
-        // Legacy and JSON-parsed definitions may predate explicit precedence.
-        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 = 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 === undefined ||
-                        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 === undefined ? [] : [end];
-    while (path[0] !== undefined && 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();
-}
-/** Analyze registered order-bearing relationships without treating associative cycles as blockers. */
-export 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" },
-    };
-}
-/** Build impact-only adjacency from stored source-to-target orientation. */
-function buildImpactAdjacency(graph, direction, kinds) {
-    const adjacency = createAdjacency(graph.nodes());
-    const selectedKinds = kinds === undefined
-        ? undefined
-        : new Set(kinds.map((kind) => graph.registry().require(kind).kind));
-    const edges = graph.edges();
-    for (const edge of edges) {
-        const definition = graph.registry().require(edge.kind);
-        if (selectedKinds !== undefined &&
-            !selectedKinds.has(edge.kind) &&
-            (definition.inverse === undefined ||
-                !selectedKinds.has(definition.inverse))) {
-            continue;
-        }
-        appendNeighbor(adjacency, direction === "incoming" ? edge.target : edge.source, direction === "incoming" ? edge.source : edge.target);
-    }
-    return { adjacency, inspectedEdges: edges.length };
-}
-/** Combine complete direction-locked incoming and outgoing impact traversals. */
-function analyzeBidirectionalGraphImpact(graph, root, options, after, limit, cursorFingerprint) {
-    const incoming = analyzeGraphImpact(graph, root, {
-        ...options,
-        after: undefined,
-        direction: "incoming",
-        limit: undefined,
-    });
-    const outgoing = analyzeGraphImpact(graph, root, {
-        ...options,
-        after: undefined,
-        direction: "outgoing",
-        limit: undefined,
-    });
-    const rows = new Map();
-    const candidates = [...incoming.affected, ...outgoing.affected].sort((left, right) => left.distance - right.distance ||
-        left.id.localeCompare(right.id) ||
-        left.path.join("\u0000").localeCompare(right.path.join("\u0000")));
-    for (const row of candidates) {
-        if (!rows.has(row.id)) {
-            rows.set(row.id, row);
-        }
-    }
-    const ordered = [...rows.values()].sort((left, right) => left.distance - right.distance || left.id.localeCompare(right.id));
-    const afterIndex = after === undefined || after === root
-        ? -1
-        : ordered.findIndex((row) => row.id === after);
-    if (after !== undefined && after !== root && afterIndex < 0) {
-        throw new TypeError(`Unknown impact cursor item: ${after}`);
-    }
-    const affected = ordered.slice(afterIndex + 1, afterIndex + 1 + limit);
-    const rowLimitTruncated = afterIndex + 1 + affected.length < ordered.length;
-    return {
-        root,
-        affected,
-        exact: true,
-        truncated: incoming.truncated || outgoing.truncated || rowLimitTruncated,
-        ...(rowLimitTruncated
-            ? {
-                nextCursor: encodeQueryCursor(cursorFingerprint, affected.at(-1)?.id ?? root),
-            }
-            : {}),
-        cost: {
-            visitedNodes: incoming.cost.visitedNodes + outgoing.cost.visitedNodes,
-            inspectedEdges: incoming.cost.inspectedEdges + outgoing.cost.inspectedEdges,
-        },
-    };
-}
-/** Compute one stored-direction impact traversal and exact shortest explanation paths. */
-function analyzeUnidirectionalGraphImpact(graph, root, options) {
-    const direction = options.direction;
-    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-    const limit = options.limit ?? Number.POSITIVE_INFINITY;
-    const { fingerprint: cursorFingerprint, after } = resolveImpactCursor(root, options, direction, maxDepth);
-    const { adjacency, inspectedEdges } = buildImpactAdjacency(graph, direction, options.kinds);
-    const state = {
-        queue: [{ id: root, depth: 0 }],
-        seen: new Set([root]),
-        parents: new Map(),
-        affected: [],
-        cursorFound: after === undefined || after === root,
-    };
-    let visitedNodes = 0;
-    let truncated = false;
-    let rowLimitTruncated = false;
-    traversal: for (let index = 0; index < state.queue.length; index += 1) {
-        options.signal?.throwIfAborted();
-        const current = state.queue[index];
-        visitedNodes += 1;
-        const adjacent = [...adjacency.get(current.id)].sort();
-        if (current.depth >= maxDepth) {
-            if (adjacent.some((id) => !state.seen.has(id)))
-                truncated = true;
-            continue;
-        }
-        for (const id of adjacent) {
-            const outcome = visitImpactNeighbor(state, id, current, root, after, limit);
-            if (outcome === "truncate") {
-                truncated = true;
-                rowLimitTruncated = true;
-                break traversal;
-            }
-        }
-    }
-    if (!state.cursorFound) {
-        throw new TypeError(`Unknown impact cursor item: ${after}`);
-    }
-    return {
-        root,
-        affected: state.affected,
-        exact: true,
-        truncated,
-        ...(rowLimitTruncated
-            ? {
-                nextCursor: encodeQueryCursor(cursorFingerprint, state.affected.at(-1)?.id ?? root),
-            }
-            : {}),
-        cost: { visitedNodes, inspectedEdges },
-    };
-}
-/** Compute bounded impact rows and exact shortest explanation paths. */
-export function analyzeGraphImpact(graph, root, options = {}) {
-    const direction = options.direction ?? "outgoing";
-    if (direction !== "both") {
-        return analyzeUnidirectionalGraphImpact(graph, root, {
-            ...options,
-            direction,
-        });
-    }
-    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-    const limit = options.limit ?? Number.POSITIVE_INFINITY;
-    const { fingerprint, after } = resolveImpactCursor(root, options, direction, maxDepth);
-    return analyzeBidirectionalGraphImpact(graph, root, options, after, limit, fingerprint);
-}
-/** Analyze weak/strong components, isolates, and exact unique-neighbor hubs. */
-export 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 = 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" },
-    };
-}
-/** Compare two immutable relationship snapshots by full normalized edge value. */
-export 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,
-    };
-}
+!(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]="b3394526-5a20-5881-9a03-411ada32bd49")}catch(e2){}})();import{createQueryFingerprint,decodeQueryCursor,encodeQueryCursor}from"./pagination.js";import{createRelationshipKindRegistry}from"./relationships.js";function visitImpactNeighbor(state,id,parent,root,after,limit){if(state.seen.has(id))return"skip";if(state.cursorFound&&state.affected.length>=limit)return"truncate";state.seen.add(id);state.parents.set(id,parent.id);const depth=parent.depth+1;state.queue.push({id,depth});if(!state.cursorFound){state.cursorFound=id===after;return"skip"}state.affected.push({id,distance:depth,path:reconstructImpactPath(root,id,state.parents)});return"continue"}function resolveImpactCursor(root,options,direction,maxDepth){const fingerprint=createQueryFingerprint("graph impact",{root,direction,kinds:[...options.kinds??[]].sort(),max_depth:Number.isFinite(maxDepth)?maxDepth:"unbounded"});return{fingerprint,after:options.after===void 0?void 0:decodeQueryCursor(options.after,fingerprint)}}function appendNeighbor(adjacency,source,target){adjacency.get(source).add(target)}function createAdjacency(nodes){return new Map(nodes.map(node=>[node,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=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=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=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 buildImpactAdjacency(graph,direction,kinds){const adjacency=createAdjacency(graph.nodes());const selectedKinds=kinds===void 0?void 0:new Set(kinds.map(kind=>graph.registry().require(kind).kind));const edges=graph.edges();for(const edge of edges){const definition=graph.registry().require(edge.kind);if(selectedKinds!==void 0&&!selectedKinds.has(edge.kind)&&(definition.inverse===void 0||!selectedKinds.has(definition.inverse))){continue}appendNeighbor(adjacency,direction==="incoming"?edge.target:edge.source,direction==="incoming"?edge.source:edge.target)}return{adjacency,inspectedEdges:edges.length}}function analyzeBidirectionalGraphImpact(graph,root,options,after,limit,cursorFingerprint){const incoming=analyzeGraphImpact(graph,root,{...options,after:void 0,direction:"incoming",limit:void 0});const outgoing=analyzeGraphImpact(graph,root,{...options,after:void 0,direction:"outgoing",limit:void 0});const rows=new Map;const candidates=[...incoming.affected,...outgoing.affected].sort((left,right)=>left.distance-right.distance||left.id.localeCompare(right.id)||left.path.join("\0").localeCompare(right.path.join("\0")));for(const row of candidates){if(!rows.has(row.id)){rows.set(row.id,row)}}const ordered=[...rows.values()].sort((left,right)=>left.distance-right.distance||left.id.localeCompare(right.id));const afterIndex=after===void 0||after===root?-1:ordered.findIndex(row=>row.id===after);if(after!==void 0&&after!==root&&afterIndex<0){throw new TypeError(`Unknown impact cursor item: ${after}`)}const affected=ordered.slice(afterIndex+1,afterIndex+1+limit);const rowLimitTruncated=afterIndex+1+affected.length<ordered.length;return{root,affected,exact:true,truncated:incoming.truncated||outgoing.truncated||rowLimitTruncated,...rowLimitTruncated?{nextCursor:encodeQueryCursor(cursorFingerprint,affected.at(-1)?.id??root)}:{},cost:{visitedNodes:incoming.cost.visitedNodes+outgoing.cost.visitedNodes,inspectedEdges:incoming.cost.inspectedEdges+outgoing.cost.inspectedEdges}}}function analyzeUnidirectionalGraphImpact(graph,root,options){const direction=options.direction;const maxDepth=options.maxDepth??Number.POSITIVE_INFINITY;const limit=options.limit??Number.POSITIVE_INFINITY;const{fingerprint:cursorFingerprint,after}=resolveImpactCursor(root,options,direction,maxDepth);const{adjacency,inspectedEdges}=buildImpactAdjacency(graph,direction,options.kinds);const state={queue:[{id:root,depth:0}],seen:new Set([root]),parents:new Map,affected:[],cursorFound:after===void 0||after===root};let visitedNodes=0;let truncated=false;let rowLimitTruncated=false;traversal:for(let index=0;index<state.queue.length;index+=1){options.signal?.throwIfAborted();const current=state.queue[index];visitedNodes+=1;const adjacent=[...adjacency.get(current.id)].sort();if(current.depth>=maxDepth){if(adjacent.some(id=>!state.seen.has(id)))truncated=true;continue}for(const id of adjacent){const outcome=visitImpactNeighbor(state,id,current,root,after,limit);if(outcome==="truncate"){truncated=true;rowLimitTruncated=true;break traversal}}}if(!state.cursorFound){throw new TypeError(`Unknown impact cursor item: ${after}`)}return{root,affected:state.affected,exact:true,truncated,...rowLimitTruncated?{nextCursor:encodeQueryCursor(cursorFingerprint,state.affected.at(-1)?.id??root)}:{},cost:{visitedNodes,inspectedEdges}}}function analyzeGraphImpact(graph,root,options={}){const direction=options.direction??"outgoing";if(direction!=="both"){return analyzeUnidirectionalGraphImpact(graph,root,{...options,direction})}const maxDepth=options.maxDepth??Number.POSITIVE_INFINITY;const limit=options.limit??Number.POSITIVE_INFINITY;const{fingerprint,after}=resolveImpactCursor(root,options,direction,maxDepth);return analyzeBidirectionalGraphImpact(graph,root,options,after,limit,fingerprint)}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=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{analyzeGraphImpact,analyzeKnowledgeGraph,analyzeRelationshipExecution,compareRelationshipSnapshots};
 //# sourceMappingURL=relationship-analytics.js.map
-//# debugId=3167c288-0bcc-5a66-8aa0-ca5876ed7d36