@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/graph/analytics.js

@@ -1,475 +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]="24898402-1568-5b05-9072-f89dd91f25a6")}catch(e){}}();
-import { hierarchyParentEndpoint, orderingPredecessorEndpoint, } from "./traversal.js";
-/** Default label-propagation sweeps before reporting non-convergence. */
-const DEFAULT_MAX_ITERATIONS = 16;
-/** Default minimum member count for a reported community. */
-const DEFAULT_MIN_COMMUNITY_SIZE = 2;
-/** Default witness-path depth searched per candidate redundant edge. */
-const DEFAULT_REDUNDANCY_MAX_DEPTH = 8;
-/** Require a positive integer for one analytics bound. */
-function assertPositiveBound(name, value) {
-    if (!Number.isInteger(value) || value < 1)
-        throw new TypeError(`Invalid ${name} bound: ${String(value)}`);
-}
-/**
- * Invoke `visit` once per canonical-kind-matched edge, skipping self-loops.
- * Kind filters resolve to canonical spelling and match either the requested
- * kind or its inverse so directed families are selected by either spelling. The
- * resolved definition is passed alongside the edge so callers can distinguish
- * directed and undirected families. This is the single edge-selection primitive
- * shared by community, centrality, cut-structure, and degree builders.
- */
-export function forEachMatchedRelationshipEdge(graph, kinds, visit) {
-    const registry = graph.registry();
-    const wanted = kinds === undefined
-        ? undefined
-        : new Set(kinds.map((kind) => registry.require(kind).kind));
-    for (const edge of graph.edges()) {
-        if (edge.source === edge.target)
-            continue;
-        const definition = registry.require(edge.kind);
-        if (wanted !== undefined &&
-            !(wanted.has(definition.kind) ||
-                (definition.inverse !== undefined && wanted.has(definition.inverse))))
-            continue;
-        visit(edge, definition);
-    }
-}
-/** Build the deterministic undirected multiset adjacency restricted to canonicalized kinds. */
-function buildUndirectedAdjacency(graph, kinds) {
-    const adjacency = new Map();
-    forEachMatchedRelationshipEdge(graph, kinds, (edge) => {
-        appendAdjacency(adjacency, edge.source, edge.target);
-        appendAdjacency(adjacency, edge.target, edge.source);
-    });
-    for (const neighbors of adjacency.values())
-        neighbors.sort();
-    return adjacency;
-}
-/** Append one neighbor to a node's adjacency list, creating the list on demand. */
-function appendAdjacency(adjacency, from, to) {
-    const neighbors = adjacency.get(from);
-    if (neighbors === undefined)
-        adjacency.set(from, [to]);
-    else
-        neighbors.push(to);
-}
-/** Adopt the most frequent neighbor label with lexicographic tie-breaking. */
-function dominantNeighborLabel(neighbors, labels) {
-    const counts = new Map();
-    for (const neighbor of neighbors) {
-        const label = labels.get(neighbor);
-        counts.set(label, (counts.get(label) ?? 0) + 1);
-    }
-    let best;
-    let bestCount = 0;
-    for (const [label, count] of counts) {
-        if (count > bestCount || (count === bestCount && label < best)) {
-            best = label;
-            bestCount = count;
-        }
-    }
-    return best;
-}
-/** Group stabilized labels into sorted communities meeting the size floor. */
-function collectCommunities(labels, minSize) {
-    const groups = new Map();
-    for (const [id, label] of labels) {
-        const members = groups.get(label);
-        if (members === undefined)
-            groups.set(label, [id]);
-        else
-            members.push(id);
-    }
-    const communities = [];
-    for (const members of groups.values()) {
-        if (members.length < minSize)
-            continue;
-        members.sort();
-        communities.push({
-            representative: members[0],
-            size: members.length,
-            members,
-        });
-    }
-    return communities.sort((left, right) => right.size - left.size ||
-        left.representative.localeCompare(right.representative));
-}
-/**
- * Detect communities with deterministic asynchronous label propagation: nodes
- * are swept in sorted order, each adopting the most frequent label among its
- * neighbors with lexicographic tie-breaking, until labels stabilize or the
- * iteration bound stops the sweep. Adjacency is undirected — every
- * participating edge connects both endpoints symmetrically and parallel edges
- * weight their neighbor. `meta.truncated` reports non-convergence.
- */
-export function detectRelationshipCommunities(graph, options = {}) {
-    const maxIterations = options.maxIterations ?? DEFAULT_MAX_ITERATIONS;
-    const minSize = options.minSize ?? DEFAULT_MIN_COMMUNITY_SIZE;
-    assertPositiveBound("maxIterations", maxIterations);
-    assertPositiveBound("minSize", minSize);
-    const adjacency = buildUndirectedAdjacency(graph, options.kinds);
-    const nodes = graph.nodes();
-    const labels = new Map(nodes.map((id) => [id, id]));
-    let iterations = 0;
-    let converged = false;
-    let visitedNodes = 0;
-    let inspectedEdges = 0;
-    while (iterations < maxIterations && !converged) {
-        options.signal?.throwIfAborted();
-        iterations += 1;
-        converged = true;
-        for (const id of nodes) {
-            visitedNodes += 1;
-            const neighbors = adjacency.get(id);
-            if (neighbors === undefined)
-                continue;
-            inspectedEdges += neighbors.length;
-            const dominant = dominantNeighborLabel(neighbors, labels);
-            if (dominant !== labels.get(id)) {
-                labels.set(id, dominant);
-                converged = false;
-            }
-        }
-    }
-    return {
-        value: {
-            communities: collectCommunities(labels, minSize),
-            iterations,
-            converged,
-        },
-        meta: { visitedNodes, inspectedEdges, truncated: !converged },
-    };
-}
-/** Decide whether a kind carries transitive semantics eligible for redundancy and duplicate analysis. */
-export function isTransitiveKind(definition) {
-    return (definition.direction === "directed" &&
-        (definition.ordering || definition.hierarchy));
-}
-/** Family grouping key joining a directed kind with its inverse spelling. */
-export function transitiveFamilyKey(definition) {
-    return definition.inverse !== undefined &&
-        definition.inverse < definition.kind
-        ? definition.inverse
-        : definition.kind;
-}
-/** Orient one transitive edge into its semantic forward direction. */
-export function orientTransitiveEdge(edge, definition) {
-    // Hierarchy families flow child -> parent; ordering families flow
-    // predecessor -> successor, so inverse spellings land in one relation.
-    const head = definition.hierarchy
-        ? hierarchyParentEndpoint(edge, definition)
-        : edge.source === orderingPredecessorEndpoint(edge, definition)
-            ? edge.target
-            : edge.source;
-    return head === edge.target
-        ? { from: edge.source, to: edge.target }
-        : { from: edge.target, to: edge.source };
-}
-/** Resolve explicit redundancy kind filters into their family keys. */
-function resolveRedundancyFamilies(graph, kinds) {
-    if (kinds === undefined)
-        return undefined;
-    const registry = graph.registry();
-    const families = new Set();
-    for (const kind of kinds) {
-        const definition = registry.require(kind);
-        if (!isTransitiveKind(definition))
-            throw new TypeError(`Relationship kind ${definition.kind} is not a directed ordering or hierarchy kind`);
-        families.add(transitiveFamilyKey(definition));
-    }
-    return families;
-}
-/** Group eligible stored edges into oriented per-family scan structures. */
-function collectTransitiveFamilies(graph, wanted) {
-    const registry = graph.registry();
-    const families = new Map();
-    for (const edge of graph.edges()) {
-        const definition = registry.require(edge.kind);
-        if (!isTransitiveKind(definition))
-            continue;
-        const key = transitiveFamilyKey(definition);
-        if (wanted !== undefined && !wanted.has(key))
-            continue;
-        const oriented = orientTransitiveEdge(edge, definition);
-        if (oriented.from === oriented.to)
-            continue;
-        let family = families.get(key);
-        if (family === undefined) {
-            family = { adjacency: new Map(), records: [] };
-            families.set(key, family);
-        }
-        const targets = family.adjacency.get(oriented.from);
-        if (targets === undefined)
-            family.adjacency.set(oriented.from, new Set([oriented.to]));
-        else
-            targets.add(oriented.to);
-        family.records.push({ ...oriented, edge });
-    }
-    return families;
-}
-/** Freeze one family's adjacency sets into deterministic sorted lists. */
-function sortedFamilyAdjacency(family) {
-    const sorted = new Map();
-    for (const [from, targets] of family.adjacency)
-        sorted.set(from, [...targets].sort());
-    return sorted;
-}
-/** Rebuild the witness node path from breadth-first parent pointers. */
-function reconstructWitness(parents, from, tail, head) {
-    const witness = [head];
-    for (let node = tail; node !== from; node = parents.get(node))
-        witness.push(node);
-    witness.push(from);
-    return witness.reverse();
-}
-/** Expand one witness frontier node; return the completed witness when the head is reached. */
-function expandWitnessFrontier(adjacency, record, current, parents, queue, cost) {
-    for (const next of adjacency.get(current.id) ?? []) {
-        cost.inspectedEdges += 1;
-        // Skip the direct edge under test; deeper hops may still reach the head.
-        if (current.depth === 0 && next === record.to)
-            continue;
-        if (parents.has(next))
-            continue;
-        parents.set(next, current.id);
-        if (next === record.to)
-            return reconstructWitness(parents, record.from, current.id, next);
-        queue.push({ id: next, depth: current.depth + 1 });
-    }
-    return undefined;
-}
-/** Search one bounded same-family witness path that implies a direct edge. */
-function findWitnessPath(adjacency, record, maxDepth, cost) {
-    const parents = new Map([[record.from, record.from]]);
-    const queue = [{ id: record.from, depth: 0 }];
-    for (let index = 0; index < queue.length; index += 1) {
-        const current = queue[index];
-        cost.visitedNodes += 1;
-        if (current.depth >= maxDepth)
-            continue;
-        const witness = expandWitnessFrontier(adjacency, record, current, parents, queue, cost);
-        if (witness !== undefined)
-            return witness;
-    }
-    return undefined;
-}
-/**
- * Find stored edges implied by a longer path of the same semantic family —
- * the transitive-reduction view of ordering and hierarchy relations. Each
- * family joins a directed kind with its inverse spelling in semantic
- * orientation, so `blocked_by` and `blocks` witness each other. The witness
- * search is breadth-first, shortest and lexicographic first, bounded by
- * `maxDepth` per edge; `meta.truncated` reports only the `limit` bound.
- */
-export function findRedundantRelationshipEdges(graph, options = {}) {
-    const maxDepth = options.maxDepth ?? DEFAULT_REDUNDANCY_MAX_DEPTH;
-    assertPositiveBound("maxDepth", maxDepth);
-    if (options.limit !== undefined)
-        assertPositiveBound("limit", options.limit);
-    const limit = options.limit ?? Number.POSITIVE_INFINITY;
-    const wanted = resolveRedundancyFamilies(graph, options.kinds);
-    const families = collectTransitiveFamilies(graph, wanted);
-    const value = [];
-    const cost = { visitedNodes: 0, inspectedEdges: 0 };
-    let truncated = false;
-    scan: for (const key of [...families.keys()].sort()) {
-        const family = families.get(key);
-        const adjacency = sortedFamilyAdjacency(family);
-        for (const record of family.records) {
-            options.signal?.throwIfAborted();
-            const witness = findWitnessPath(adjacency, record, maxDepth, cost);
-            if (witness === undefined)
-                continue;
-            if (value.length >= limit) {
-                truncated = true;
-                break scan;
-            }
-            value.push({ edge: record.edge, witness });
-        }
-    }
-    return {
-        value,
-        meta: {
-            visitedNodes: cost.visitedNodes,
-            inspectedEdges: cost.inspectedEdges,
-            truncated,
-        },
-    };
-}
-/** Expand one node's neighbor rows into successors, predecessors, and frontier work. */
-function expandReachableNode(id, depth, rows, maxDepth, state) {
-    const nextSet = new Set();
-    const nexts = [];
-    for (const row of rows) {
-        if (row.id === id || nextSet.has(row.id))
-            continue;
-        if (!state.seen.has(row.id)) {
-            // A depth-boundary node keeps its edges to already-indexed nodes but
-            // may not discover new ones; excluded discoveries mark truncation.
-            if (depth >= maxDepth) {
-                state.truncated = true;
-                continue;
-            }
-            state.seen.add(row.id);
-            state.queue.push({ id: row.id, depth: depth + 1 });
-        }
-        nextSet.add(row.id);
-        nexts.push(row.id);
-        let incoming = state.predecessors.get(row.id);
-        if (incoming === undefined) {
-            incoming = new Set();
-            state.predecessors.set(row.id, incoming);
-        }
-        incoming.add(id);
-    }
-    return nexts;
-}
-/** Index the bounded reachable subgraph used by dominator analysis. */
-function indexReachableSubgraph(graph, root, options) {
-    const direction = options.direction ?? "outgoing";
-    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-    const order = [];
-    const successors = new Map();
-    const state = {
-        seen: new Set([root]),
-        queue: [{ id: root, depth: 0 }],
-        predecessors: new Map(),
-        truncated: false,
-    };
-    let inspectedEdges = 0;
-    for (let index = 0; index < state.queue.length; index += 1) {
-        options.signal?.throwIfAborted();
-        const { id, depth } = state.queue[index];
-        order.push(id);
-        const rows = graph.neighborEdges(id, {
-            direction,
-            ...(options.kinds === undefined ? {} : { kinds: options.kinds }),
-        });
-        inspectedEdges += rows.meta.inspectedEdges;
-        successors.set(id, expandReachableNode(id, depth, rows.value, maxDepth, state));
-    }
-    return {
-        order,
-        successors,
-        predecessors: state.predecessors,
-        inspectedEdges,
-        truncated: state.truncated,
-    };
-}
-/** Compute the deterministic reverse postorder of one reachable subgraph. */
-function reversePostorder(subgraph, root) {
-    const postorder = [];
-    const visited = new Set([root]);
-    const stack = [{ id: root, index: 0 }];
-    while (stack.length > 0) {
-        const frame = stack.at(-1);
-        const nexts = subgraph.successors.get(frame.id);
-        if (frame.index < nexts.length) {
-            const next = nexts[frame.index];
-            frame.index += 1;
-            if (!visited.has(next)) {
-                visited.add(next);
-                stack.push({ id: next, index: 0 });
-            }
-        }
-        else {
-            postorder.push(frame.id);
-            stack.pop();
-        }
-    }
-    return postorder.reverse();
-}
-/** Walk two dominator-tree fingers to their common ancestor by reverse-postorder number. */
-function intersectDominators(left, right, idom, ordinal) {
-    let first = left;
-    let second = right;
-    while (first !== second) {
-        while (ordinal.get(first) > ordinal.get(second))
-            first = idom.get(first);
-        while (ordinal.get(second) > ordinal.get(first))
-            second = idom.get(second);
-    }
-    return first;
-}
-/** Fold one node's processed predecessors into its dominator candidate. */
-function dominatorCandidate(predecessors, idom, ordinal) {
-    let candidate;
-    for (const pred of [...predecessors].sort()) {
-        if (!idom.has(pred))
-            continue;
-        candidate =
-            candidate === undefined
-                ? pred
-                : intersectDominators(candidate, pred, idom, ordinal);
-    }
-    return candidate;
-}
-/** Run the Cooper–Harvey–Kennedy fixed-point over one reverse postorder. */
-function solveImmediateDominators(subgraph, root, order, ordinal, signal) {
-    const idom = new Map([[root, root]]);
-    let changed = true;
-    while (changed) {
-        changed = false;
-        for (const id of order) {
-            signal?.throwIfAborted();
-            if (id === root)
-                continue;
-            // Every non-root node in the order was discovered through at least one
-            // predecessor, so the set is always present.
-            const candidate = dominatorCandidate(subgraph.predecessors.get(id), idom, ordinal);
-            if (candidate !== undefined && idom.get(id) !== candidate) {
-                idom.set(id, candidate);
-                changed = true;
-            }
-        }
-    }
-    return idom;
-}
-/**
- * Compute immediate dominators and gating weights over one node's reachable
- * subgraph using the Cooper–Harvey–Kennedy fixed-point. A node dominates the
- * work that every path from the root must pass through it to reach, so rows
- * with a positive `dominatedCount` are the structural bottlenecks of the
- * root's blast radius. Rows sort by gating weight, then id; `meta.truncated`
- * reports when the `maxDepth` bound excluded reachable nodes.
- */
-export function computeRelationshipDominators(graph, root, options = {}) {
-    if (!graph.hasNode(root))
-        throw new TypeError(`Relationship node not found: ${root}`);
-    if (options.maxDepth !== undefined &&
-        (!Number.isInteger(options.maxDepth) || options.maxDepth < 0))
-        throw new TypeError(`Invalid maxDepth bound: ${String(options.maxDepth)}`);
-    const subgraph = indexReachableSubgraph(graph, root, options);
-    const order = reversePostorder(subgraph, root);
-    const ordinal = new Map(order.map((id, index) => [id, index]));
-    const idom = solveImmediateDominators(subgraph, root, order, ordinal, options.signal);
-    const subtreeSizes = new Map(order.map((id) => [id, 1]));
-    for (let index = order.length - 1; index >= 0; index -= 1) {
-        const id = order[index];
-        if (id === root)
-            continue;
-        const parent = idom.get(id);
-        subtreeSizes.set(parent, subtreeSizes.get(parent) + subtreeSizes.get(id));
-    }
-    const rows = order
-        .filter((id) => id !== root)
-        .map((id) => ({
-        id,
-        idom: idom.get(id),
-        dominatedCount: subtreeSizes.get(id) - 1,
-    }))
-        .sort((left, right) => right.dominatedCount - left.dominatedCount ||
-        left.id.localeCompare(right.id));
-    return {
-        value: { root, reachableCount: subgraph.order.length, rows },
-        meta: {
-            visitedNodes: subgraph.order.length,
-            inspectedEdges: subgraph.inspectedEdges,
-            truncated: subgraph.truncated,
-        },
-    };
-}
+!(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]="2ea07760-bca8-579d-9b3a-78051461485a")}catch(e2){}})();import{hierarchyParentEndpoint,orderingPredecessorEndpoint}from"./traversal.js";const DEFAULT_MAX_ITERATIONS=16;const DEFAULT_MIN_COMMUNITY_SIZE=2;const DEFAULT_REDUNDANCY_MAX_DEPTH=8;function assertPositiveBound(name,value){if(!Number.isInteger(value)||value<1)throw new TypeError(`Invalid ${name} bound: ${String(value)}`)}function forEachMatchedRelationshipEdge(graph,kinds,visit){const registry=graph.registry();const wanted=kinds===void 0?void 0:new Set(kinds.map(kind=>registry.require(kind).kind));for(const edge of graph.edges()){if(edge.source===edge.target)continue;const definition=registry.require(edge.kind);if(wanted!==void 0&&!(wanted.has(definition.kind)||definition.inverse!==void 0&&wanted.has(definition.inverse)))continue;visit(edge,definition)}}function buildUndirectedAdjacency(graph,kinds){const adjacency=new Map;forEachMatchedRelationshipEdge(graph,kinds,edge=>{appendAdjacency(adjacency,edge.source,edge.target);appendAdjacency(adjacency,edge.target,edge.source)});for(const neighbors of adjacency.values())neighbors.sort();return adjacency}function appendAdjacency(adjacency,from,to){const neighbors=adjacency.get(from);if(neighbors===void 0)adjacency.set(from,[to]);else neighbors.push(to)}function dominantNeighborLabel(neighbors,labels){const counts=new Map;for(const neighbor of neighbors){const label=labels.get(neighbor);counts.set(label,(counts.get(label)??0)+1)}let best;let bestCount=0;for(const[label,count]of counts){if(count>bestCount||count===bestCount&&label<best){best=label;bestCount=count}}return best}function collectCommunities(labels,minSize){const groups=new Map;for(const[id,label]of labels){const members=groups.get(label);if(members===void 0)groups.set(label,[id]);else members.push(id)}const communities=[];for(const members of groups.values()){if(members.length<minSize)continue;members.sort();communities.push({representative:members[0],size:members.length,members})}return communities.sort((left,right)=>right.size-left.size||left.representative.localeCompare(right.representative))}function detectRelationshipCommunities(graph,options={}){const maxIterations=options.maxIterations??DEFAULT_MAX_ITERATIONS;const minSize=options.minSize??DEFAULT_MIN_COMMUNITY_SIZE;assertPositiveBound("maxIterations",maxIterations);assertPositiveBound("minSize",minSize);const adjacency=buildUndirectedAdjacency(graph,options.kinds);const nodes=graph.nodes();const labels=new Map(nodes.map(id=>[id,id]));let iterations=0;let converged=false;let visitedNodes=0;let inspectedEdges=0;while(iterations<maxIterations&&!converged){options.signal?.throwIfAborted();iterations+=1;converged=true;for(const id of nodes){visitedNodes+=1;const neighbors=adjacency.get(id);if(neighbors===void 0)continue;inspectedEdges+=neighbors.length;const dominant=dominantNeighborLabel(neighbors,labels);if(dominant!==labels.get(id)){labels.set(id,dominant);converged=false}}}return{value:{communities:collectCommunities(labels,minSize),iterations,converged},meta:{visitedNodes,inspectedEdges,truncated:!converged}}}function isTransitiveKind(definition){return definition.direction==="directed"&&(definition.ordering||definition.hierarchy)}function transitiveFamilyKey(definition){return definition.inverse!==void 0&&definition.inverse<definition.kind?definition.inverse:definition.kind}function orientTransitiveEdge(edge,definition){const head=definition.hierarchy?hierarchyParentEndpoint(edge,definition):edge.source===orderingPredecessorEndpoint(edge,definition)?edge.target:edge.source;return head===edge.target?{from:edge.source,to:edge.target}:{from:edge.target,to:edge.source}}function resolveRedundancyFamilies(graph,kinds){if(kinds===void 0)return void 0;const registry=graph.registry();const families=new Set;for(const kind of kinds){const definition=registry.require(kind);if(!isTransitiveKind(definition))throw new TypeError(`Relationship kind ${definition.kind} is not a directed ordering or hierarchy kind`);families.add(transitiveFamilyKey(definition))}return families}function collectTransitiveFamilies(graph,wanted){const registry=graph.registry();const families=new Map;for(const edge of graph.edges()){const definition=registry.require(edge.kind);if(!isTransitiveKind(definition))continue;const key=transitiveFamilyKey(definition);if(wanted!==void 0&&!wanted.has(key))continue;const oriented=orientTransitiveEdge(edge,definition);if(oriented.from===oriented.to)continue;let family=families.get(key);if(family===void 0){family={adjacency:new Map,records:[]};families.set(key,family)}const targets=family.adjacency.get(oriented.from);if(targets===void 0)family.adjacency.set(oriented.from,new Set([oriented.to]));else targets.add(oriented.to);family.records.push({...oriented,edge})}return families}function sortedFamilyAdjacency(family){const sorted=new Map;for(const[from,targets]of family.adjacency)sorted.set(from,[...targets].sort());return sorted}function reconstructWitness(parents,from,tail,head){const witness=[head];for(let node=tail;node!==from;node=parents.get(node))witness.push(node);witness.push(from);return witness.reverse()}function expandWitnessFrontier(adjacency,record,current,parents,queue,cost){for(const next of adjacency.get(current.id)??[]){cost.inspectedEdges+=1;if(current.depth===0&&next===record.to)continue;if(parents.has(next))continue;parents.set(next,current.id);if(next===record.to)return reconstructWitness(parents,record.from,current.id,next);queue.push({id:next,depth:current.depth+1})}return void 0}function findWitnessPath(adjacency,record,maxDepth,cost){const parents=new Map([[record.from,record.from]]);const queue=[{id:record.from,depth:0}];for(let index=0;index<queue.length;index+=1){const current=queue[index];cost.visitedNodes+=1;if(current.depth>=maxDepth)continue;const witness=expandWitnessFrontier(adjacency,record,current,parents,queue,cost);if(witness!==void 0)return witness}return void 0}function findRedundantRelationshipEdges(graph,options={}){const maxDepth=options.maxDepth??DEFAULT_REDUNDANCY_MAX_DEPTH;assertPositiveBound("maxDepth",maxDepth);if(options.limit!==void 0)assertPositiveBound("limit",options.limit);const limit=options.limit??Number.POSITIVE_INFINITY;const wanted=resolveRedundancyFamilies(graph,options.kinds);const families=collectTransitiveFamilies(graph,wanted);const value=[];const cost={visitedNodes:0,inspectedEdges:0};let truncated=false;scan:for(const key of[...families.keys()].sort()){const family=families.get(key);const adjacency=sortedFamilyAdjacency(family);for(const record of family.records){options.signal?.throwIfAborted();const witness=findWitnessPath(adjacency,record,maxDepth,cost);if(witness===void 0)continue;if(value.length>=limit){truncated=true;break scan}value.push({edge:record.edge,witness})}}return{value,meta:{visitedNodes:cost.visitedNodes,inspectedEdges:cost.inspectedEdges,truncated}}}function expandReachableNode(id,depth,rows,maxDepth,state){const nextSet=new Set;const nexts=[];for(const row of rows){if(row.id===id||nextSet.has(row.id))continue;if(!state.seen.has(row.id)){if(depth>=maxDepth){state.truncated=true;continue}state.seen.add(row.id);state.queue.push({id:row.id,depth:depth+1})}nextSet.add(row.id);nexts.push(row.id);let incoming=state.predecessors.get(row.id);if(incoming===void 0){incoming=new Set;state.predecessors.set(row.id,incoming)}incoming.add(id)}return nexts}function indexReachableSubgraph(graph,root,options){const direction=options.direction??"outgoing";const maxDepth=options.maxDepth??Number.POSITIVE_INFINITY;const order=[];const successors=new Map;const state={seen:new Set([root]),queue:[{id:root,depth:0}],predecessors:new Map,truncated:false};let inspectedEdges=0;for(let index=0;index<state.queue.length;index+=1){options.signal?.throwIfAborted();const{id,depth}=state.queue[index];order.push(id);const rows=graph.neighborEdges(id,{direction,...options.kinds===void 0?{}:{kinds:options.kinds}});inspectedEdges+=rows.meta.inspectedEdges;successors.set(id,expandReachableNode(id,depth,rows.value,maxDepth,state))}return{order,successors,predecessors:state.predecessors,inspectedEdges,truncated:state.truncated}}function reversePostorder(subgraph,root){const postorder=[];const visited=new Set([root]);const stack=[{id:root,index:0}];while(stack.length>0){const frame=stack.at(-1);const nexts=subgraph.successors.get(frame.id);if(frame.index<nexts.length){const next=nexts[frame.index];frame.index+=1;if(!visited.has(next)){visited.add(next);stack.push({id:next,index:0})}}else{postorder.push(frame.id);stack.pop()}}return postorder.reverse()}function intersectDominators(left,right,idom,ordinal){let first=left;let second=right;while(first!==second){while(ordinal.get(first)>ordinal.get(second))first=idom.get(first);while(ordinal.get(second)>ordinal.get(first))second=idom.get(second)}return first}function dominatorCandidate(predecessors,idom,ordinal){let candidate;for(const pred of[...predecessors].sort()){if(!idom.has(pred))continue;candidate=candidate===void 0?pred:intersectDominators(candidate,pred,idom,ordinal)}return candidate}function solveImmediateDominators(subgraph,root,order,ordinal,signal){const idom=new Map([[root,root]]);let changed=true;while(changed){changed=false;for(const id of order){signal?.throwIfAborted();if(id===root)continue;const candidate=dominatorCandidate(subgraph.predecessors.get(id),idom,ordinal);if(candidate!==void 0&&idom.get(id)!==candidate){idom.set(id,candidate);changed=true}}}return idom}function computeRelationshipDominators(graph,root,options={}){if(!graph.hasNode(root))throw new TypeError(`Relationship node not found: ${root}`);if(options.maxDepth!==void 0&&(!Number.isInteger(options.maxDepth)||options.maxDepth<0))throw new TypeError(`Invalid maxDepth bound: ${String(options.maxDepth)}`);const subgraph=indexReachableSubgraph(graph,root,options);const order=reversePostorder(subgraph,root);const ordinal=new Map(order.map((id,index)=>[id,index]));const idom=solveImmediateDominators(subgraph,root,order,ordinal,options.signal);const subtreeSizes=new Map(order.map(id=>[id,1]));for(let index=order.length-1;index>=0;index-=1){const id=order[index];if(id===root)continue;const parent=idom.get(id);subtreeSizes.set(parent,subtreeSizes.get(parent)+subtreeSizes.get(id))}const rows=order.filter(id=>id!==root).map(id=>({id,idom:idom.get(id),dominatedCount:subtreeSizes.get(id)-1})).sort((left,right)=>right.dominatedCount-left.dominatedCount||left.id.localeCompare(right.id));return{value:{root,reachableCount:subgraph.order.length,rows},meta:{visitedNodes:subgraph.order.length,inspectedEdges:subgraph.inspectedEdges,truncated:subgraph.truncated}}}export{computeRelationshipDominators,detectRelationshipCommunities,findRedundantRelationshipEdges,forEachMatchedRelationshipEdge,isTransitiveKind,orientTransitiveEdge,transitiveFamilyKey};
 //# sourceMappingURL=analytics.js.map
-//# debugId=24898402-1568-5b05-9072-f89dd91f25a6