@unbrained/pm-cli 2026.7.17 → 2026.7.18

package/dist/cli-bundle/sdk.js

@@ -12,7 +12,7 @@ import {
   parseBootstrapHelpRequest,
   parseBootstrapTypeValue,
   stripGlobalBootstrapTokens
-} from "./chunks/chunk-XYJK6GIQ.js";
+} from "./chunks/chunk-TGBTLGPX.js";
 import {
   PM_CLI_EXPECTED_ERROR_NAME,
   PmClient,
@@ -46,6 +46,7 @@ import {
   get,
   getContracts,
   getWorkspaceContracts,
+  graph,
   health,
   historyCompact,
   historyCompactBulk,
@@ -124,7 +125,7 @@ import {
   update,
   upgrade,
   validate
-} from "./chunks/chunk-V3VBXQQV.js";
+} from "./chunks/chunk-I3INI567.js";
 import "./chunks/chunk-6X5MZ5R2.js";
 import "./chunks/chunk-3HKUXVKV.js";
 import "./chunks/chunk-PNTULOGU.js";
@@ -159,20 +160,10 @@ import {
   runValidate,
   scanHistoryAuthorAttribution,
   summarizeContextPreflight
-} from "./chunks/chunk-LLODAQMP.js";
+} from "./chunks/chunk-F3VC3GOV.js";
 import {
   runDocs
 } from "./chunks/chunk-D5XHO4Q7.js";
-import {
-  RelationshipGraph,
-  RelationshipKindRegistry,
-  buildRelationshipContext,
-  collectDanglingDependencyReferences,
-  createRelationshipKindRegistry,
-  dependencyToRelationship,
-  isOrderingRelationshipKind,
-  runDeps
-} from "./chunks/chunk-MSGETE6I.js";
 import "./chunks/chunk-2FUOXSRN.js";
 import "./chunks/chunk-NNANAWFH.js";
 import "./chunks/chunk-OWP6QFBV.js";
@@ -196,7 +187,7 @@ import {
   runTemplatesList,
   runTemplatesSave,
   runTemplatesShow
-} from "./chunks/chunk-3D4YVTNG.js";
+} from "./chunks/chunk-TZAE66GQ.js";
 import "./chunks/chunk-LSOWTLEM.js";
 import "./chunks/chunk-6DYOZS6C.js";
 import "./chunks/chunk-ZHBI2AP7.js";
@@ -221,11 +212,11 @@ import {
   sortLinkedArtifacts,
   validateLinkedPaths
 } from "./chunks/chunk-FVNWHUME.js";
-import "./chunks/chunk-G6KM4YKY.js";
-import "./chunks/chunk-CFSUNEL7.js";
+import "./chunks/chunk-RXPQ5Q23.js";
+import "./chunks/chunk-XWBD6DSR.js";
 import "./chunks/chunk-WL3SS45P.js";
 import "./chunks/chunk-5HGZKQUL.js";
-import "./chunks/chunk-HXVHBERL.js";
+import "./chunks/chunk-HPAYDSR2.js";
 import {
   PLAN_SHOW_DEPTH_VALUES,
   PLAN_SUBCOMMANDS,
@@ -318,7 +309,7 @@ import "./chunks/chunk-KAE727L2.js";
 import {
   _testOnlyConfigCommand,
   runConfig
-} from "./chunks/chunk-23TCGBRK.js";
+} from "./chunks/chunk-ADXDCAKP.js";
 import {
   INIT_AGENT_GUIDANCE_MODE_VALUES,
   PM_PACKAGE_CONVENTIONAL_RESOURCE_ROOTS,
@@ -331,7 +322,7 @@ import {
   runInit,
   runInitAgentGuidance,
   summarizeInitResult
-} from "./chunks/chunk-2MPMKJF2.js";
+} from "./chunks/chunk-DHNG452T.js";
 import "./chunks/chunk-2XOSFSTH.js";
 import "./chunks/chunk-2BX74BAS.js";
 import {
@@ -349,12 +340,38 @@ import {
   DEFAULT_CHILD_SAMPLE_LIMIT,
   DEFAULT_EVAL_QUERIES_RELATIVE_PATH,
   MAX_CHILD_PROJECTION_ITEMS,
+  analyzeGraphImpact,
+  analyzeKnowledgeGraph,
+  analyzeRelationshipExecution,
+  auditWorkspaceRelationshipGraph,
   buildItemChildrenRollup,
   buildItemSchedule,
+  collectDuplicateRelationshipEdgeGroups,
+  compareRelationshipSnapshots,
+  computeRelationshipDominators,
+  detectRelationshipCommunities,
+  enumerateRelationshipPaths,
+  findRedundantRelationshipEdges,
+  formatDuplicateEdgeGroup,
+  hierarchyAncestors,
+  hierarchyDescendants,
   itemHasSchedule,
+  orderingPredecessors,
+  orderingSuccessors,
+  parseGraphSubcommand,
+  planRelationshipRemediation,
   runEval,
+  runGraph,
   runSearch
-} from "./chunks/chunk-S46R2M3W.js";
+} from "./chunks/chunk-GKPCTQYG.js";
+import {
+  WorkspaceGraphCache,
+  buildRelationshipContext,
+  computeWorkspaceGraphFingerprint,
+  resetWorkspaceGraphCache,
+  runDeps,
+  workspaceGraphCache
+} from "./chunks/chunk-3QDR6ZLU.js";
 import {
   CONTEXT_EVALUATION_METRIC_NAMES,
   CONTEXT_PACKING_PROFILES,
@@ -373,14 +390,24 @@ import {
   scoreContextCandidates,
   scoreContextCandidatesWithActiveExtensions,
   summarizeContextEvaluationReports
-} from "./chunks/chunk-DCC2AQBD.js";
+} from "./chunks/chunk-OGVTB5VO.js";
+import {
+  RelationshipGraph,
+  RelationshipKindRegistry,
+  assembleWorkspaceRelationshipGraph,
+  collectDanglingDependencyReferences,
+  collectMissingDependencyTargetIds,
+  createRelationshipKindRegistry,
+  dependencyToRelationship,
+  isOrderingRelationshipKind
+} from "./chunks/chunk-3CUQZNQ6.js";
 import "./chunks/chunk-KWYX6ZIR.js";
 import {
   parseIntegerLimit,
   parsePriority,
   parseType,
   runList
-} from "./chunks/chunk-7LTCLTRG.js";
+} from "./chunks/chunk-AXRT7K5V.js";
 import {
   QUERY_CURSOR_CONTRACT,
   createQueryFingerprint,
@@ -419,7 +446,7 @@ import "./chunks/chunk-CYCJBU3I.js";
 import {
   refreshSemanticEmbeddingsForMutatedItems,
   runSemanticRefreshWorker
-} from "./chunks/chunk-B6SH2YNN.js";
+} from "./chunks/chunk-7R6UIHYY.js";
 import {
   ACTIVITY_COMMANDER_STRING_OPTION_CONTRACTS,
   APPEND_FLAG_CONTRACTS,
@@ -465,6 +492,7 @@ import {
   GC_FLAG_CONTRACTS,
   GET_FLAG_CONTRACTS,
   GLOBAL_FLAG_CONTRACTS,
+  GRAPH_SUBCOMMAND_VALUES,
   GUIDE_FLAG_CONTRACTS,
   HEALTH_FLAG_CONTRACTS,
   HISTORY_COMPACT_FLAG_CONTRACTS,
@@ -543,7 +571,7 @@ import {
   resolveSubcommandFlagContractsForCommand,
   toCompletionFlagString,
   withFlagAliasMetadata
-} from "./chunks/chunk-S6FF7VW6.js";
+} from "./chunks/chunk-WQXRZMFN.js";
 import {
   LINKED_TEST_ENV_NAME_PATTERN,
   LINKED_TEST_PM_CONTEXT_MODE_VALUES,
@@ -571,8 +599,13 @@ import {
   isHostOutputSuppressed,
   suppressHostOutput
 } from "./chunks/chunk-EHJFUOXL.js";
-import "./chunks/chunk-37V5MXAU.js";
-import "./chunks/chunk-P56LKFQX.js";
+import "./chunks/chunk-TLWJP5BF.js";
+import {
+  collectBlockedByIds,
+  collectDependencyBlockedIds,
+  computeActionabilityReport,
+  resolveItemBlockers
+} from "./chunks/chunk-BDA35QG5.js";
 import {
   BASELINE_ITEM_FORMAT_VERSION,
   CURRENT_ITEM_FORMAT_VERSION,
@@ -663,301 +696,32 @@ async function flushTelemetryQueue() {
   await flushTelemetryQueueNow();
 }
 
-// dist/sdk/query/item-filter-options.js
+// dist/sdk/graph/index.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] = "9a39e914-a4b4-5812-80a6-8240a2c1879b");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "fc1760dc-36e8-522f-8e91-28fa04f269a0");
   } catch (e2) {
   }
 })();
 
-// dist/sdk/output.js
+// dist/sdk/query/item-filter-options.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] = "fee22fbe-b4a1-5524-9df1-7be06fb07427");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "9a39e914-a4b4-5812-80a6-8240a2c1879b");
   } catch (e2) {
   }
 })();
 
-// dist/sdk/relationship-analytics.js
+// dist/sdk/output.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] = "0a54b889-6d5c-565c-85ff-47e5cce68a32");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "fee22fbe-b4a1-5524-9df1-7be06fb07427");
   } catch (e2) {
   }
 })();
-function appendNeighbor(adjacency, source, target) {
-  adjacency.get(source).add(target);
-}
-function createAdjacency(nodes) {
-  return new Map(nodes.map((node) => [node, /* @__PURE__ */ new Set()]));
-}
-function sortComponents(components) {
-  for (const component of components)
-    component.sort();
-  return components.sort((left, right) => right.length - left.length || left[0].localeCompare(right[0]));
-}
-function stableJsonValue(value) {
-  if (Array.isArray(value))
-    return value.map((entry) => stableJsonValue(entry));
-  if (value === null || typeof value !== "object")
-    return value;
-  const toJSON = value.toJSON;
-  if (typeof toJSON === "function")
-    return stableJsonValue(toJSON.call(value));
-  return Object.fromEntries(Object.entries(value).sort(([left], [right]) => left.localeCompare(right)).map(([key, entry]) => [key, stableJsonValue(entry)]));
-}
-function relationshipEdgeKey(edge) {
-  return JSON.stringify(stableJsonValue(edge));
-}
-function appendFinishingOrder(start, adjacency, visited, order) {
-  const stack = [{ id: start, expanded: false }];
-  while (stack.length > 0) {
-    const current = stack.pop();
-    if (current.expanded) {
-      order.push(current.id);
-      continue;
-    }
-    if (visited.has(current.id))
-      continue;
-    visited.add(current.id);
-    stack.push({ id: current.id, expanded: true });
-    const neighbors = [...adjacency.get(current.id)].sort().reverse();
-    for (const neighbor of neighbors)
-      if (!visited.has(neighbor))
-        stack.push({ id: neighbor, expanded: false });
-  }
-}
-function computeFinishingOrder(nodes, adjacency) {
-  const visited = /* @__PURE__ */ new Set();
-  const order = [];
-  for (const start of nodes)
-    if (!visited.has(start))
-      appendFinishingOrder(start, adjacency, visited, order);
-  return order;
-}
-function collectReverseComponents(order, reverse) {
-  const visited = /* @__PURE__ */ new Set();
-  const components = [];
-  for (const start of [...order].reverse()) {
-    if (visited.has(start))
-      continue;
-    const component = [];
-    const stack = [start];
-    visited.add(start);
-    while (stack.length > 0) {
-      const current = stack.pop();
-      component.push(current);
-      for (const neighbor of reverse.get(current)) {
-        if (visited.has(neighbor))
-          continue;
-        visited.add(neighbor);
-        stack.push(neighbor);
-      }
-    }
-    components.push(component);
-  }
-  return sortComponents(components);
-}
-function stronglyConnectedComponents(nodes, adjacency) {
-  const reverse = createAdjacency(nodes);
-  for (const [source, targets] of adjacency)
-    for (const target of targets)
-      appendNeighbor(reverse, target, source);
-  return collectReverseComponents(computeFinishingOrder(nodes, adjacency), reverse);
-}
-function buildExecutionAdjacency(graph, registry) {
-  const adjacency = createAdjacency(graph.nodes());
-  for (const edge of graph.edges()) {
-    const definition = registry.require(edge.kind);
-    if (!definition.ordering)
-      continue;
-    const sourceFirst = (definition.precedence ?? "source_before_target") === "source_before_target";
-    appendNeighbor(adjacency, sourceFirst ? edge.source : edge.target, sourceFirst ? edge.target : edge.source);
-  }
-  return adjacency;
-}
-function topologicalLayers(nodes, adjacency) {
-  const indegree = new Map(nodes.map((node) => [node, 0]));
-  for (const targets of adjacency.values())
-    for (const target of targets)
-      indegree.set(target, indegree.get(target) + 1);
-  let frontier = nodes.filter((node) => indegree.get(node) === 0).sort();
-  const layers = [];
-  while (frontier.length > 0) {
-    layers.push(frontier);
-    const next2 = [];
-    for (const source of frontier) {
-      for (const target of adjacency.get(source)) {
-        const remaining = indegree.get(target) - 1;
-        indegree.set(target, remaining);
-        if (remaining === 0)
-          next2.push(target);
-      }
-    }
-    frontier = next2.sort();
-  }
-  return layers;
-}
-function longestPath(order, adjacency) {
-  const depth = new Map(order.map((node) => [node, 0]));
-  const parent = /* @__PURE__ */ new Map();
-  for (const source of order) {
-    for (const target of adjacency.get(source)) {
-      if (!depth.has(target))
-        continue;
-      const candidate = depth.get(source) + 1;
-      const currentParent = parent.get(target);
-      if (candidate > depth.get(target) || candidate === depth.get(target) && (currentParent === void 0 || source.localeCompare(currentParent) < 0)) {
-        depth.set(target, candidate);
-        parent.set(target, source);
-      }
-    }
-  }
-  const end = [...order].sort((left, right) => depth.get(right) - depth.get(left) || left.localeCompare(right))[0];
-  const path2 = end === void 0 ? [] : [end];
-  while (path2[0] !== void 0 && parent.has(path2[0]))
-    path2.unshift(parent.get(path2[0]));
-  return { depth: Object.fromEntries(depth), path: path2 };
-}
-function reconstructImpactPath(root, target, parents) {
-  const path2 = [target];
-  let cursor = target;
-  while (cursor !== root) {
-    cursor = parents.get(cursor);
-    path2.push(cursor);
-  }
-  return path2.reverse();
-}
-function analyzeRelationshipExecution(graph, options = {}) {
-  const registry = options.registry ?? createRelationshipKindRegistry();
-  const nodes = [...graph.nodes()];
-  const adjacency = buildExecutionAdjacency(graph, registry);
-  const layers = topologicalLayers(nodes, adjacency);
-  const order = layers.flat();
-  const acyclic = order.length === nodes.length;
-  const cycles = acyclic ? [] : stronglyConnectedComponents(nodes, adjacency).filter((component) => component.length > 1 || adjacency.get(component[0]).has(component[0]));
-  const longest = longestPath(order, adjacency);
-  return {
-    exact: true,
-    acyclic,
-    order,
-    layers,
-    frontier: layers[0] ?? [],
-    depth: longest.depth,
-    criticalPath: longest.path,
-    criticalPathLength: Math.max(0, longest.path.length - 1),
-    cycles,
-    provenance: { algorithm: "kahn-longest-path", edgeFamily: "ordering" }
-  };
-}
-function analyzeGraphImpact(graph, root, options = {}) {
-  const direction = options.direction ?? "outgoing";
-  const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
-  const limit = options.limit ?? Number.POSITIVE_INFINITY;
-  const queue = [{ id: root, depth: 0 }];
-  const seen = /* @__PURE__ */ new Set([root]);
-  const parents = /* @__PURE__ */ new Map();
-  const affected = [];
-  let visitedNodes = 0;
-  let inspectedEdges = 0;
-  let truncated = false;
-  traversal: for (let index = 0; index < queue.length; index += 1) {
-    options.signal?.throwIfAborted();
-    const current = queue[index];
-    visitedNodes += 1;
-    const adjacent = graph.adjacency(current.id, {
-      direction,
-      kinds: options.kinds,
-      signal: options.signal
-    });
-    inspectedEdges += adjacent.meta.inspectedEdges;
-    if (current.depth >= maxDepth) {
-      if (adjacent.value.some((id) => !seen.has(id)))
-        truncated = true;
-      continue;
-    }
-    for (const id of adjacent.value) {
-      if (seen.has(id))
-        continue;
-      if (affected.length >= limit) {
-        truncated = true;
-        break traversal;
-      }
-      seen.add(id);
-      parents.set(id, current.id);
-      const depth = current.depth + 1;
-      affected.push({
-        id,
-        distance: depth,
-        path: reconstructImpactPath(root, id, parents)
-      });
-      queue.push({ id, depth });
-    }
-  }
-  return {
-    root,
-    affected,
-    exact: true,
-    truncated,
-    cost: { visitedNodes, inspectedEdges }
-  };
-}
-function analyzeKnowledgeGraph(graph) {
-  const nodes = [...graph.nodes()];
-  const weak = createAdjacency(nodes);
-  const directed = createAdjacency(nodes);
-  for (const edge of graph.edges()) {
-    appendNeighbor(weak, edge.source, edge.target);
-    appendNeighbor(weak, edge.target, edge.source);
-    appendNeighbor(directed, edge.source, edge.target);
-  }
-  const components = [];
-  const visited = /* @__PURE__ */ new Set();
-  for (const start of nodes) {
-    if (visited.has(start))
-      continue;
-    const component = [];
-    const stack = [start];
-    visited.add(start);
-    while (stack.length > 0) {
-      const current = stack.pop();
-      component.push(current);
-      for (const neighbor of weak.get(current)) {
-        if (visited.has(neighbor))
-          continue;
-        visited.add(neighbor);
-        stack.push(neighbor);
-      }
-    }
-    components.push(component);
-  }
-  const degrees = nodes.map((id) => ({ id, degree: weak.get(id).size }));
-  const maximum = Math.max(0, ...degrees.map(({ degree }) => degree));
-  return {
-    components: sortComponents(components),
-    stronglyConnected: stronglyConnectedComponents(nodes, directed),
-    orphans: degrees.filter(({ degree }) => degree === 0).map(({ id }) => id),
-    hubs: degrees.filter(({ degree }) => degree > 0 && degree === maximum),
-    exact: true,
-    provenance: { algorithm: "component-degree", edgeFamily: "all" }
-  };
-}
-function compareRelationshipSnapshots(before, after) {
-  const earlier = new Map(before.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
-  const later = new Map(after.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
-  return {
-    fromVersion: before.version,
-    toVersion: after.version,
-    added: [...later].filter(([key]) => !earlier.has(key)).map(([, edge]) => edge),
-    removed: [...earlier].filter(([key]) => !later.has(key)).map(([, edge]) => edge),
-    unchangedCount: [...earlier.keys()].filter((key) => later.has(key)).length,
-    exact: true
-  };
-}
 
 // dist/sdk/relationship-history.js
 import { constants } from "node:fs";
@@ -1137,12 +901,12 @@ var RelationshipEventLog = class {
       included = this.#events.slice(0, version);
     }
     const active = replayEvents(included);
-    const graph = new RelationshipGraph(this.#nodes, active.values(), this.#registry);
+    const graph2 = new RelationshipGraph(this.#nodes, active.values(), this.#registry);
     return Object.freeze({
       version: included.length,
       ...included.at(-1) ? { asOf: included.at(-1).timestamp } : {},
-      edges: graph.edges(),
-      graph
+      edges: graph2.edges(),
+      graph: graph2
     });
   }
   /** Page the immutable event stream with a cursor bound to this log version. */
@@ -1396,7 +1160,7 @@ function defineOnIndexHook(hook) {
 !(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] = "e492bcee-d28c-567b-9194-ae9da56206ca");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "02da6657-48e5-5fa6-84b9-8f776bd9d8b1");
   } catch (e2) {
   }
 })();
@@ -1472,6 +1236,7 @@ export {
   GC_FLAG_CONTRACTS,
   GET_FLAG_CONTRACTS,
   GLOBAL_FLAG_CONTRACTS,
+  GRAPH_SUBCOMMAND_VALUES,
   GUIDE_FLAG_CONTRACTS,
   HEALTH_FLAG_CONTRACTS,
   HISTORY_COMPACT_BULK_DEFAULT_MIN_ENTRIES,
@@ -1568,6 +1333,7 @@ export {
   UPDATE_FLAG_CONTRACTS,
   UPDATE_MANY_FLAG_CONTRACTS,
   UPGRADE_FLAG_CONTRACTS,
+  WorkspaceGraphCache,
   _testOnly3 as _testOnly,
   _testOnlyConfigCommand,
   _testOnlyHealthCommand,
@@ -1589,6 +1355,7 @@ export {
   applyPathMigrations,
   applyStandaloneNote,
   artifactKey,
+  assembleWorkspaceRelationshipGraph,
   assertExtensionBlueprint,
   assertExtensionCapabilityUsage,
   assertExtensionDeactivated,
@@ -1615,6 +1382,7 @@ export {
   assertRegisteredSearchProvider,
   assertRegisteredServiceOverride,
   assertRegisteredVectorStoreAdapter,
+  auditWorkspaceRelationshipGraph,
   buildItemChildrenRollup,
   buildItemContextRelevanceCandidates,
   buildItemSchedule,
@@ -1629,7 +1397,11 @@ export {
   close,
   closeTask,
   coalesceRepeatedListFlags,
+  collectBlockedByIds,
   collectDanglingDependencyReferences,
+  collectDependencyBlockedIds,
+  collectDuplicateRelationshipEdgeGroups,
+  collectMissingDependencyTargetIds,
   collectPackageExtensionDirectories,
   collectUsedExtensionCapabilities,
   comments,
@@ -1638,6 +1410,9 @@ export {
   compareRelationshipSnapshots,
   composeExtension,
   composeExtensionPackage,
+  computeActionabilityReport,
+  computeRelationshipDominators,
+  computeWorkspaceGraphFingerprint,
   config,
   context,
   copy,
@@ -1685,6 +1460,7 @@ export {
   describeExtensionBlueprint,
   describeProfileComposition,
   describeProjectProfile,
+  detectRelationshipCommunities,
   docs,
   effectiveItemFormatVersion,
   emptyImportedDocument,
@@ -1692,6 +1468,7 @@ export {
   ensureMaterializedHistoryTarget,
   ensureScope,
   ensureTrackerInitialized,
+  enumerateRelationshipPaths,
   evaluateContextRanking,
   expandAddGlobEntries,
   extension,
@@ -1702,8 +1479,10 @@ export {
   extractReferencedPmItemIdsFromCommand,
   files,
   filesDiscover,
+  findRedundantRelationshipEdges,
   flushTelemetryQueue,
   focus,
+  formatDuplicateEdgeGroup,
   formatProfileApplyHuman,
   formatProfileLintHuman,
   formatProfileListHuman,
@@ -1718,7 +1497,10 @@ export {
   getItemPath,
   getSettingsPath,
   getWorkspaceContracts,
+  graph,
   health,
+  hierarchyAncestors,
+  hierarchyDescendants,
   historyCompact,
   historyCompactBulk,
   historyRedact,
@@ -1761,6 +1543,8 @@ export {
   normalizeStatusInput,
   notes,
   nowIso,
+  orderingPredecessors,
+  orderingSuccessors,
   packContextCandidates,
   packageActivate,
   packageCatalog,
@@ -1781,6 +1565,7 @@ export {
   parseBootstrapGlobalOptions,
   parseBootstrapHelpRequest,
   parseBootstrapTypeValue,
+  parseGraphSubcommand,
   parseIntegerLimit,
   parseLimit,
   parseLinkedTestAssertionEqualsMap,
@@ -1801,6 +1586,7 @@ export {
   pathExists,
   pauseTask,
   planProfileApplication,
+  planRelationshipRemediation,
   preflightExtension,
   profile,
   profileApply,
@@ -1836,12 +1622,14 @@ export {
   renderGuideMarkdown,
   renderPmCommand,
   replayHistoryToTarget,
+  resetWorkspaceGraphCache,
   resolveAnnotationIndex,
   resolveAnnotationInput,
   resolveCalendarOutputFormat,
   resolveGuideOutputFormat,
   resolveHistorySubject,
   resolveHistoryTarget,
+  resolveItemBlockers,
   resolveItemTypeRegistry,
   resolveLinkedTestFailureExitCode,
   resolvePmRoot,
@@ -1867,6 +1655,7 @@ export {
   runFiles,
   runFilesDiscover,
   runGc,
+  runGraph,
   runGuide,
   runHealth,
   runHistoryCompact,
@@ -1966,6 +1755,7 @@ export {
   validate,
   validateLinkedPaths,
   withFlagAliasMetadata,
+  workspaceGraphCache,
   wrapOwnershipConflict,
   writeFileAtomic
 };