@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/graph/scheduling.js

@@ -1,125 +1,2 @@
-/**
- * @module sdk/graph/scheduling
- *
- * Critical Path Method (CPM) scheduling over the order-bearing relationship
- * DAG. The forward pass — topological order, earliest-start distances, the
- * longest deterministic path, and genuine-cycle isolation — is reused from the
- * exact execution analysis; this module adds the backward pass that derives
- * each task's latest start, latest finish, and total float (slack), then
- * classifies zero-slack tasks as critical. Durations are unit-weighted so the
- * schedule is deterministic and metadata-independent: slack counts how many
- * whole prerequisite hops a task can drift without extending the makespan.
- * Only tasks with a well-defined earliest start are scheduled: nodes with no
- * order-bearing edge, genuine ordering cycles, and any task transitively gated
- * by a cycle (whose earliest start is undefined) are all omitted from `rows`.
- * Genuine ordering cycles are additionally reported in `cycles`.
- */
-
-!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]="f155ac72-64eb-5316-b016-954abd48c0e7")}catch(e){}}();
-import { analyzeRelationshipExecution, } from "../relationship-analytics.js";
-import { orientOrderingEdge } from "./traversal.js";
-/**
- * Collect the execution-oriented forward adjacency and the set of tasks that
- * carry any order-bearing edge. Each ordering edge is oriented through the
- * registry's declared precedence so inverse spellings agree, and self-loops
- * (which the execution cycle analysis reports) never enter the adjacency.
- */
-function collectOrderingParticipation(graph) {
-    const registry = graph.registry();
-    const forward = new Map();
-    const participants = new Set();
-    for (const edge of graph.edges()) {
-        const definition = registry.require(edge.kind);
-        if (!definition.ordering)
-            continue;
-        const { predecessor, successor } = orientOrderingEdge(edge, definition);
-        participants.add(predecessor);
-        participants.add(successor);
-        if (predecessor === successor)
-            continue;
-        const targets = forward.get(predecessor);
-        if (targets === undefined)
-            forward.set(predecessor, new Set([successor]));
-        else
-            targets.add(successor);
-    }
-    return { forward, participants };
-}
-/** Resolve a task's latest finish from its acyclic successors, or the makespan when it has none. */
-function latestFinishFor(successors, acyclic, latestStart, makespan) {
-    if (successors === undefined)
-        return makespan;
-    let bound = makespan;
-    for (const successor of successors) {
-        if (!acyclic.has(successor))
-            continue;
-        bound = Math.min(bound, latestStart.get(successor));
-    }
-    return bound;
-}
-/** Build one scheduled row from the forward earliest-start depth and backward latest-start. */
-function scheduleRow(id, earliestStart, latestStart) {
-    const slack = latestStart - earliestStart;
-    return {
-        id,
-        earliestStart,
-        earliestFinish: earliestStart + 1,
-        latestStart,
-        latestFinish: latestStart + 1,
-        slack,
-        critical: slack === 0,
-    };
-}
-/** Run the backward CPM pass over the acyclic participants in reverse topological order. */
-function computeScheduleRows(topoParticipants, participation, depth, acyclic, makespan) {
-    const latestStart = new Map();
-    for (let index = topoParticipants.length - 1; index >= 0; index -= 1) {
-        const id = topoParticipants[index];
-        const finish = latestFinishFor(participation.forward.get(id), acyclic, latestStart, makespan);
-        latestStart.set(id, finish - 1);
-    }
-    return topoParticipants
-        .map((id) => scheduleRow(id, depth[id], latestStart.get(id)))
-        .sort((left, right) => left.slack - right.slack ||
-        left.earliestStart - right.earliestStart ||
-        left.id.localeCompare(right.id));
-}
-/**
- * Compute the deterministic critical-path schedule of the order-bearing
- * subgraph. Earliest-start distances and the critical path come from the exact
- * execution analysis; the backward pass then assigns each task the latest start
- * that preserves the makespan and reports total float as `slack`. Zero-slack
- * tasks are `critical`. Only tasks with a well-defined earliest start are
- * scheduled: tasks with no order-bearing edge, tasks on a genuine ordering
- * cycle, and tasks transitively gated by a cycle (excluded from Kahn's partial
- * order) are all omitted from `rows`; genuine cycles are reported in `cycles`.
- */
-export function analyzeRelationshipSchedule(graph, options = {}) {
-    options.signal?.throwIfAborted();
-    const execution = analyzeRelationshipExecution(graph, { registry: graph.registry() });
-    const participation = collectOrderingParticipation(graph);
-    const acyclic = new Set(execution.order);
-    const topoParticipants = execution.order.filter((id) => participation.participants.has(id));
-    const makespan = topoParticipants.reduce((peak, id) => Math.max(peak, execution.depth[id] + 1), 0);
-    const rows = computeScheduleRows(topoParticipants, participation, execution.depth, acyclic, makespan);
-    const scheduled = rows.length > 0;
-    return {
-        exact: true,
-        acyclic: execution.acyclic,
-        makespan,
-        scheduledCount: rows.length,
-        // A single-node execution "path" over a workspace with no order-bearing
-        // edge is not a real critical path, so report it only when work is scheduled.
-        criticalPath: scheduled ? execution.criticalPath : [],
-        criticalPathLength: scheduled ? execution.criticalPathLength : 0,
-        cycles: execution.cycles,
-        rows,
-        provenance: {
-            algorithm: "critical-path-method",
-            edgeFamily: "ordering",
-            weighting: "unit",
-        },
-    };
-}
+!(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]="1c9d9d0c-e989-568c-a49a-202f77e94806")}catch(e2){}})();import{analyzeRelationshipExecution}from"../relationship-analytics.js";import{orientOrderingEdge}from"./traversal.js";function collectOrderingParticipation(graph){const registry=graph.registry();const forward=new Map;const participants=new Set;for(const edge of graph.edges()){const definition=registry.require(edge.kind);if(!definition.ordering)continue;const{predecessor,successor}=orientOrderingEdge(edge,definition);participants.add(predecessor);participants.add(successor);if(predecessor===successor)continue;const targets=forward.get(predecessor);if(targets===void 0)forward.set(predecessor,new Set([successor]));else targets.add(successor)}return{forward,participants}}function latestFinishFor(successors,acyclic,latestStart,makespan){if(successors===void 0)return makespan;let bound=makespan;for(const successor of successors){if(!acyclic.has(successor))continue;bound=Math.min(bound,latestStart.get(successor))}return bound}function scheduleRow(id,earliestStart,latestStart){const slack=latestStart-earliestStart;return{id,earliestStart,earliestFinish:earliestStart+1,latestStart,latestFinish:latestStart+1,slack,critical:slack===0}}function computeScheduleRows(topoParticipants,participation,depth,acyclic,makespan){const latestStart=new Map;for(let index=topoParticipants.length-1;index>=0;index-=1){const id=topoParticipants[index];const finish=latestFinishFor(participation.forward.get(id),acyclic,latestStart,makespan);latestStart.set(id,finish-1)}return topoParticipants.map(id=>scheduleRow(id,depth[id],latestStart.get(id))).sort((left,right)=>left.slack-right.slack||left.earliestStart-right.earliestStart||left.id.localeCompare(right.id))}function analyzeRelationshipSchedule(graph,options={}){options.signal?.throwIfAborted();const execution=analyzeRelationshipExecution(graph,{registry:graph.registry()});const participation=collectOrderingParticipation(graph);const acyclic=new Set(execution.order);const topoParticipants=execution.order.filter(id=>participation.participants.has(id));const makespan=topoParticipants.reduce((peak,id)=>Math.max(peak,execution.depth[id]+1),0);const rows=computeScheduleRows(topoParticipants,participation,execution.depth,acyclic,makespan);const scheduled=rows.length>0;return{exact:true,acyclic:execution.acyclic,makespan,scheduledCount:rows.length,criticalPath:scheduled?execution.criticalPath:[],criticalPathLength:scheduled?execution.criticalPathLength:0,cycles:execution.cycles,rows,provenance:{algorithm:"critical-path-method",edgeFamily:"ordering",weighting:"unit"}}}export{analyzeRelationshipSchedule};
 //# sourceMappingURL=scheduling.js.map
-//# debugId=f155ac72-64eb-5316-b016-954abd48c0e7

package/dist/sdk/graph/traversal.js

@@ -1,285 +1,2 @@
-/** Default number of paths returned by bounded path enumeration. */
-
-!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]="ac2b3cd9-5a98-5fea-888c-e96de8cd593d")}catch(e){}}();
-const DEFAULT_MAX_PATHS = 5;
-/** Default expansion-safety bound for bounded path enumeration. */
-const DEFAULT_MAX_VISITED_PATHS = 10_000;
-/** Default depth bound applied to bounded path enumeration. */
-const DEFAULT_PATH_MAX_DEPTH = 8;
-/** Require a finite non-negative integer for one path-enumeration bound. */
-function assertPathBound(name, value) {
-    if (!Number.isFinite(value) || !Number.isInteger(value) || value < 0)
-        throw new TypeError(`Invalid path ${name} bound: ${String(value)}`);
-}
-/** Endpoint of a hierarchy edge that represents the structural parent. */
-export function hierarchyParentEndpoint(edge, definition) {
-    // Custom hierarchy kinds may omit the direction; the registry documents the
-    // source endpoint as the default parent.
-    return definition.hierarchyDirection === "target_parent"
-        ? edge.target
-        : edge.source;
-}
-/** Endpoint of an ordering edge that must finish first. */
-export function orderingPredecessorEndpoint(edge, definition) {
-    // Ordering kinds registered without explicit precedence default to
-    // source-before-target, matching the execution-analytics interpretation.
-    return (definition.precedence ?? "source_before_target") ===
-        "target_before_source"
-        ? edge.target
-        : edge.source;
-}
-/**
- * Orient one ordering edge into its execution direction — the predecessor that
- * must finish first and the successor it gates — honoring the kind's declared
- * precedence so inverse spellings (`blocked_by`/`blocks`) agree. This is the
- * single ordering-orientation primitive shared by scheduling and degree
- * analytics.
- */
-export function orientOrderingEdge(edge, definition) {
-    const predecessor = orderingPredecessorEndpoint(edge, definition);
-    return {
-        predecessor,
-        successor: predecessor === edge.source ? edge.target : edge.source,
-    };
-}
-/** Validate optional kind filters against one semantic edge family. */
-function resolveFamilyKinds(graph, kinds, family) {
-    if (kinds === undefined)
-        return undefined;
-    const registry = graph.registry();
-    const resolved = new Set();
-    for (const kind of kinds) {
-        const definition = registry.require(kind);
-        // Registry registration normalizes this optional compatibility field before
-        // definitions become queryable.
-        const traversal = definition.traversal;
-        if (traversal === "association")
-            throw new TypeError(`Relationship kind ${definition.kind} uses association traversal; use graph impact --direction both`);
-        if (traversal !== family && traversal !== "semantic") {
-            const redirect = traversal === "hierarchy"
-                ? "graph ancestors or graph descendants"
-                : "graph predecessors or graph successors";
-            throw new TypeError(`Relationship kind ${definition.kind} uses ${traversal} traversal; use ${redirect}`);
-        }
-        resolved.add(definition.kind);
-    }
-    return resolved;
-}
-/** Expand one node into its deterministic semantic neighbors. */
-function expandSemanticNeighbors(graph, nodeId, familyKinds, family, matches) {
-    const registry = graph.registry();
-    const rows = graph.neighborEdges(nodeId, {
-        direction: "both",
-        ...(familyKinds === undefined ? {} : { kinds: [...familyKinds] }),
-    });
-    const neighbors = [];
-    const seen = new Set();
-    for (const row of rows.value) {
-        const definition = registry.require(row.edge.kind);
-        if (familyKinds === undefined && !definition[family])
-            continue;
-        if (!matches(row, definition, nodeId))
-            continue;
-        if (seen.has(row.id))
-            continue;
-        seen.add(row.id);
-        neighbors.push(row.id);
-    }
-    return { neighbors, inspectedEdges: rows.meta.inspectedEdges };
-}
-/** Append one semantic expansion and report whether the page limit was reached. */
-function appendSemanticExpansion(expansion, currentDepth, maxDepth, limit, after, state) {
-    if (currentDepth >= maxDepth) {
-        if (expansion.neighbors.some((neighbor) => !state.seen.has(neighbor)))
-            state.truncated = true;
-        return false;
-    }
-    for (const neighbor of expansion.neighbors) {
-        if (state.seen.has(neighbor))
-            continue;
-        state.seen.add(neighbor);
-        state.queue.push({ id: neighbor, depth: currentDepth + 1 });
-        if (!state.resumed) {
-            if (neighbor === after)
-                state.resumed = true;
-            continue;
-        }
-        if (state.value.length >= limit) {
-            state.truncated = true;
-            return true;
-        }
-        state.value.push(neighbor);
-    }
-    return false;
-}
-/** Run one deterministic bounded breadth-first semantic walk. */
-function boundedSemanticWalk(graph, start, options, family, matches) {
-    if (!graph.hasNode(start))
-        throw new TypeError(`Relationship node not found: ${start}`);
-    const familyKinds = resolveFamilyKinds(graph, options.kinds, family);
-    const limit = options.limit ?? Number.POSITIVE_INFINITY;
-    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-    const after = options.after;
-    const state = {
-        seen: new Set([start]),
-        value: [],
-        queue: [{ id: start, depth: 0 }],
-        resumed: after === undefined,
-        truncated: false,
-    };
-    let visitedNodes = 0;
-    let inspectedEdges = 0;
-    for (let index = 0; index < state.queue.length; index += 1) {
-        options.signal?.throwIfAborted();
-        const current = state.queue[index];
-        visitedNodes += 1;
-        const expansion = expandSemanticNeighbors(graph, current.id, familyKinds, family, matches);
-        inspectedEdges += expansion.inspectedEdges;
-        if (appendSemanticExpansion(expansion, current.depth, maxDepth, limit, after, state))
-            break;
-    }
-    if (!state.resumed)
-        throw new TypeError(`Traversal cursor not found in sequence: ${after}`);
-    return {
-        value: state.value,
-        meta: {
-            visitedNodes,
-            inspectedEdges,
-            truncated: state.truncated,
-            nextCursor: state.value.at(-1),
-        },
-    };
-}
-/** Validate one path endpoint against the indexed graph. */
-function assertPathEndpoint(graph, id) {
-    if (!graph.hasNode(id))
-        throw new TypeError(`Relationship node not found: ${id}`);
-}
-/** Return eligible simple-path continuations and account for inspected edges. */
-function readPathContinuations(graph, partial, options, direction, state) {
-    const rows = graph.neighborEdges(partial.nodes.at(-1), {
-        direction,
-        ...(options.kinds === undefined ? {} : { kinds: options.kinds }),
-    });
-    state.inspectedEdges += rows.meta.inspectedEdges;
-    return rows.value.filter((row) => !partial.nodeSet.has(row.id));
-}
-/** Expand one partial simple path and report whether the probe cap was reached. */
-function expandPartialPath(graph, partial, target, options, direction, probeLimit, state) {
-    for (const row of readPathContinuations(graph, partial, options, direction, state)) {
-        const nodes = [...partial.nodes, row.id];
-        const nodeSet = new Set(partial.nodeSet).add(row.id);
-        const edges = [...partial.edges, row.edge];
-        if (row.id === target) {
-            state.value.push({ nodes, edges, length: edges.length });
-            if (state.value.length >= probeLimit)
-                return true;
-        }
-        else {
-            state.queue.push({ nodes, nodeSet, edges });
-        }
-    }
-    return false;
-}
-/**
- * Return the bounded transitive hierarchy ancestors of one node in
- * breadth-first discovery order, honoring each hierarchy kind's declared
- * parent endpoint (so `parent` and inverse `child` spellings agree).
- */
-export function hierarchyAncestors(graph, id, options = {}) {
-    return boundedSemanticWalk(graph, id, options, "hierarchy", (row, definition) => hierarchyParentEndpoint(row.edge, definition) === row.id);
-}
-/**
- * Return the bounded transitive hierarchy descendants of one node in
- * breadth-first discovery order, honoring each hierarchy kind's declared
- * parent endpoint.
- */
-export function hierarchyDescendants(graph, id, options = {}) {
-    return boundedSemanticWalk(graph, id, options, "hierarchy", (row, definition, nodeId) => hierarchyParentEndpoint(row.edge, definition) === nodeId);
-}
-/**
- * Return the bounded transitive execution predecessors of one node — the work
- * that must finish before it — in breadth-first discovery order, honoring each
- * ordering kind's declared precedence (so `blocked_by` and inverse `blocks`
- * spellings agree).
- */
-export function orderingPredecessors(graph, id, options = {}) {
-    return boundedSemanticWalk(graph, id, options, "ordering", (row, definition) => orderingPredecessorEndpoint(row.edge, definition) === row.id);
-}
-/**
- * Return the bounded transitive execution successors of one node — the work
- * this node gates — in breadth-first discovery order, honoring each ordering
- * kind's declared precedence.
- */
-export function orderingSuccessors(graph, id, options = {}) {
-    return boundedSemanticWalk(graph, id, options, "ordering", (row, definition, nodeId) => orderingPredecessorEndpoint(row.edge, definition) === nodeId);
-}
-/** Run bounded non-zero path enumeration after public option validation. */
-function enumerateNonZeroRelationshipPaths(graph, source, target, options, maxPaths, maxVisitedPaths, maxDepth, direction) {
-    const state = {
-        value: [],
-        queue: [{ nodes: [source], nodeSet: new Set([source]), edges: [] }],
-        inspectedEdges: 0,
-    };
-    let visitedNodes = 0;
-    let truncated = false;
-    const probeLimit = maxPaths + 1;
-    for (let index = 0; index < state.queue.length; index += 1) {
-        options.signal?.throwIfAborted();
-        if (state.value.length >= probeLimit || visitedNodes >= maxVisitedPaths) {
-            truncated = true;
-            break;
-        }
-        const partial = state.queue[index];
-        visitedNodes += 1;
-        if (partial.edges.length >= maxDepth) {
-            if (readPathContinuations(graph, partial, options, direction, state)
-                .length > 0)
-                truncated = true;
-            continue;
-        }
-        if (expandPartialPath(graph, partial, target, options, direction, probeLimit, state)) {
-            truncated = true;
-            break;
-        }
-    }
-    return {
-        value: state.value.slice(0, maxPaths),
-        meta: { visitedNodes, inspectedEdges: state.inspectedEdges, truncated },
-    };
-}
-/**
- * Enumerate bounded simple paths between two nodes, shortest first and
- * lexicographic within equal length. Traversal honors direction and kind
- * filters, caps returned paths, and reports truncation when depth, path-count,
- * or the expansion-safety bound stops the search early.
- */
-export function enumerateRelationshipPaths(graph, source, target, options = {}) {
-    assertPathEndpoint(graph, source);
-    assertPathEndpoint(graph, target);
-    const maxPaths = options.maxPaths ?? DEFAULT_MAX_PATHS;
-    const maxVisitedPaths = options.maxVisitedPaths ?? DEFAULT_MAX_VISITED_PATHS;
-    const maxDepth = options.maxDepth ?? DEFAULT_PATH_MAX_DEPTH;
-    assertPathBound("maxPaths", maxPaths);
-    assertPathBound("maxVisitedPaths", maxVisitedPaths);
-    assertPathBound("maxDepth", maxDepth);
-    const direction = options.direction ?? "outgoing";
-    options.signal?.throwIfAborted();
-    for (const kind of options.kinds ?? [])
-        graph.registry().require(kind);
-    if (source === target) {
-        if (maxPaths === 0) {
-            return {
-                value: [],
-                meta: { visitedNodes: 1, inspectedEdges: 0, truncated: true },
-            };
-        }
-        return {
-            value: [{ nodes: [source], edges: [], length: 0 }],
-            meta: { visitedNodes: 1, inspectedEdges: 0, truncated: false },
-        };
-    }
-    return enumerateNonZeroRelationshipPaths(graph, source, target, options, maxPaths, maxVisitedPaths, maxDepth, direction);
-}
+!(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]="f01a7c5d-0cb1-5dfa-90e8-14bb66bedd94")}catch(e2){}})();const DEFAULT_MAX_PATHS=5;const DEFAULT_MAX_VISITED_PATHS=1e4;const DEFAULT_PATH_MAX_DEPTH=8;function assertPathBound(name,value){if(!Number.isFinite(value)||!Number.isInteger(value)||value<0)throw new TypeError(`Invalid path ${name} bound: ${String(value)}`)}function hierarchyParentEndpoint(edge,definition){return definition.hierarchyDirection==="target_parent"?edge.target:edge.source}function orderingPredecessorEndpoint(edge,definition){return(definition.precedence??"source_before_target")==="target_before_source"?edge.target:edge.source}function orientOrderingEdge(edge,definition){const predecessor=orderingPredecessorEndpoint(edge,definition);return{predecessor,successor:predecessor===edge.source?edge.target:edge.source}}function resolveFamilyKinds(graph,kinds,family){if(kinds===void 0)return void 0;const registry=graph.registry();const resolved=new Set;for(const kind of kinds){const definition=registry.require(kind);const traversal=definition.traversal;if(traversal==="association")throw new TypeError(`Relationship kind ${definition.kind} uses association traversal; use graph impact --direction both`);if(traversal!==family&&traversal!=="semantic"){const redirect=traversal==="hierarchy"?"graph ancestors or graph descendants":"graph predecessors or graph successors";throw new TypeError(`Relationship kind ${definition.kind} uses ${traversal} traversal; use ${redirect}`)}resolved.add(definition.kind)}return resolved}function expandSemanticNeighbors(graph,nodeId,familyKinds,family,matches){const registry=graph.registry();const rows=graph.neighborEdges(nodeId,{direction:"both",...familyKinds===void 0?{}:{kinds:[...familyKinds]}});const neighbors=[];const seen=new Set;for(const row of rows.value){const definition=registry.require(row.edge.kind);if(familyKinds===void 0&&!definition[family])continue;if(!matches(row,definition,nodeId))continue;if(seen.has(row.id))continue;seen.add(row.id);neighbors.push(row.id)}return{neighbors,inspectedEdges:rows.meta.inspectedEdges}}function appendSemanticExpansion(expansion,currentDepth,maxDepth,limit,after,state){if(currentDepth>=maxDepth){if(expansion.neighbors.some(neighbor=>!state.seen.has(neighbor)))state.truncated=true;return false}for(const neighbor of expansion.neighbors){if(state.seen.has(neighbor))continue;state.seen.add(neighbor);state.queue.push({id:neighbor,depth:currentDepth+1});if(!state.resumed){if(neighbor===after)state.resumed=true;continue}if(state.value.length>=limit){state.truncated=true;return true}state.value.push(neighbor)}return false}function boundedSemanticWalk(graph,start,options,family,matches){if(!graph.hasNode(start))throw new TypeError(`Relationship node not found: ${start}`);const familyKinds=resolveFamilyKinds(graph,options.kinds,family);const limit=options.limit??Number.POSITIVE_INFINITY;const maxDepth=options.maxDepth??Number.POSITIVE_INFINITY;const after=options.after;const state={seen:new Set([start]),value:[],queue:[{id:start,depth:0}],resumed:after===void 0,truncated:false};let visitedNodes=0;let inspectedEdges=0;for(let index=0;index<state.queue.length;index+=1){options.signal?.throwIfAborted();const current=state.queue[index];visitedNodes+=1;const expansion=expandSemanticNeighbors(graph,current.id,familyKinds,family,matches);inspectedEdges+=expansion.inspectedEdges;if(appendSemanticExpansion(expansion,current.depth,maxDepth,limit,after,state))break}if(!state.resumed)throw new TypeError(`Traversal cursor not found in sequence: ${after}`);return{value:state.value,meta:{visitedNodes,inspectedEdges,truncated:state.truncated,nextCursor:state.value.at(-1)}}}function assertPathEndpoint(graph,id){if(!graph.hasNode(id))throw new TypeError(`Relationship node not found: ${id}`)}function readPathContinuations(graph,partial,options,direction,state){const rows=graph.neighborEdges(partial.nodes.at(-1),{direction,...options.kinds===void 0?{}:{kinds:options.kinds}});state.inspectedEdges+=rows.meta.inspectedEdges;return rows.value.filter(row=>!partial.nodeSet.has(row.id))}function expandPartialPath(graph,partial,target,options,direction,probeLimit,state){for(const row of readPathContinuations(graph,partial,options,direction,state)){const nodes=[...partial.nodes,row.id];const nodeSet=new Set(partial.nodeSet).add(row.id);const edges=[...partial.edges,row.edge];if(row.id===target){state.value.push({nodes,edges,length:edges.length});if(state.value.length>=probeLimit)return true}else{state.queue.push({nodes,nodeSet,edges})}}return false}function hierarchyAncestors(graph,id,options={}){return boundedSemanticWalk(graph,id,options,"hierarchy",(row,definition)=>hierarchyParentEndpoint(row.edge,definition)===row.id)}function hierarchyDescendants(graph,id,options={}){return boundedSemanticWalk(graph,id,options,"hierarchy",(row,definition,nodeId)=>hierarchyParentEndpoint(row.edge,definition)===nodeId)}function orderingPredecessors(graph,id,options={}){return boundedSemanticWalk(graph,id,options,"ordering",(row,definition)=>orderingPredecessorEndpoint(row.edge,definition)===row.id)}function orderingSuccessors(graph,id,options={}){return boundedSemanticWalk(graph,id,options,"ordering",(row,definition,nodeId)=>orderingPredecessorEndpoint(row.edge,definition)===nodeId)}function enumerateNonZeroRelationshipPaths(graph,source,target,options,maxPaths,maxVisitedPaths,maxDepth,direction){const state={value:[],queue:[{nodes:[source],nodeSet:new Set([source]),edges:[]}],inspectedEdges:0};let visitedNodes=0;let truncated=false;const probeLimit=maxPaths+1;for(let index=0;index<state.queue.length;index+=1){options.signal?.throwIfAborted();if(state.value.length>=probeLimit||visitedNodes>=maxVisitedPaths){truncated=true;break}const partial=state.queue[index];visitedNodes+=1;if(partial.edges.length>=maxDepth){if(readPathContinuations(graph,partial,options,direction,state).length>0)truncated=true;continue}if(expandPartialPath(graph,partial,target,options,direction,probeLimit,state)){truncated=true;break}}return{value:state.value.slice(0,maxPaths),meta:{visitedNodes,inspectedEdges:state.inspectedEdges,truncated}}}function enumerateRelationshipPaths(graph,source,target,options={}){assertPathEndpoint(graph,source);assertPathEndpoint(graph,target);const maxPaths=options.maxPaths??DEFAULT_MAX_PATHS;const maxVisitedPaths=options.maxVisitedPaths??DEFAULT_MAX_VISITED_PATHS;const maxDepth=options.maxDepth??DEFAULT_PATH_MAX_DEPTH;assertPathBound("maxPaths",maxPaths);assertPathBound("maxVisitedPaths",maxVisitedPaths);assertPathBound("maxDepth",maxDepth);const direction=options.direction??"outgoing";options.signal?.throwIfAborted();for(const kind of options.kinds??[])graph.registry().require(kind);if(source===target){if(maxPaths===0){return{value:[],meta:{visitedNodes:1,inspectedEdges:0,truncated:true}}}return{value:[{nodes:[source],edges:[],length:0}],meta:{visitedNodes:1,inspectedEdges:0,truncated:false}}}return enumerateNonZeroRelationshipPaths(graph,source,target,options,maxPaths,maxVisitedPaths,maxDepth,direction)}export{enumerateRelationshipPaths,hierarchyAncestors,hierarchyDescendants,hierarchyParentEndpoint,orderingPredecessorEndpoint,orderingPredecessors,orderingSuccessors,orientOrderingEdge};
 //# sourceMappingURL=traversal.js.map
-//# debugId=ac2b3cd9-5a98-5fea-888c-e96de8cd593d

package/dist/sdk/graph/workspace-relationship-kind-registry.js

@@ -1,28 +1,2 @@
-/**
- * @module sdk/graph/workspace-relationship-kind-registry
- *
- * Resolves the built-in relationship ontology together with active extension
- * registrations without coupling hierarchy analysis to graph assembly.
- */
-
-!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]="d49d73c9-f988-5c3c-a22d-0580ee5526f6")}catch(e){}}();
-import { getActiveExtensionRegistrations } from "../../core/extensions/index.js";
-import { createRelationshipKindRegistry, } from "../relationships.js";
-/**
- * Resolve the relationship-kind registry active for the current workspace.
- *
- * Callers that omit an explicit registry must still recognize extension-owned
- * hierarchy and ordering kinds instead of silently falling back to built-ins.
- */
-export function resolveWorkspaceRelationshipKindRegistry() {
-    const registry = createRelationshipKindRegistry();
-    for (const registration of getActiveExtensionRegistrations()
-        ?.relationship_kinds ?? []) {
-        for (const definition of registration.definitions) {
-            registry.register(definition);
-        }
-    }
-    return registry;
-}
+!(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]="0a3dd0c1-2dea-5143-a2eb-65e758a0cc71")}catch(e2){}})();import{getActiveExtensionRegistrations}from"../../core/extensions/index.js";import{createRelationshipKindRegistry}from"../relationships.js";function resolveWorkspaceRelationshipKindRegistry(){const registry=createRelationshipKindRegistry();for(const registration of getActiveExtensionRegistrations()?.relationship_kinds??[]){for(const definition of registration.definitions){registry.register(definition)}}return registry}export{resolveWorkspaceRelationshipKindRegistry};
 //# sourceMappingURL=workspace-relationship-kind-registry.js.map
-//# debugId=d49d73c9-f988-5c3c-a22d-0580ee5526f6

package/dist/sdk/graph.js

@@ -1,16 +1,2 @@
-/**
- * @module sdk/graph
- *
- * Provides relationship modeling, traversal, analytics, and remediation APIs.
- */
-
-!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]="b6d6f773-8336-5e0e-8dfb-d5729caa18d9")}catch(e){}}();
-export * from "./graph/index.js";
-export * from "./actionability.js";
-export * from "./relationships.js";
-export * from "./relationship-analytics.js";
-export * from "./relationship-context.js";
-export * from "./relationship-history.js";
-export * from "./relationship-migration.js";
+!(function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=new e.Error().stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="3160880c-9d85-52c5-ae1d-ada213f56ce6")}catch(e2){}})();export*from"./graph/index.js";export*from"./actionability.js";export*from"./relationships.js";export*from"./relationship-analytics.js";export*from"./relationship-context.js";export*from"./relationship-history.js";export*from"./relationship-migration.js";
 //# sourceMappingURL=graph.js.map
-//# debugId=b6d6f773-8336-5e0e-8dfb-d5729caa18d9