@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/sdk/graph/run.js

@@ -1,769 +1,2 @@
-/**
- * @module sdk/graph/run
- *
- * Workspace-facing `pm graph` runner: one thin orchestrator that loads the
- * tracker once, resolves the fingerprint-keyed workspace assembly through the
- * shared graph cache, and dispatches bounded traversal, path, impact,
- * analytics, governance-audit, and remediation-planning queries through the
- * public graph toolkit. Every projection is counts-first, deterministic, and
- * carries explicit cost, truncation, and cache metadata so agents can budget
- * follow-up reads without re-scanning the workspace; identical repeated
- * queries in long-lived hosts are answered from the memoized snapshot.
- */
-
-!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]="8797dddf-3643-554b-ba7f-4c513535c154")}catch(e){}}();
-import { assertInitializedTracker } from "../environment/tracker-preflight.js";
-import { getActiveExtensionRegistrations } from "../../core/extensions/index.js";
-import { isTerminalStatus } from "../../core/item/status.js";
-import { resolveItemTypeRegistry } from "../../core/item/type-registry.js";
-import { resolveRuntimeStatusRegistry } from "../../core/schema/runtime-schema.js";
-import { EXIT_CODE } from "../../core/shared/constants.js";
-import { PmCliError } from "../../core/shared/errors.js";
-import { createUnknownSubcommandError } from "../agent/subcommand-recovery.js";
-import { listAllItemMetadataLight } from "../../core/store/item-store.js";
-import { resolvePmRoot } from "../../core/store/paths.js";
-import { readSettings } from "../../core/store/settings.js";
-import { parseDirection, parseKinds, parseMaxDepth, parsePositiveInteger, } from "../dependencies.js";
-import { analyzeGraphImpact, analyzeKnowledgeGraph, analyzeRelationshipExecution, } from "../relationship-analytics.js";
-import { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, } from "./analytics.js";
-import { computeRelationshipCentrality, findRelationshipCutStructure, } from "./centrality.js";
-import { analyzeRelationshipSchedule } from "./scheduling.js";
-import { assembleWorkspaceRelationshipGraph, getWorkspaceHierarchyIntegrity, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
-import { computeWorkspaceGraphFingerprint, workspaceGraphCache, } from "./cache.js";
-import { clearDurableGraphCache, durableGraphCacheStatus, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, GRAPH_DURABLE_CACHE_MIN_ITEMS, } from "./durable-cache.js";
-import { auditWorkspaceRelationshipGraph, diffRelationshipAuditSnapshots, } from "./governance.js";
-import { RELATIONSHIP_AUDIT_FINDING_CODES } from "./governance-contracts.js";
-import { planRelationshipRemediation, } from "./remediation.js";
-import { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, } from "./traversal.js";
-import { GRAPH_SUBCOMMAND_VALUES, } from "../cli-contracts/enum-contracts.js";
-import { assertProjectionModeChoice, } from "../output-projection.js";
-export { GRAPH_SUBCOMMAND_VALUES };
-/** Graph subcommands that require a root item id. */
-const ROOTED_SUBCOMMANDS = new Set([
-    "ancestors",
-    "descendants",
-    "predecessors",
-    "successors",
-    "paths",
-    "impact",
-    "dominators",
-]);
-/** Default bounded sample rows returned by analyze/audit projections. */
-const DEFAULT_SAMPLE_LIMIT = 10;
-/** Attach a complete or bounded row declaration to one graph result. */
-function attachGraphProjection(result, summary, rowGroup) {
-    return {
-        ...result,
-        projection: {
-            mode: summary ? "summary" : "full",
-            declared_field_groups: rowGroup === undefined
-                ? []
-                : [{ name: rowGroup, restore_with: "--full" }],
-            included_field_groups: rowGroup === undefined || summary ? [] : [rowGroup],
-        },
-    };
-}
-/** Normalize repeatable or comma-separated id options into a flat list. */
-function normalizeIdList(raw) {
-    if (raw === undefined)
-        return [];
-    return (Array.isArray(raw) ? raw : [raw])
-        .flatMap((value) => value.split(","))
-        .map((value) => value.trim())
-        .filter((value) => value.length > 0);
-}
-/** Validate the graph subcommand and its positional-id requirements. */
-export function parseGraphSubcommand(raw, id, target) {
-    const candidate = raw.trim().toLowerCase();
-    if (!GRAPH_SUBCOMMAND_VALUES.includes(candidate)) {
-        throw createUnknownSubcommandError({
-            command_path: "graph",
-            token: candidate || "<empty>",
-            allowed: GRAPH_SUBCOMMAND_VALUES,
-        });
-    }
-    const subcommand = candidate;
-    if (ROOTED_SUBCOMMANDS.has(subcommand) && !id?.trim()) {
-        throw new PmCliError(`graph ${subcommand} requires an item id.`, EXIT_CODE.USAGE);
-    }
-    if (subcommand === "paths" && !target?.trim()) {
-        throw new PmCliError("graph paths requires a source and a target item id.", EXIT_CODE.USAGE);
-    }
-    return subcommand;
-}
-/**
- * Re-throw graph-kernel semantic option misuse (non-family kind, unknown
- * cursor, non-transitive redundancy kind) as a usage error carrying the
- * original explanation instead of an opaque crash.
- */
-function rethrowGraphUsage(error) {
-    if (error instanceof TypeError)
-        throw new PmCliError(error.message, EXIT_CODE.USAGE);
-    throw error;
-}
-/** Convert traversal metadata into the shared cost/truncation projection. */
-function projectQueryMeta(meta) {
-    return {
-        truncated: meta.truncated,
-        cost: {
-            visited_nodes: meta.visitedNodes,
-            inspected_edges: meta.inspectedEdges,
-        },
-    };
-}
-/** Resolve one item id case-insensitively against the assembled graph. */
-function canonicalizeGraphId(assembly, raw) {
-    const wanted = raw.trim().toLowerCase();
-    for (const detail of assembly.details) {
-        if (detail.id.trim().toLowerCase() === wanted &&
-            !assembly.missingIdSet.has(detail.id.toLowerCase())) {
-            return detail.id;
-        }
-    }
-    throw new PmCliError(`Item ${raw} not found`, EXIT_CODE.NOT_FOUND);
-}
-/** Execute one transitive traversal subcommand over the assembled graph. */
-function runGraphTraversal(subcommand, root, invocation) {
-    const walk = {
-        ancestors: hierarchyAncestors,
-        descendants: hierarchyDescendants,
-        predecessors: orderingPredecessors,
-        successors: orderingSuccessors,
-    }[subcommand];
-    let result;
-    try {
-        result = walk(invocation.assembly.graph, root, {
-            ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
-            ...(invocation.maxDepth === undefined
-                ? {}
-                : { maxDepth: invocation.maxDepth }),
-            ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),
-            ...(invocation.after === undefined ? {} : { after: invocation.after }),
-        });
-    }
-    catch (error) {
-        rethrowGraphUsage(error);
-    }
-    const meta = projectQueryMeta(result.meta);
-    return {
-        subcommand,
-        root,
-        count: result.value.length,
-        ...meta,
-        ...(result.meta.nextCursor === undefined
-            ? {}
-            : { next_cursor: result.meta.nextCursor }),
-        ...(invocation.summary ? {} : { ids: result.value }),
-    };
-}
-/** Execute the bounded simple-path enumeration subcommand. */
-function runGraphPaths(root, target, invocation) {
-    const result = enumerateRelationshipPaths(invocation.assembly.graph, root, target, {
-        direction: invocation.direction,
-        ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
-        ...(invocation.maxDepth === undefined
-            ? {}
-            : { maxDepth: invocation.maxDepth }),
-        ...(invocation.maxPaths === undefined
-            ? {}
-            : { maxPaths: invocation.maxPaths }),
-    });
-    return {
-        subcommand: "paths",
-        root,
-        target,
-        direction: invocation.direction,
-        count: result.value.length,
-        ...projectQueryMeta(result.meta),
-        ...(invocation.summary
-            ? {}
-            : {
-                paths: result.value.map((path) => ({
-                    nodes: path.nodes,
-                    kinds: path.edges.map((edge) => edge.kind),
-                    length: path.length,
-                })),
-            }),
-    };
-}
-/** Execute the bounded blast-radius impact subcommand. */
-function runGraphImpact(root, invocation) {
-    let analysis;
-    try {
-        analysis = analyzeGraphImpact(invocation.assembly.graph, root, {
-            direction: invocation.direction,
-            ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
-            ...(invocation.maxDepth === undefined
-                ? {}
-                : { maxDepth: invocation.maxDepth }),
-            ...(invocation.unbounded
-                ? {}
-                : { limit: invocation.limit ?? DEFAULT_SAMPLE_LIMIT }),
-            ...(invocation.after === undefined ? {} : { after: invocation.after }),
-        });
-    }
-    catch (error) {
-        rethrowGraphUsage(error);
-    }
-    return {
-        subcommand: "impact",
-        root,
-        direction: invocation.direction,
-        count: analysis.affected.length,
-        truncated: analysis.truncated,
-        ...(analysis.nextCursor === undefined
-            ? {}
-            : { next_cursor: analysis.nextCursor }),
-        cost: {
-            visited_nodes: analysis.cost.visitedNodes,
-            inspected_edges: analysis.cost.inspectedEdges,
-        },
-        ...(invocation.summary ? {} : { affected: analysis.affected }),
-    };
-}
-function buildGraphExecutionSummary(execution, summary, sampleLimit) {
-    return {
-        acyclic: execution.acyclic,
-        ordered_node_count: execution.order.length,
-        layer_count: execution.layers.length,
-        frontier_count: execution.frontier.length,
-        critical_path_length: execution.criticalPathLength,
-        cycle_count: execution.cycles.length,
-        ...(summary
-            ? {}
-            : {
-                frontier: execution.frontier.slice(0, sampleLimit),
-                critical_path: execution.criticalPath.slice(0, sampleLimit),
-                cycles: execution.cycles.slice(0, sampleLimit),
-            }),
-    };
-}
-function buildGraphKnowledgeSummary(knowledge, summary, sampleLimit) {
-    return {
-        component_count: knowledge.components.length,
-        largest_component_size: knowledge.components[0]?.length ?? 0,
-        orphan_count: knowledge.orphans.length,
-        ...(summary
-            ? {}
-            : {
-                orphans: knowledge.orphans.slice(0, sampleLimit),
-                hubs: knowledge.hubs.slice(0, sampleLimit),
-            }),
-    };
-}
-function buildGraphHierarchySummary(hierarchy, summary, sampleLimit) {
-    let legacyCycleCount = 0;
-    let legacyCardinalityCount = 0;
-    let legacyDivergenceCount = 0;
-    for (const finding of hierarchy.cycles) {
-        legacyCycleCount += Number(finding.legacy_terminal);
-    }
-    for (const finding of hierarchy.cardinality_violations) {
-        legacyCardinalityCount += Number(finding.legacy_terminal);
-    }
-    for (const finding of hierarchy.divergences) {
-        legacyDivergenceCount += Number(finding.legacy_terminal);
-    }
-    return {
-        acyclic: hierarchy.cycles.length === 0,
-        relation_count: hierarchy.relations.length,
-        cycle_count: hierarchy.cycles.length,
-        active_cycle_count: hierarchy.cycles.length - legacyCycleCount,
-        legacy_cycle_count: legacyCycleCount,
-        cardinality_violation_count: hierarchy.cardinality_violations.length,
-        active_cardinality_violation_count: hierarchy.cardinality_violations.length - legacyCardinalityCount,
-        legacy_cardinality_violation_count: legacyCardinalityCount,
-        parent_divergence_count: hierarchy.divergences.length,
-        active_parent_divergence_count: hierarchy.divergences.length - legacyDivergenceCount,
-        legacy_parent_divergence_count: legacyDivergenceCount,
-        ...(summary
-            ? {}
-            : {
-                cycles: hierarchy.cycles
-                    .slice(0, sampleLimit)
-                    .map((cycle) => cycle.item_ids),
-            }),
-    };
-}
-/** Execute the workspace-wide execution and knowledge analytics subcommand. */
-function runGraphAnalyze(invocation) {
-    const graph = invocation.assembly.graph;
-    const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const execution = analyzeRelationshipExecution(graph, {
-        registry: graph.registry(),
-    });
-    const knowledge = analyzeKnowledgeGraph(graph);
-    return {
-        subcommand: "analyze",
-        node_count: graph.nodes().length,
-        edge_count: graph.edges().length,
-        edge_basis: "deduplicated_directed",
-        sample_limit: sampleLimit,
-        execution: buildGraphExecutionSummary(execution, invocation.summary, sampleLimit),
-        knowledge: buildGraphKnowledgeSummary(knowledge, invocation.summary, sampleLimit),
-        hierarchy: buildGraphHierarchySummary(getWorkspaceHierarchyIntegrity(invocation.assembly), invocation.summary, sampleLimit),
-    };
-}
-/** Execute the governance-audit subcommand over the assembled graph. */
-function runGraphAudit(invocation, isTerminal) {
-    const report = auditWorkspaceRelationshipGraph(invocation.assembly, {
-        isTerminal,
-        ...(invocation.sample === undefined
-            ? {}
-            : { maxSampleSize: invocation.sample }),
-        ...(invocation.exemptIsolates.length === 0
-            ? {}
-            : { exemptIsolates: invocation.exemptIsolates }),
-        ...(invocation.exemptIsolateTypes.length === 0
-            ? {}
-            : { isolateExemptTypes: invocation.exemptIsolateTypes }),
-    });
-    const bySeverity = {};
-    const byCode = {};
-    const affectedBySeverity = {};
-    const affectedByCode = {};
-    for (const finding of report.findings) {
-        bySeverity[finding.severity] = (bySeverity[finding.severity] ?? 0) + 1;
-        byCode[finding.code] = (byCode[finding.code] ?? 0) + 1;
-        affectedBySeverity[finding.severity] =
-            (affectedBySeverity[finding.severity] ?? 0) + finding.count;
-        affectedByCode[finding.code] =
-            (affectedByCode[finding.code] ?? 0) + finding.count;
-    }
-    const { finding_subjects_by_code: _findingSubjects, ...compactProfile } = report.profile;
-    return {
-        subcommand: "audit",
-        finding_count: report.findings.length,
-        findings_by_severity: bySeverity,
-        findings_by_code: byCode,
-        affected_subjects_by_severity: affectedBySeverity,
-        affected_subjects_by_code: affectedByCode,
-        profile: invocation.summary ? compactProfile : report.profile,
-        legacy_alias_counts: invocation.assembly.legacyAliasCounts,
-        ...(invocation.summary ? {} : { findings: report.findings }),
-    };
-}
-/** Execute the deterministic community-detection subcommand. */
-function runGraphCommunities(invocation) {
-    const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const options = {};
-    if (invocation.kinds !== undefined)
-        options.kinds = invocation.kinds;
-    const result = detectRelationshipCommunities(invocation.assembly.graph, options);
-    const analysis = result.value;
-    return {
-        subcommand: "communities",
-        community_count: analysis.communities.length,
-        largest_community_size: analysis.communities[0]?.size ?? 0,
-        iterations: analysis.iterations,
-        converged: analysis.converged,
-        truncated: !analysis.converged || analysis.communities.length > sampleLimit,
-        cost: {
-            visited_nodes: result.meta.visitedNodes,
-            inspected_edges: result.meta.inspectedEdges,
-        },
-        ...(invocation.summary
-            ? {}
-            : {
-                communities: analysis.communities
-                    .slice(0, sampleLimit)
-                    .map((community) => ({
-                    representative: community.representative,
-                    size: community.size,
-                    members: community.members.slice(0, sampleLimit),
-                })),
-            }),
-    };
-}
-/** Execute the transitive-redundancy scan subcommand. */
-function runGraphRedundancy(invocation) {
-    let result;
-    try {
-        result = findRedundantRelationshipEdges(invocation.assembly.graph, {
-            ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
-            ...(invocation.maxDepth === undefined
-                ? {}
-                : { maxDepth: invocation.maxDepth }),
-            ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),
-        });
-    }
-    catch (error) {
-        rethrowGraphUsage(error);
-    }
-    return {
-        subcommand: "redundancy",
-        redundant_count: result.value.length,
-        ...projectQueryMeta(result.meta),
-        ...(invocation.summary
-            ? {}
-            : {
-                redundant: result.value.map((row) => ({
-                    source: row.edge.source,
-                    target: row.edge.target,
-                    kind: row.edge.kind,
-                    witness: row.witness,
-                })),
-            }),
-    };
-}
-/** Execute the dominator/bottleneck analysis subcommand. */
-function runGraphDominators(root, invocation) {
-    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const result = computeRelationshipDominators(invocation.assembly.graph, root, {
-        direction: invocation.direction,
-        ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),
-        ...(invocation.maxDepth === undefined
-            ? {}
-            : { maxDepth: invocation.maxDepth }),
-    });
-    const bottlenecks = result.value.rows.filter((row) => row.dominatedCount > 0);
-    return {
-        subcommand: "dominators",
-        root,
-        direction: invocation.direction,
-        reachable_count: result.value.reachableCount,
-        bottleneck_count: bottlenecks.length,
-        truncated: result.meta.truncated || bottlenecks.length > limit,
-        cost: {
-            visited_nodes: result.meta.visitedNodes,
-            inspected_edges: result.meta.inspectedEdges,
-        },
-        ...(invocation.summary
-            ? {}
-            : {
-                bottlenecks: bottlenecks.slice(0, limit).map((row) => ({
-                    id: row.id,
-                    idom: row.idom,
-                    dominated_count: row.dominatedCount,
-                })),
-            }),
-    };
-}
-/** Execute the critical-path slack (float) analysis subcommand. */
-function runGraphSlack(invocation) {
-    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    // Scheduling spans every ordering kind; --kind is rejected upstream by
-    // assertGraphFlagScope, so no kind filter reaches the analysis here.
-    const analysis = analyzeRelationshipSchedule(invocation.assembly.graph);
-    const criticalCount = analysis.rows.filter((row) => row.critical).length;
-    return {
-        subcommand: "slack",
-        acyclic: analysis.acyclic,
-        makespan: analysis.makespan,
-        scheduled_count: analysis.scheduledCount,
-        critical_count: criticalCount,
-        critical_path_length: analysis.criticalPathLength,
-        cycle_count: analysis.cycles.length,
-        truncated: analysis.rows.length > limit,
-        ...(invocation.summary
-            ? {}
-            : {
-                critical_path: analysis.criticalPath,
-                rows: analysis.rows.slice(0, limit).map((row) => ({
-                    id: row.id,
-                    earliest_start: row.earliestStart,
-                    latest_start: row.latestStart,
-                    slack: row.slack,
-                    critical: row.critical,
-                })),
-            }),
-    };
-}
-/** Execute the structural-centrality ranking subcommand. */
-function runGraphCentrality(invocation) {
-    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const result = computeRelationshipCentrality(invocation.assembly.graph, invocation.kinds === undefined ? {} : { kinds: invocation.kinds });
-    const analysis = result.value;
-    return {
-        subcommand: "centrality",
-        node_count: analysis.nodeCount,
-        edge_count: analysis.edgeCount,
-        edge_basis: "simple_undirected",
-        truncated: analysis.rows.length > limit,
-        cost: {
-            visited_nodes: result.meta.visitedNodes,
-            inspected_edges: result.meta.inspectedEdges,
-        },
-        ...(invocation.summary
-            ? {}
-            : {
-                rows: analysis.rows.slice(0, limit).map((row) => ({
-                    id: row.id,
-                    degree: row.degree,
-                    in_degree: row.inDegree,
-                    out_degree: row.outDegree,
-                    betweenness: row.betweenness,
-                    closeness: row.closeness,
-                })),
-            }),
-    };
-}
-/** Execute the articulation-point and bridge (cut-structure) subcommand. */
-function runGraphArticulation(invocation) {
-    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const result = findRelationshipCutStructure(invocation.assembly.graph, invocation.kinds === undefined ? {} : { kinds: invocation.kinds });
-    const { articulationPoints, bridges } = result.value;
-    return {
-        subcommand: "articulation",
-        articulation_count: articulationPoints.length,
-        bridge_count: bridges.length,
-        truncated: articulationPoints.length > limit || bridges.length > limit,
-        cost: {
-            visited_nodes: result.meta.visitedNodes,
-            inspected_edges: result.meta.inspectedEdges,
-        },
-        ...(invocation.summary
-            ? {}
-            : {
-                articulation_points: articulationPoints.slice(0, limit),
-                bridges: bridges.slice(0, limit),
-            }),
-    };
-}
-/** Execute the dry-run remediation planning subcommand. */
-function runGraphPlan(invocation, isTerminal) {
-    const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;
-    const plan = planRelationshipRemediation(invocation.assembly, {
-        isTerminal,
-        redundancyLimit: limit,
-        ...(invocation.sample === undefined
-            ? {}
-            : { maxSampleSize: invocation.sample }),
-        ...(invocation.exemptIsolates.length === 0
-            ? {}
-            : { exemptIsolates: invocation.exemptIsolates }),
-        ...(invocation.exemptIsolateTypes.length === 0
-            ? {}
-            : { isolateExemptTypes: invocation.exemptIsolateTypes }),
-    });
-    const byOp = {};
-    const byCode = {};
-    for (const step of plan.steps) {
-        byOp[step.op] = (byOp[step.op] ?? 0) + 1;
-        byCode[step.code] = (byCode[step.code] ?? 0) + 1;
-    }
-    return {
-        subcommand: "plan",
-        step_count: plan.steps.length,
-        steps_by_op: byOp,
-        steps_by_code: byCode,
-        finding_count: plan.report.findings.length,
-        truncated: plan.truncated || plan.steps.length > limit,
-        cost: {
-            visited_nodes: plan.cost.visitedNodes,
-            inspected_edges: plan.cost.inspectedEdges,
-        },
-        ...(invocation.summary ? {} : { steps: plan.steps.slice(0, limit) }),
-    };
-}
-/** Build the deterministic memoization key covering every query-shaping input. */
-function buildGraphQueryKey(subcommand, root, pathsTarget, invocation) {
-    return JSON.stringify({
-        subcommand,
-        root: root ?? null,
-        target: pathsTarget ?? null,
-        kinds: invocation.kinds ?? null,
-        maxDepth: invocation.maxDepth ?? null,
-        limit: invocation.limit ?? null,
-        after: invocation.after ?? null,
-        direction: invocation.direction,
-        maxPaths: invocation.maxPaths ?? null,
-        sample: invocation.sample ?? null,
-        // The audit consumes exemptions as a case-insensitive set, so the key
-        // must not distinguish logically identical spellings or orderings.
-        exemptIsolates: [
-            ...new Set(invocation.exemptIsolates.map((id) => id.toLowerCase())),
-        ].sort(),
-        exemptIsolateTypes: [
-            ...new Set(invocation.exemptIsolateTypes.map((type) => type.toLowerCase())),
-        ].sort(),
-        summary: invocation.summary,
-        unbounded: invocation.unbounded,
-    });
-}
-/** Dispatch one parsed graph subcommand to its executor. */
-function executeGraphSubcommand(subcommand, root, pathsTarget, invocation, isTerminal) {
-    if (subcommand === "analyze")
-        return runGraphAnalyze(invocation);
-    if (subcommand === "audit")
-        return runGraphAudit(invocation, isTerminal);
-    if (subcommand === "plan")
-        return runGraphPlan(invocation, isTerminal);
-    if (subcommand === "communities")
-        return runGraphCommunities(invocation);
-    if (subcommand === "redundancy")
-        return runGraphRedundancy(invocation);
-    if (subcommand === "dominators")
-        return runGraphDominators(root, invocation);
-    if (subcommand === "slack")
-        return runGraphSlack(invocation);
-    if (subcommand === "centrality")
-        return runGraphCentrality(invocation);
-    if (subcommand === "articulation")
-        return runGraphArticulation(invocation);
-    if (subcommand === "paths")
-        return runGraphPaths(root, pathsTarget, invocation);
-    if (subcommand === "impact")
-        return runGraphImpact(root, invocation);
-    return runGraphTraversal(subcommand, root, invocation);
-}
-/** Reject maintenance or baseline flags outside their owning subcommand. */
-function assertGraphFlagScope(subcommand, options) {
-    if (subcommand !== "index" &&
-        (options.rebuild === true || options.clear === true))
-        throw new PmCliError("--rebuild and --clear apply only to graph index.", EXIT_CODE.USAGE);
-    if (subcommand !== "audit" && options.saveBaseline === true)
-        throw new PmCliError("--save-baseline applies only to graph audit.", EXIT_CODE.USAGE);
-    // Slack schedules the whole ordering DAG (reusing the exact execution
-    // analysis, which has no kind filter), so reject --kind instead of silently
-    // ignoring it and letting the cache key diverge on an inert option.
-    if (subcommand === "slack" && options.kind !== undefined)
-        throw new PmCliError("graph slack analyzes every ordering kind; --kind is not supported.", EXIT_CODE.USAGE);
-    if (options.rebuild === true && options.clear === true)
-        throw new PmCliError("graph index accepts either --rebuild or --clear, not both.", EXIT_CODE.USAGE);
-    if (subcommand === "impact" &&
-        options.full === true &&
-        options.limit !== undefined)
-        throw new PmCliError("graph impact accepts either --full or --limit, not both.", EXIT_CODE.USAGE);
-}
-/**
- * Execute the durable-index maintenance subcommand: report status, delete the
- * envelope, or rebuild it and warm the counts-first analyze and audit census
- * queries so follow-up summary invocations answer from the persisted index.
- * A rebuild is also the explicit opt-in that enables persistence on
- * workspaces below the implicit item threshold.
- */
-async function runGraphIndex(pmRoot, fingerprint, invocation, itemCount, isTerminal, options) {
-    let action = "status";
-    if (options.clear === true) {
-        await clearDurableGraphCache(pmRoot);
-        action = "cleared";
-    }
-    if (options.rebuild === true) {
-        await clearDurableGraphCache(pmRoot);
-        const view = await openDurableGraphCache(pmRoot, fingerprint);
-        const warmInvocation = {
-            assembly: invocation.assembly,
-            direction: "both",
-            exemptIsolates: [],
-            exemptIsolateTypes: [],
-            saveBaseline: false,
-            summary: true,
-            unbounded: false,
-        };
-        for (const warm of ["analyze", "audit"]) {
-            await persistDurableGraphResult(pmRoot, fingerprint, view, buildGraphQueryKey(warm, undefined, undefined, warmInvocation), executeGraphSubcommand(warm, undefined, undefined, warmInvocation, isTerminal));
-        }
-        action = "rebuilt";
-    }
-    const status = await durableGraphCacheStatus(pmRoot, fingerprint);
-    return {
-        subcommand: "index",
-        action,
-        state: status.exists ? (status.fresh ? "fresh" : "stale") : "absent",
-        entry_count: status.entry_count,
-        item_count: itemCount,
-        min_items_threshold: GRAPH_DURABLE_CACHE_MIN_ITEMS,
-        persist_enabled: shouldPersistDurableGraphCache(itemCount, status.exists),
-        current_fingerprint: fingerprint.slice(0, 12),
-        ...(status.saved_at === undefined ? {} : { saved_at: status.saved_at }),
-        ...(status.bytes === undefined ? {} : { bytes: status.bytes }),
-    };
-}
-/**
- * Attach the change-since-baseline census delta to one audit envelope and
- * persist the current census when the caller requested a new baseline. The
- * delta always compares against the baseline as it existed before this
- * invocation, so `--save-baseline` reports drift once and then resets it.
- */
-async function applyAuditBaseline(pmRoot, fingerprint, audit, saveBaseline) {
-    const current = {
-        saved_at: new Date().toISOString(),
-        fingerprint,
-        affected_subjects_by_code: audit.affected_subjects_by_code,
-        profile: {
-            ...audit.profile,
-            finding_subjects_by_code: Object.fromEntries(RELATIONSHIP_AUDIT_FINDING_CODES.map((code) => [
-                code,
-                audit.affected_subjects_by_code[code] ?? 0,
-            ])),
-        },
-    };
-    const stored = await loadGraphAuditBaseline(pmRoot);
-    if (saveBaseline)
-        await saveGraphAuditBaseline(pmRoot, current);
-    return stored === undefined
-        ? audit
-        : { ...audit, baseline: diffRelationshipAuditSnapshots(stored, current) };
-}
-/** Persist a rebuildable query result without allowing storage failure to reject the query. */
-async function persistDurableGraphResultBestEffort(pmRoot, fingerprint, view, queryKey, result) {
-    try {
-        await persistDurableGraphResult(pmRoot, fingerprint, view, queryKey, result);
-    }
-    catch {
-        // The in-memory result remains authoritative; the next invocation can rebuild the cache.
-    }
-}
-/** Implements run graph for the public runtime surface of this module. */
-export async function runGraph(subcommandRaw, id, target, options, global) {
-    const subcommand = parseGraphSubcommand(subcommandRaw, id, target);
-    assertProjectionModeChoice(options.summary === true, options.full === true, "--summary");
-    const pmRoot = resolvePmRoot(process.cwd(), global.path);
-    await assertInitializedTracker(pmRoot);
-    const settings = await readSettings(pmRoot);
-    const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());
-    const items = await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);
-    const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);
-    const isTerminal = (status) => isTerminalStatus(status, statusRegistry);
-    assertGraphFlagScope(subcommand, options);
-    const relationshipRegistry = resolveWorkspaceRelationshipKindRegistry();
-    const kinds = parseKinds(options.kind, relationshipRegistry);
-    const lookup = workspaceGraphCache().lookup(pmRoot, computeWorkspaceGraphFingerprint(items, isTerminal, relationshipRegistry), () => assembleWorkspaceRelationshipGraph(items, isTerminal, relationshipRegistry));
-    const invocation = {
-        assembly: lookup.assembly,
-        ...(kinds === undefined ? {} : { kinds }),
-        maxDepth: parseMaxDepth(options.maxDepth),
-        limit: parsePositiveInteger(options.limit, "limit"),
-        after: options.after?.trim() || undefined,
-        direction: parseDirection(options.direction),
-        maxPaths: parsePositiveInteger(options.maxPaths, "max-paths"),
-        sample: parsePositiveInteger(options.sample, "sample"),
-        exemptIsolates: normalizeIdList(options.exemptIsolate),
-        exemptIsolateTypes: normalizeIdList(options.exemptIsolateType),
-        saveBaseline: options.saveBaseline === true,
-        summary: options.summary === true,
-        unbounded: options.full === true,
-    };
-    if (subcommand === "index") {
-        return attachGraphProjection(await runGraphIndex(pmRoot, lookup.fingerprint, invocation, items.length, isTerminal, options), false);
-    }
-    const root = ROOTED_SUBCOMMANDS.has(subcommand)
-        ? canonicalizeGraphId(invocation.assembly, id)
-        : undefined;
-    const pathsTarget = subcommand === "paths"
-        ? canonicalizeGraphId(invocation.assembly, target)
-        : undefined;
-    const queryKey = buildGraphQueryKey(subcommand, root, pathsTarget, invocation);
-    const durableView = await openDurableGraphCache(pmRoot, lookup.fingerprint);
-    const durableValue = durableView.results[queryKey];
-    const memo = lookup.memoize(queryKey, () => durableValue !== undefined
-        ? structuredClone(durableValue)
-        : executeGraphSubcommand(subcommand, root, pathsTarget, invocation, isTerminal));
-    const persistEnabled = shouldPersistDurableGraphCache(items.length, durableView.exists);
-    if (!memo.reused && durableValue === undefined && persistEnabled) {
-        await persistDurableGraphResultBestEffort(pmRoot, lookup.fingerprint, durableView, queryKey, memo.value);
-    }
-    const value = memo.value.subcommand === "audit"
-        ? await applyAuditBaseline(pmRoot, lookup.fingerprint, memo.value, invocation.saveBaseline)
-        : memo.value;
-    value.cache = {
-        fingerprint: lookup.fingerprint.slice(0, 12),
-        assembly: lookup.assemblyReused ? "hit" : "miss",
-        result: memo.reused ? "hit" : "miss",
-        durable: durableValue !== undefined ? "hit" : persistEnabled ? "miss" : "off",
-    };
-    return attachGraphProjection(value, invocation.summary, "result_rows");
-}
+!(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]="3a536c76-bbd6-5235-b06a-f18c5cf95a88")}catch(e2){}})();import{assertInitializedTracker}from"../environment/tracker-preflight.js";import{getActiveExtensionRegistrations}from"../../core/extensions/index.js";import{isTerminalStatus}from"../../core/item/status.js";import{resolveItemTypeRegistry}from"../../core/item/type-registry.js";import{resolveRuntimeStatusRegistry}from"../../core/schema/runtime-schema.js";import{EXIT_CODE}from"../../core/shared/constants.js";import{PmCliError}from"../../core/shared/errors.js";import{nowIso}from"../../core/shared/time.js";import{createUnknownSubcommandError}from"../agent/subcommand-recovery.js";import{listAllItemMetadataLight}from"../../core/store/item-store.js";import{resolvePmRoot}from"../../core/store/paths.js";import{readSettings}from"../../core/store/settings.js";import{parseDirection,parseKinds,parseMaxDepth,parsePositiveInteger}from"../dependencies.js";import{analyzeGraphImpact,analyzeKnowledgeGraph,analyzeRelationshipExecution}from"../relationship-analytics.js";import{RelationshipGraph}from"../relationships.js";import{computeRelationshipDominators,detectRelationshipCommunities,findRedundantRelationshipEdges}from"./analytics.js";import{computeRelationshipCentrality,findRelationshipCutStructure}from"./centrality.js";import{analyzeRelationshipSchedule}from"./scheduling.js";import{deriveRelationshipDeadlines}from"./deadline-scheduling.js";import{assembleWorkspaceRelationshipGraph,getWorkspaceHierarchyIntegrity,resolveWorkspaceRelationshipKindRegistry}from"./assembly.js";import{computeWorkspaceGraphFingerprint,workspaceGraphCache}from"./cache.js";import{clearDurableGraphCache,durableGraphCacheStatus,loadGraphAuditBaseline,openDurableGraphCache,persistDurableGraphResult,saveGraphAuditBaseline,shouldPersistDurableGraphCache,GRAPH_DURABLE_CACHE_MIN_ITEMS}from"./durable-cache.js";import{auditWorkspaceRelationshipGraph,diffRelationshipAuditSnapshots}from"./governance.js";import{RELATIONSHIP_AUDIT_FINDING_CODES}from"./governance-contracts.js";import{planRelationshipRemediation}from"./remediation.js";import{enumerateRelationshipPaths,hierarchyAncestors,hierarchyDescendants,orderingPredecessors,orderingSuccessors}from"./traversal.js";import{GRAPH_SUBCOMMAND_VALUES}from"../cli-contracts/enum-contracts.js";import{assertProjectionModeChoice}from"../output-projection.js";const ROOTED_SUBCOMMANDS=new Set(["ancestors","descendants","predecessors","successors","paths","impact","dominators"]);const DEFAULT_SAMPLE_LIMIT=10;function attachGraphProjection(result,summary,rowGroup){let projected=result;if(summary&&result.subcommand==="audit"){const{nodes,recorded_nodes,edges,active_nodes,terminal_nodes,missing_nodes,ordering_acyclic,active_ordering_acyclic,coverage_by_lifecycle}=result.profile;const populations=Object.fromEntries(Object.entries(coverage_by_lifecycle).map(([key,population])=>{const{degree_histogram:_histogram,...counts}=population;return[key,counts]}));projected={...result,profile:{nodes,recorded_nodes,edges,active_nodes,terminal_nodes,missing_nodes,ordering_acyclic,active_ordering_acyclic,coverage_by_lifecycle:populations}}}return{...projected,projection:{mode:summary?"summary":"full",declared_field_groups:rowGroup===void 0?[]:[{name:rowGroup,restore_with:"--full"}],included_field_groups:rowGroup===void 0||summary?[]:[rowGroup]}}}function normalizeIdList(raw){if(raw===void 0)return[];return(Array.isArray(raw)?raw:[raw]).flatMap(value=>value.split(",")).map(value=>value.trim()).filter(value=>value.length>0)}function parseGraphSubcommand(raw,id,target){const candidate=raw.trim().toLowerCase();if(!GRAPH_SUBCOMMAND_VALUES.includes(candidate)){throw createUnknownSubcommandError({command_path:"graph",token:candidate||"<empty>",allowed:GRAPH_SUBCOMMAND_VALUES})}const subcommand=candidate;if(ROOTED_SUBCOMMANDS.has(subcommand)&&!id?.trim()){throw new PmCliError(`graph ${subcommand} requires an item id.`,EXIT_CODE.USAGE)}if(subcommand==="paths"&&!target?.trim()){throw new PmCliError("graph paths requires a source and a target item id.",EXIT_CODE.USAGE)}return subcommand}function rethrowGraphUsage(error){if(error instanceof TypeError)throw new PmCliError(error.message,EXIT_CODE.USAGE);throw error}function projectQueryMeta(meta){return{truncated:meta.truncated,cost:{visited_nodes:meta.visitedNodes,inspected_edges:meta.inspectedEdges}}}function canonicalizeGraphId(assembly,raw){const wanted=raw.trim().toLowerCase();for(const detail of assembly.details){if(detail.id.trim().toLowerCase()===wanted&&!assembly.missingIdSet.has(detail.id.toLowerCase())){return detail.id}}throw new PmCliError(`Item ${raw} not found`,EXIT_CODE.NOT_FOUND)}function runGraphTraversal(subcommand,root,invocation){const walk={ancestors:hierarchyAncestors,descendants:hierarchyDescendants,predecessors:orderingPredecessors,successors:orderingSuccessors}[subcommand];let result;try{result=walk(invocation.assembly.graph,root,{...invocation.kinds===void 0?{}:{kinds:invocation.kinds},...invocation.maxDepth===void 0?{}:{maxDepth:invocation.maxDepth},...invocation.limit===void 0?{}:{limit:invocation.limit},...invocation.after===void 0?{}:{after:invocation.after}})}catch(error){rethrowGraphUsage(error)}const meta=projectQueryMeta(result.meta);return{subcommand,root,count:result.value.length,...meta,...result.meta.nextCursor===void 0?{}:{next_cursor:result.meta.nextCursor},...invocation.summary?{}:{ids:result.value}}}function runGraphPaths(root,target,invocation){const result=enumerateRelationshipPaths(invocation.assembly.graph,root,target,{direction:invocation.direction,...invocation.kinds===void 0?{}:{kinds:invocation.kinds},...invocation.maxDepth===void 0?{}:{maxDepth:invocation.maxDepth},...invocation.maxPaths===void 0?{}:{maxPaths:invocation.maxPaths}});return{subcommand:"paths",root,target,direction:invocation.direction,count:result.value.length,...projectQueryMeta(result.meta),...invocation.summary?{}:{paths:result.value.map(path=>({nodes:path.nodes,kinds:path.edges.map(edge=>edge.kind),length:path.length}))}}}function runGraphImpact(root,invocation){let analysis;try{analysis=analyzeGraphImpact(invocation.assembly.graph,root,{direction:invocation.direction,...invocation.kinds===void 0?{}:{kinds:invocation.kinds},...invocation.maxDepth===void 0?{}:{maxDepth:invocation.maxDepth},...invocation.unbounded?{}:{limit:invocation.limit??DEFAULT_SAMPLE_LIMIT},...invocation.after===void 0?{}:{after:invocation.after}})}catch(error){rethrowGraphUsage(error)}return{subcommand:"impact",root,direction:invocation.direction,count:analysis.affected.length,truncated:analysis.truncated,...analysis.nextCursor===void 0?{}:{next_cursor:analysis.nextCursor},cost:{visited_nodes:analysis.cost.visitedNodes,inspected_edges:analysis.cost.inspectedEdges},...invocation.summary?{}:{affected:analysis.affected}}}function buildGraphExecutionSummary(execution,summary,sampleLimit){return{acyclic:execution.acyclic,ordered_node_count:execution.order.length,layer_count:execution.layers.length,frontier_count:execution.frontier.length,critical_path_length:execution.criticalPathLength,cycle_count:execution.cycles.length,...summary?{}:{frontier:execution.frontier.slice(0,sampleLimit),critical_path:execution.criticalPath.slice(0,sampleLimit),cycles:execution.cycles.slice(0,sampleLimit)}}}function buildGraphKnowledgeSummary(knowledge,summary,sampleLimit){return{component_count:knowledge.components.length,largest_component_size:knowledge.components[0]?.length??0,orphan_count:knowledge.orphans.length,...summary?{}:{orphans:knowledge.orphans.slice(0,sampleLimit),hubs:knowledge.hubs.slice(0,sampleLimit)}}}function buildGraphHierarchySummary(hierarchy,summary,sampleLimit){let legacyCycleCount=0;let legacyCardinalityCount=0;let legacyDivergenceCount=0;for(const finding of hierarchy.cycles){legacyCycleCount+=Number(finding.legacy_terminal)}for(const finding of hierarchy.cardinality_violations){legacyCardinalityCount+=Number(finding.legacy_terminal)}for(const finding of hierarchy.divergences){legacyDivergenceCount+=Number(finding.legacy_terminal)}return{acyclic:hierarchy.cycles.length===0,relation_count:hierarchy.relations.length,cycle_count:hierarchy.cycles.length,active_cycle_count:hierarchy.cycles.length-legacyCycleCount,legacy_cycle_count:legacyCycleCount,cardinality_violation_count:hierarchy.cardinality_violations.length,active_cardinality_violation_count:hierarchy.cardinality_violations.length-legacyCardinalityCount,legacy_cardinality_violation_count:legacyCardinalityCount,parent_divergence_count:hierarchy.divergences.length,active_parent_divergence_count:hierarchy.divergences.length-legacyDivergenceCount,legacy_parent_divergence_count:legacyDivergenceCount,...summary?{}:{cycles:hierarchy.cycles.slice(0,sampleLimit).map(cycle=>cycle.item_ids)}}}function runGraphAnalyze(invocation){const graph=invocation.assembly.graph;const sampleLimit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const execution=analyzeRelationshipExecution(graph,{registry:graph.registry()});const knowledge=analyzeKnowledgeGraph(graph);return{subcommand:"analyze",node_count:graph.nodes().length,edge_count:graph.edges().length,edge_basis:"deduplicated_directed",sample_limit:sampleLimit,execution:buildGraphExecutionSummary(execution,invocation.summary,sampleLimit),knowledge:buildGraphKnowledgeSummary(knowledge,invocation.summary,sampleLimit),hierarchy:buildGraphHierarchySummary(getWorkspaceHierarchyIntegrity(invocation.assembly),invocation.summary,sampleLimit)}}function runGraphAudit(invocation,isTerminal){const report=auditWorkspaceRelationshipGraph(invocation.assembly,{isTerminal,...invocation.sample===void 0?{}:{maxSampleSize:invocation.sample},...invocation.exemptIsolates.length===0?{}:{exemptIsolates:invocation.exemptIsolates},...invocation.exemptIsolateTypes.length===0?{}:{isolateExemptTypes:invocation.exemptIsolateTypes}});const bySeverity={};const byCode={};const affectedBySeverity={};const affectedByCode={};for(const finding of report.findings){bySeverity[finding.severity]=(bySeverity[finding.severity]??0)+1;byCode[finding.code]=(byCode[finding.code]??0)+1;affectedBySeverity[finding.severity]=(affectedBySeverity[finding.severity]??0)+finding.count;affectedByCode[finding.code]=(affectedByCode[finding.code]??0)+finding.count}const{finding_subjects_by_code:_findingSubjects,...compactProfile}=report.profile;return{subcommand:"audit",finding_count:report.findings.length,findings_by_severity:bySeverity,findings_by_code:byCode,affected_subjects_by_severity:affectedBySeverity,affected_subjects_by_code:affectedByCode,profile:invocation.summary?compactProfile:report.profile,legacy_alias_counts:invocation.assembly.legacyAliasCounts,...invocation.summary?{}:{findings:report.findings}}}function runGraphCommunities(invocation){const sampleLimit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const options={};if(invocation.kinds!==void 0)options.kinds=invocation.kinds;const result=detectRelationshipCommunities(invocation.assembly.graph,options);const analysis=result.value;return{subcommand:"communities",community_count:analysis.communities.length,largest_community_size:analysis.communities[0]?.size??0,iterations:analysis.iterations,converged:analysis.converged,truncated:!analysis.converged||analysis.communities.length>sampleLimit,cost:{visited_nodes:result.meta.visitedNodes,inspected_edges:result.meta.inspectedEdges},...invocation.summary?{}:{communities:analysis.communities.slice(0,sampleLimit).map(community=>({representative:community.representative,size:community.size,members:community.members.slice(0,sampleLimit)}))}}}function runGraphRedundancy(invocation){let result;try{result=findRedundantRelationshipEdges(invocation.assembly.graph,{...invocation.kinds===void 0?{}:{kinds:invocation.kinds},...invocation.maxDepth===void 0?{}:{maxDepth:invocation.maxDepth},...invocation.limit===void 0?{}:{limit:invocation.limit}})}catch(error){rethrowGraphUsage(error)}return{subcommand:"redundancy",redundant_count:result.value.length,...projectQueryMeta(result.meta),...invocation.summary?{}:{redundant:result.value.map(row=>({source:row.edge.source,target:row.edge.target,kind:row.edge.kind,witness:row.witness}))}}}function runGraphDominators(root,invocation){const limit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const result=computeRelationshipDominators(invocation.assembly.graph,root,{direction:invocation.direction,...invocation.kinds===void 0?{}:{kinds:invocation.kinds},...invocation.maxDepth===void 0?{}:{maxDepth:invocation.maxDepth}});const bottlenecks=result.value.rows.filter(row=>row.dominatedCount>0);return{subcommand:"dominators",root,direction:invocation.direction,reachable_count:result.value.reachableCount,bottleneck_count:bottlenecks.length,truncated:result.meta.truncated||bottlenecks.length>limit,cost:{visited_nodes:result.meta.visitedNodes,inspected_edges:result.meta.inspectedEdges},...invocation.summary?{}:{bottlenecks:bottlenecks.slice(0,limit).map(row=>({id:row.id,idom:row.idom,dominated_count:row.dominatedCount}))}}}function runGraphSlack(invocation){const limit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const analysis=analyzeRelationshipSchedule(invocation.assembly.graph);const criticalCount=analysis.rows.filter(row=>row.critical).length;return{subcommand:"slack",acyclic:analysis.acyclic,makespan:analysis.makespan,scheduled_count:analysis.scheduledCount,critical_count:criticalCount,critical_path_length:analysis.criticalPathLength,cycle_count:analysis.cycles.length,truncated:analysis.rows.length>limit,...invocation.summary?{}:{critical_path:analysis.criticalPath,rows:analysis.rows.slice(0,limit).map(row=>({id:row.id,earliest_start:row.earliestStart,latest_start:row.latestStart,slack:row.slack,critical:row.critical}))}}}function runGraphCentrality(invocation){const limit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const result=computeRelationshipCentrality(invocation.assembly.graph,invocation.kinds===void 0?{}:{kinds:invocation.kinds});const analysis=result.value;return{subcommand:"centrality",node_count:analysis.nodeCount,edge_count:analysis.edgeCount,edge_basis:"simple_undirected",truncated:analysis.rows.length>limit,cost:{visited_nodes:result.meta.visitedNodes,inspected_edges:result.meta.inspectedEdges},...invocation.summary?{}:{rows:analysis.rows.slice(0,limit).map(row=>({id:row.id,degree:row.degree,in_degree:row.inDegree,out_degree:row.outDegree,betweenness:row.betweenness,closeness:row.closeness}))}}}function runGraphArticulation(invocation){const limit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const result=findRelationshipCutStructure(invocation.assembly.graph,invocation.kinds===void 0?{}:{kinds:invocation.kinds});const{articulationPoints,bridges}=result.value;return{subcommand:"articulation",articulation_count:articulationPoints.length,bridge_count:bridges.length,truncated:articulationPoints.length>limit||bridges.length>limit,cost:{visited_nodes:result.meta.visitedNodes,inspected_edges:result.meta.inspectedEdges},...invocation.summary?{}:{articulation_points:articulationPoints.slice(0,limit),bridges:bridges.slice(0,limit)}}}function runGraphPlan(invocation,isTerminal){const limit=invocation.limit??DEFAULT_SAMPLE_LIMIT;const plan=planRelationshipRemediation(invocation.assembly,{isTerminal,redundancyLimit:limit,...invocation.sample===void 0?{}:{maxSampleSize:invocation.sample},...invocation.exemptIsolates.length===0?{}:{exemptIsolates:invocation.exemptIsolates},...invocation.exemptIsolateTypes.length===0?{}:{isolateExemptTypes:invocation.exemptIsolateTypes}});const byOp={};const byCode={};for(const step of plan.steps){byOp[step.op]=(byOp[step.op]??0)+1;byCode[step.code]=(byCode[step.code]??0)+1}return{subcommand:"plan",step_count:plan.steps.length,steps_by_op:byOp,steps_by_code:byCode,finding_count:plan.report.findings.length,truncated:plan.truncated||plan.steps.length>limit,cost:{visited_nodes:plan.cost.visitedNodes,inspected_edges:plan.cost.inspectedEdges},...invocation.summary?{}:{steps:plan.steps.slice(0,limit)}}}function buildGraphQueryKey(subcommand,root,pathsTarget,invocation){return JSON.stringify({subcommand,root:root??null,target:pathsTarget??null,kinds:invocation.kinds??null,maxDepth:invocation.maxDepth??null,limit:invocation.limit??null,after:invocation.after??null,direction:invocation.direction,maxPaths:invocation.maxPaths??null,sample:invocation.sample??null,exemptIsolates:[...new Set(invocation.exemptIsolates.map(id=>id.toLowerCase()))].sort(),exemptIsolateTypes:[...new Set(invocation.exemptIsolateTypes.map(type=>type.toLowerCase()))].sort(),summary:invocation.summary,unbounded:invocation.unbounded})}function executeGraphSubcommand(subcommand,root,pathsTarget,invocation,isTerminal){if(subcommand==="analyze")return runGraphAnalyze(invocation);if(subcommand==="audit")return runGraphAudit(invocation,isTerminal);if(subcommand==="plan")return runGraphPlan(invocation,isTerminal);if(subcommand==="communities")return runGraphCommunities(invocation);if(subcommand==="redundancy")return runGraphRedundancy(invocation);if(subcommand==="dominators")return runGraphDominators(root,invocation);if(subcommand==="slack")return runGraphSlack(invocation);if(subcommand==="centrality")return runGraphCentrality(invocation);if(subcommand==="articulation")return runGraphArticulation(invocation);if(subcommand==="paths")return runGraphPaths(root,pathsTarget,invocation);if(subcommand==="impact")return runGraphImpact(root,invocation);return runGraphTraversal(subcommand,root,invocation)}function assertGraphFlagScope(subcommand,options){if(subcommand!=="index"&&(options.rebuild===true||options.clear===true))throw new PmCliError("--rebuild and --clear apply only to graph index.",EXIT_CODE.USAGE);if(subcommand!=="audit"&&options.saveBaseline===true)throw new PmCliError("--save-baseline applies only to graph audit.",EXIT_CODE.USAGE);if(subcommand==="slack"&&options.kind!==void 0)throw new PmCliError("graph slack analyzes every ordering kind; --kind is not supported.",EXIT_CODE.USAGE);if(options.rebuild===true&&options.clear===true)throw new PmCliError("graph index accepts either --rebuild or --clear, not both.",EXIT_CODE.USAGE);if(subcommand==="impact"&&options.full===true&&options.limit!==void 0)throw new PmCliError("graph impact accepts either --full or --limit, not both.",EXIT_CODE.USAGE)}async function runGraphIndex(pmRoot,fingerprint,invocation,itemCount,isTerminal,options){let action="status";if(options.clear===true){await clearDurableGraphCache(pmRoot);action="cleared"}if(options.rebuild===true){await clearDurableGraphCache(pmRoot);const view=await openDurableGraphCache(pmRoot,fingerprint);const warmInvocation={assembly:invocation.assembly,direction:"both",exemptIsolates:[],exemptIsolateTypes:[],saveBaseline:false,summary:true,unbounded:false};for(const warm of["analyze","audit"]){await persistDurableGraphResult(pmRoot,fingerprint,view,buildGraphQueryKey(warm,void 0,void 0,warmInvocation),executeGraphSubcommand(warm,void 0,void 0,warmInvocation,isTerminal))}action="rebuilt"}const status=await durableGraphCacheStatus(pmRoot,fingerprint);return{subcommand:"index",action,state:status.exists?status.fresh?"fresh":"stale":"absent",entry_count:status.entry_count,item_count:itemCount,min_items_threshold:GRAPH_DURABLE_CACHE_MIN_ITEMS,persist_enabled:shouldPersistDurableGraphCache(itemCount,status.exists),current_fingerprint:fingerprint.slice(0,12),...status.saved_at===void 0?{}:{saved_at:status.saved_at},...status.bytes===void 0?{}:{bytes:status.bytes}}}async function applyAuditBaseline(pmRoot,fingerprint,audit,saveBaseline){const current={saved_at:new Date().toISOString(),fingerprint,affected_subjects_by_code:audit.affected_subjects_by_code,profile:{...audit.profile,finding_subjects_by_code:Object.fromEntries(RELATIONSHIP_AUDIT_FINDING_CODES.map(code=>[code,audit.affected_subjects_by_code[code]??0]))}};const stored=await loadGraphAuditBaseline(pmRoot);if(saveBaseline)await saveGraphAuditBaseline(pmRoot,current);return stored===void 0?audit:{...audit,baseline:diffRelationshipAuditSnapshots(stored,current)}}async function persistDurableGraphResultBestEffort(pmRoot,fingerprint,view,queryKey,result){try{await persistDurableGraphResult(pmRoot,fingerprint,view,queryKey,result)}catch{}}function attachDeadlineSchedule(value,invocation,items,isTerminal){if(value.subcommand!=="slack")return;const terminal=new Set(invocation.assembly.details.filter(detail=>isTerminal(detail.status)).map(detail=>detail.id));const graph=invocation.assembly.graph;const activeGraph=new RelationshipGraph(graph.nodes().filter(id=>!terminal.has(id)),graph.edges().filter(edge=>!terminal.has(edge.source)&&!terminal.has(edge.target)),graph.registry());const analysis=deriveRelationshipDeadlines(activeGraph,items.filter(item=>!terminal.has(item.id)),{now:nowIso(),limit:invocation.limit??DEFAULT_SAMPLE_LIMIT});const{rows,residuals,overcommitted,...counts}=analysis;value.deadline_schedule={population:"active",...counts,...invocation.summary?{}:{rows,residuals,overcommitted}}}async function runGraph(subcommandRaw,id,target,options,global2){const subcommand=parseGraphSubcommand(subcommandRaw,id,target);assertProjectionModeChoice(options.summary===true,options.full===true,"--summary");const pmRoot=resolvePmRoot(process.cwd(),global2.path);await assertInitializedTracker(pmRoot);const settings=await readSettings(pmRoot);const typeRegistry=resolveItemTypeRegistry(settings,getActiveExtensionRegistrations());const items=await listAllItemMetadataLight(pmRoot,settings.item_format,typeRegistry.type_to_folder,void 0,settings.schema);const statusRegistry=resolveRuntimeStatusRegistry(settings.schema);const isTerminal=status=>isTerminalStatus(status,statusRegistry);assertGraphFlagScope(subcommand,options);const relationshipRegistry=resolveWorkspaceRelationshipKindRegistry();const kinds=parseKinds(options.kind,relationshipRegistry);const lookup=workspaceGraphCache().lookup(pmRoot,computeWorkspaceGraphFingerprint(items,isTerminal,relationshipRegistry),()=>assembleWorkspaceRelationshipGraph(items,isTerminal,relationshipRegistry));const invocation={assembly:lookup.assembly,...kinds===void 0?{}:{kinds},maxDepth:parseMaxDepth(options.maxDepth),limit:parsePositiveInteger(options.limit,"limit"),after:options.after?.trim()||void 0,direction:parseDirection(options.direction),maxPaths:parsePositiveInteger(options.maxPaths,"max-paths"),sample:parsePositiveInteger(options.sample,"sample"),exemptIsolates:normalizeIdList(options.exemptIsolate),exemptIsolateTypes:normalizeIdList(options.exemptIsolateType),saveBaseline:options.saveBaseline===true,summary:options.summary===true,unbounded:options.full===true};if(subcommand==="index"){return attachGraphProjection(await runGraphIndex(pmRoot,lookup.fingerprint,invocation,items.length,isTerminal,options),false)}const root=ROOTED_SUBCOMMANDS.has(subcommand)?canonicalizeGraphId(invocation.assembly,id):void 0;const pathsTarget=subcommand==="paths"?canonicalizeGraphId(invocation.assembly,target):void 0;const queryKey=buildGraphQueryKey(subcommand,root,pathsTarget,invocation);const durableView=await openDurableGraphCache(pmRoot,lookup.fingerprint);const durableValue=durableView.results[queryKey];const memo=lookup.memoize(queryKey,()=>durableValue!==void 0?structuredClone(durableValue):executeGraphSubcommand(subcommand,root,pathsTarget,invocation,isTerminal));const persistEnabled=shouldPersistDurableGraphCache(items.length,durableView.exists);if(!memo.reused&&durableValue===void 0&&persistEnabled){await persistDurableGraphResultBestEffort(pmRoot,lookup.fingerprint,durableView,queryKey,memo.value)}const value=memo.value.subcommand==="audit"?await applyAuditBaseline(pmRoot,lookup.fingerprint,memo.value,invocation.saveBaseline):memo.value;value.cache={fingerprint:lookup.fingerprint.slice(0,12),assembly:lookup.assemblyReused?"hit":"miss",result:memo.reused?"hit":"miss",durable:durableValue!==void 0?"hit":persistEnabled?"miss":"off"};attachDeadlineSchedule(value,invocation,items,isTerminal);return attachGraphProjection(value,invocation.summary,"result_rows")}export{GRAPH_SUBCOMMAND_VALUES,parseGraphSubcommand,runGraph};
 //# sourceMappingURL=run.js.map
-//# debugId=8797dddf-3643-554b-ba7f-4c513535c154