@documentation-robotics/cli 0.1.0 → 0.1.7

package/dist/audit/relationships/analysis/layer-templates.js

@@ -0,0 +1,294 @@
+const LAYER_TEMPLATES = [
+  {
+    layer: "motivation",
+    standard: "ArchiMate 3.2",
+    patterns: [
+      {
+        sourcePattern: "goal",
+        destinationPattern: "principle",
+        predicate: "supports",
+        description: "Goals support principles"
+      },
+      {
+        sourcePattern: "requirement",
+        destinationPattern: "goal",
+        predicate: "realizes",
+        description: "Requirements realize goals"
+      },
+      {
+        sourcePattern: "constraint",
+        destinationPattern: "requirement",
+        predicate: "restricts",
+        description: "Constraints restrict requirements"
+      }
+    ]
+  },
+  {
+    layer: "business",
+    standard: "ArchiMate 3.2",
+    patterns: [
+      {
+        sourcePattern: "process",
+        destinationPattern: "process",
+        predicate: "triggers",
+        description: "Processes trigger other processes"
+      },
+      {
+        sourcePattern: "role",
+        destinationPattern: "process",
+        predicate: "performs",
+        description: "Roles perform processes"
+      },
+      {
+        sourcePattern: "service",
+        destinationPattern: "process",
+        predicate: "realizes",
+        description: "Services realize processes"
+      }
+    ]
+  },
+  {
+    layer: "security",
+    standard: "NIST SP 800-53",
+    patterns: [
+      {
+        sourcePattern: "countermeasure",
+        destinationPattern: "threat",
+        predicate: "mitigates",
+        description: "Countermeasures mitigate threats"
+      },
+      {
+        sourcePattern: "role",
+        destinationPattern: "permission",
+        predicate: "authorizes",
+        description: "Roles authorize permissions"
+      },
+      {
+        sourcePattern: "policy",
+        destinationPattern: "countermeasure",
+        predicate: "mandates",
+        description: "Policies mandate countermeasures"
+      }
+    ]
+  },
+  {
+    layer: "application",
+    standard: "ArchiMate 3.2",
+    patterns: [
+      {
+        sourcePattern: "component",
+        destinationPattern: "service",
+        predicate: "realizes",
+        description: "Components realize services"
+      },
+      {
+        sourcePattern: "component",
+        destinationPattern: "component",
+        predicate: "uses",
+        description: "Components use other components"
+      },
+      {
+        sourcePattern: "interface",
+        destinationPattern: "service",
+        predicate: "serves",
+        description: "Interfaces serve services"
+      }
+    ]
+  },
+  {
+    layer: "technology",
+    standard: "ArchiMate 3.2",
+    patterns: [
+      {
+        sourcePattern: "node",
+        destinationPattern: "device",
+        predicate: "composes",
+        description: "Nodes compose devices"
+      },
+      {
+        sourcePattern: "artifact",
+        destinationPattern: "component",
+        predicate: "realizes",
+        description: "Artifacts realize components"
+      },
+      {
+        sourcePattern: "infrastructure",
+        destinationPattern: "node",
+        predicate: "hosts",
+        description: "Infrastructure hosts nodes"
+      }
+    ]
+  },
+  {
+    layer: "api",
+    standard: "OpenAPI 3.0",
+    patterns: [
+      {
+        sourcePattern: "operation",
+        destinationPattern: "schema",
+        predicate: "references",
+        description: "Operations reference schemas"
+      },
+      {
+        sourcePattern: "securityscheme",
+        destinationPattern: "operation",
+        predicate: "serves",
+        description: "Security schemes serve operations"
+      },
+      {
+        sourcePattern: "response",
+        destinationPattern: "schema",
+        predicate: "returns",
+        description: "Responses return schemas"
+      }
+    ]
+  },
+  {
+    layer: "ux",
+    standard: "React/Component",
+    patterns: [
+      {
+        sourcePattern: "component",
+        destinationPattern: "component",
+        predicate: "renders",
+        description: "Components render other components"
+      },
+      {
+        sourcePattern: "component",
+        destinationPattern: "entity",
+        predicate: "binds-to",
+        description: "Components bind to entities"
+      },
+      {
+        sourcePattern: "form",
+        destinationPattern: "schema",
+        predicate: "validates",
+        description: "Forms validate against schemas"
+      }
+    ]
+  },
+  {
+    layer: "navigation",
+    standard: "Router patterns",
+    patterns: [
+      {
+        sourcePattern: "route",
+        destinationPattern: "screen",
+        predicate: "navigates-to",
+        description: "Routes navigate to screens"
+      },
+      {
+        sourcePattern: "menuitem",
+        destinationPattern: "route",
+        predicate: "references",
+        description: "Menu items reference routes"
+      },
+      {
+        sourcePattern: "link",
+        destinationPattern: "route",
+        predicate: "targets",
+        description: "Links target routes"
+      }
+    ]
+  },
+  {
+    layer: "data-model",
+    standard: "JSON Schema Draft 7",
+    patterns: [
+      {
+        sourcePattern: "entity",
+        destinationPattern: "entity",
+        predicate: "references",
+        description: "Entities reference other entities"
+      },
+      {
+        sourcePattern: "entity",
+        destinationPattern: "property",
+        predicate: "has",
+        description: "Entities have properties"
+      },
+      {
+        sourcePattern: "property",
+        destinationPattern: "entity",
+        predicate: "references",
+        description: "Properties reference entities"
+      }
+    ]
+  },
+  {
+    layer: "data-store",
+    standard: "Database schema patterns",
+    patterns: [
+      {
+        sourcePattern: "table",
+        destinationPattern: "table",
+        predicate: "references",
+        description: "Tables reference other tables via foreign keys"
+      },
+      {
+        sourcePattern: "index",
+        destinationPattern: "table",
+        predicate: "indexes",
+        description: "Indexes apply to tables"
+      },
+      {
+        sourcePattern: "view",
+        destinationPattern: "table",
+        predicate: "derives-from",
+        description: "Views derive from tables"
+      }
+    ]
+  },
+  {
+    layer: "apm",
+    standard: "OpenTelemetry",
+    patterns: [
+      {
+        sourcePattern: "trace",
+        destinationPattern: "service",
+        predicate: "monitors",
+        description: "Traces monitor services"
+      },
+      {
+        sourcePattern: "metric",
+        destinationPattern: "component",
+        predicate: "measures",
+        description: "Metrics measure components"
+      },
+      {
+        sourcePattern: "alert",
+        destinationPattern: "metric",
+        predicate: "triggers-on",
+        description: "Alerts trigger on metrics"
+      }
+    ]
+  },
+  {
+    layer: "testing",
+    standard: "Testing best practices",
+    patterns: [
+      {
+        sourcePattern: "testcase",
+        destinationPattern: "requirement",
+        predicate: "verifies",
+        description: "Test cases verify requirements"
+      },
+      {
+        sourcePattern: "testdata",
+        destinationPattern: "testcase",
+        predicate: "supports",
+        description: "Test data supports test cases"
+      },
+      {
+        sourcePattern: "testsuite",
+        destinationPattern: "testcase",
+        predicate: "contains",
+        description: "Test suites contain test cases"
+      }
+    ]
+  }
+];
+export {
+  LAYER_TEMPLATES
+};
+//# sourceMappingURL=layer-templates.js.map

package/dist/audit/relationships/analysis/layer-templates.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/audit/relationships/analysis/layer-templates.ts"],
+  "sourcesContent": ["/**\n * Layer-specific relationship templates for gap analysis and standard alignment\n */\n\nexport interface LayerTemplate {\n  layer: string;\n  standard: string;\n  patterns: Array<{\n    sourcePattern: string;\n    destinationPattern: string;\n    predicate: string;\n    description: string;\n  }>;\n}\n\nexport const LAYER_TEMPLATES: LayerTemplate[] = [\n  {\n    layer: \"motivation\",\n    standard: \"ArchiMate 3.2\",\n    patterns: [\n      {\n        sourcePattern: \"goal\",\n        destinationPattern: \"principle\",\n        predicate: \"supports\",\n        description: \"Goals support principles\",\n      },\n      {\n        sourcePattern: \"requirement\",\n        destinationPattern: \"goal\",\n        predicate: \"realizes\",\n        description: \"Requirements realize goals\",\n      },\n      {\n        sourcePattern: \"constraint\",\n        destinationPattern: \"requirement\",\n        predicate: \"restricts\",\n        description: \"Constraints restrict requirements\",\n      },\n    ],\n  },\n  {\n    layer: \"business\",\n    standard: \"ArchiMate 3.2\",\n    patterns: [\n      {\n        sourcePattern: \"process\",\n        destinationPattern: \"process\",\n        predicate: \"triggers\",\n        description: \"Processes trigger other processes\",\n      },\n      {\n        sourcePattern: \"role\",\n        destinationPattern: \"process\",\n        predicate: \"performs\",\n        description: \"Roles perform processes\",\n      },\n      {\n        sourcePattern: \"service\",\n        destinationPattern: \"process\",\n        predicate: \"realizes\",\n        description: \"Services realize processes\",\n      },\n    ],\n  },\n  {\n    layer: \"security\",\n    standard: \"NIST SP 800-53\",\n    patterns: [\n      {\n        sourcePattern: \"countermeasure\",\n        destinationPattern: \"threat\",\n        predicate: \"mitigates\",\n        description: \"Countermeasures mitigate threats\",\n      },\n      {\n        sourcePattern: \"role\",\n        destinationPattern: \"permission\",\n        predicate: \"authorizes\",\n        description: \"Roles authorize permissions\",\n      },\n      {\n        sourcePattern: \"policy\",\n        destinationPattern: \"countermeasure\",\n        predicate: \"mandates\",\n        description: \"Policies mandate countermeasures\",\n      },\n    ],\n  },\n  {\n    layer: \"application\",\n    standard: \"ArchiMate 3.2\",\n    patterns: [\n      {\n        sourcePattern: \"component\",\n        destinationPattern: \"service\",\n        predicate: \"realizes\",\n        description: \"Components realize services\",\n      },\n      {\n        sourcePattern: \"component\",\n        destinationPattern: \"component\",\n        predicate: \"uses\",\n        description: \"Components use other components\",\n      },\n      {\n        sourcePattern: \"interface\",\n        destinationPattern: \"service\",\n        predicate: \"serves\",\n        description: \"Interfaces serve services\",\n      },\n    ],\n  },\n  {\n    layer: \"technology\",\n    standard: \"ArchiMate 3.2\",\n    patterns: [\n      {\n        sourcePattern: \"node\",\n        destinationPattern: \"device\",\n        predicate: \"composes\",\n        description: \"Nodes compose devices\",\n      },\n      {\n        sourcePattern: \"artifact\",\n        destinationPattern: \"component\",\n        predicate: \"realizes\",\n        description: \"Artifacts realize components\",\n      },\n      {\n        sourcePattern: \"infrastructure\",\n        destinationPattern: \"node\",\n        predicate: \"hosts\",\n        description: \"Infrastructure hosts nodes\",\n      },\n    ],\n  },\n  {\n    layer: \"api\",\n    standard: \"OpenAPI 3.0\",\n    patterns: [\n      {\n        sourcePattern: \"operation\",\n        destinationPattern: \"schema\",\n        predicate: \"references\",\n        description: \"Operations reference schemas\",\n      },\n      {\n        sourcePattern: \"securityscheme\",\n        destinationPattern: \"operation\",\n        predicate: \"serves\",\n        description: \"Security schemes serve operations\",\n      },\n      {\n        sourcePattern: \"response\",\n        destinationPattern: \"schema\",\n        predicate: \"returns\",\n        description: \"Responses return schemas\",\n      },\n    ],\n  },\n  {\n    layer: \"ux\",\n    standard: \"React/Component\",\n    patterns: [\n      {\n        sourcePattern: \"component\",\n        destinationPattern: \"component\",\n        predicate: \"renders\",\n        description: \"Components render other components\",\n      },\n      {\n        sourcePattern: \"component\",\n        destinationPattern: \"entity\",\n        predicate: \"binds-to\",\n        description: \"Components bind to entities\",\n      },\n      {\n        sourcePattern: \"form\",\n        destinationPattern: \"schema\",\n        predicate: \"validates\",\n        description: \"Forms validate against schemas\",\n      },\n    ],\n  },\n  {\n    layer: \"navigation\",\n    standard: \"Router patterns\",\n    patterns: [\n      {\n        sourcePattern: \"route\",\n        destinationPattern: \"screen\",\n        predicate: \"navigates-to\",\n        description: \"Routes navigate to screens\",\n      },\n      {\n        sourcePattern: \"menuitem\",\n        destinationPattern: \"route\",\n        predicate: \"references\",\n        description: \"Menu items reference routes\",\n      },\n      {\n        sourcePattern: \"link\",\n        destinationPattern: \"route\",\n        predicate: \"targets\",\n        description: \"Links target routes\",\n      },\n    ],\n  },\n  {\n    layer: \"data-model\",\n    standard: \"JSON Schema Draft 7\",\n    patterns: [\n      {\n        sourcePattern: \"entity\",\n        destinationPattern: \"entity\",\n        predicate: \"references\",\n        description: \"Entities reference other entities\",\n      },\n      {\n        sourcePattern: \"entity\",\n        destinationPattern: \"property\",\n        predicate: \"has\",\n        description: \"Entities have properties\",\n      },\n      {\n        sourcePattern: \"property\",\n        destinationPattern: \"entity\",\n        predicate: \"references\",\n        description: \"Properties reference entities\",\n      },\n    ],\n  },\n  {\n    layer: \"data-store\",\n    standard: \"Database schema patterns\",\n    patterns: [\n      {\n        sourcePattern: \"table\",\n        destinationPattern: \"table\",\n        predicate: \"references\",\n        description: \"Tables reference other tables via foreign keys\",\n      },\n      {\n        sourcePattern: \"index\",\n        destinationPattern: \"table\",\n        predicate: \"indexes\",\n        description: \"Indexes apply to tables\",\n      },\n      {\n        sourcePattern: \"view\",\n        destinationPattern: \"table\",\n        predicate: \"derives-from\",\n        description: \"Views derive from tables\",\n      },\n    ],\n  },\n  {\n    layer: \"apm\",\n    standard: \"OpenTelemetry\",\n    patterns: [\n      {\n        sourcePattern: \"trace\",\n        destinationPattern: \"service\",\n        predicate: \"monitors\",\n        description: \"Traces monitor services\",\n      },\n      {\n        sourcePattern: \"metric\",\n        destinationPattern: \"component\",\n        predicate: \"measures\",\n        description: \"Metrics measure components\",\n      },\n      {\n        sourcePattern: \"alert\",\n        destinationPattern: \"metric\",\n        predicate: \"triggers-on\",\n        description: \"Alerts trigger on metrics\",\n      },\n    ],\n  },\n  {\n    layer: \"testing\",\n    standard: \"Testing best practices\",\n    patterns: [\n      {\n        sourcePattern: \"testcase\",\n        destinationPattern: \"requirement\",\n        predicate: \"verifies\",\n        description: \"Test cases verify requirements\",\n      },\n      {\n        sourcePattern: \"testdata\",\n        destinationPattern: \"testcase\",\n        predicate: \"supports\",\n        description: \"Test data supports test cases\",\n      },\n      {\n        sourcePattern: \"testsuite\",\n        destinationPattern: \"testcase\",\n        predicate: \"contains\",\n        description: \"Test suites contain test cases\",\n      },\n    ],\n  },\n];\n"],
+  "mappings": "AAeO,MAAM,kBAAmC;EAC9C;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;EAInB;IACE,OAAO;IACP,UAAU;IACV,UAAU;MACR;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;MAEf;QACE,eAAe;QACf,oBAAoB;QACpB,WAAW;QACX,aAAa;;;;;",
+  "names": []
+}

package/dist/audit/relationships/graph/connectivity.js

@@ -0,0 +1,129 @@
+class ConnectivityAnalyzer {
+  graph;
+  catalog;
+  // Cache to prevent redundant computations
+  cachedComponents = null;
+  cachedDegrees = null;
+  constructor(graph, catalog) {
+    this.graph = graph, this.catalog = catalog;
+  }
+  /**
+   * Find connected components using undirected traversal
+   */
+  findConnectedComponents() {
+    if (this.cachedComponents !== null)
+      return this.cachedComponents;
+    const visited = /* @__PURE__ */ new Set(), components = [];
+    for (const nodeType of this.graph.getNodeTypes()) {
+      if (visited.has(nodeType))
+        continue;
+      const component = this.bfsComponent(nodeType, visited);
+      component.length > 0 && components.push({
+        nodes: component
+      });
+    }
+    return this.cachedComponents = components.sort((a, b) => b.nodes.length - a.nodes.length), this.cachedComponents;
+  }
+  /**
+   * BFS to find connected component (undirected)
+   */
+  bfsComponent(start, visited) {
+    const component = [], queue = [start];
+    for (; queue.length > 0; ) {
+      const current = queue.shift();
+      if (visited.has(current))
+        continue;
+      visited.add(current), component.push(current);
+      const neighbors = this.graph.getNeighbors(current);
+      for (const neighbor of neighbors)
+        visited.has(neighbor) || queue.push(neighbor);
+    }
+    return component;
+  }
+  /**
+   * Calculate node degree distribution
+   */
+  calculateDegreeDistribution() {
+    if (this.cachedDegrees !== null)
+      return this.cachedDegrees;
+    const degrees = [];
+    for (const nodeType of this.graph.getNodeTypes()) {
+      const outgoing = this.graph.getOutgoingRelationships(nodeType), incoming = this.graph.getIncomingRelationships(nodeType);
+      degrees.push({
+        nodeType,
+        inDegree: incoming.length,
+        outDegree: outgoing.length,
+        totalDegree: incoming.length + outgoing.length
+      });
+    }
+    return this.cachedDegrees = degrees.sort((a, b) => b.totalDegree - a.totalDegree), this.cachedDegrees;
+  }
+  /**
+   * Identify isolated nodes (degree === 0)
+   */
+  findIsolatedNodes() {
+    return this.calculateDegreeDistribution().filter((d) => d.totalDegree === 0).map((d) => d.nodeType);
+  }
+  /**
+   * Find transitive chains for transitive predicates
+   */
+  async findTransitiveChains() {
+    const chains = [], transitivePredicates = this.catalog.getAllTypes().filter((t) => t.semantics.transitivity).map((t) => t.predicate);
+    for (const predicate of transitivePredicates) {
+      const predicateChains = this.findChainsForPredicate(predicate);
+      chains.push(...predicateChains);
+    }
+    return chains.sort((a, b) => b.chain.length - a.chain.length);
+  }
+  /**
+   * Find chains for a specific predicate
+   */
+  findChainsForPredicate(predicate) {
+    const chains = [], visited = /* @__PURE__ */ new Set();
+    for (const nodeType of this.graph.getNodeTypes()) {
+      if (visited.has(nodeType))
+        continue;
+      const chain = this.dfsChain(nodeType, predicate, visited, []);
+      chain.length > 1 && chains.push({
+        predicate,
+        chain
+      });
+    }
+    return chains.sort((a, b) => b.chain.length - a.chain.length);
+  }
+  /**
+   * DFS to find transitive chain
+   */
+  dfsChain(current, predicate, visited, path) {
+    if (visited.has(current))
+      return path;
+    visited.add(current), path.push(current);
+    const outgoing = this.graph.getOutgoingRelationships(current).filter((e) => e.predicate === predicate);
+    if (outgoing.length === 0)
+      return path;
+    let longestChain = path;
+    for (const edge of outgoing) {
+      const chain = this.dfsChain(edge.destination, predicate, new Set(visited), [...path]);
+      chain.length > longestChain.length && (longestChain = chain);
+    }
+    return longestChain;
+  }
+  /**
+   * Get statistics about connectivity
+   */
+  getConnectivityStats() {
+    const components = this.findConnectedComponents(), isolated = this.findIsolatedNodes(), degrees = this.calculateDegreeDistribution(), totalDegree = degrees.reduce((sum, d) => sum + d.totalDegree, 0), averageDegree = degrees.length > 0 ? totalDegree / degrees.length : 0;
+    return {
+      nodeCount: this.graph.getNodeCount(),
+      edgeCount: this.graph.getEdgeCount(),
+      componentCount: components.length,
+      isolatedNodeCount: isolated.length,
+      largestComponentSize: components.length > 0 ? components[0].nodes.length : 0,
+      averageDegree
+    };
+  }
+}
+export {
+  ConnectivityAnalyzer
+};
+//# sourceMappingURL=connectivity.js.map

package/dist/audit/relationships/graph/connectivity.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/audit/relationships/graph/connectivity.ts"],
+  "sourcesContent": ["/**\n * Connectivity Analyzer - Analyzes graph connectivity\n *\n * Provides:\n * - Connected component detection\n * - Node degree distribution\n * - Isolated node identification\n * - Transitive chain detection\n */\n\nimport { RelationshipCatalog } from \"../../../core/relationship-catalog.js\";\nimport { RelationshipGraph } from \"./relationship-graph.js\";\nimport type {\n  ConnectedComponent,\n  NodeDegree,\n  TransitiveChain,\n} from \"../../types.js\";\n\n/**\n * Connectivity analyzer for relationship graphs\n */\nexport class ConnectivityAnalyzer {\n  // Cache to prevent redundant computations\n  private cachedComponents: ConnectedComponent[] | null = null;\n  private cachedDegrees: NodeDegree[] | null = null;\n\n  constructor(\n    private graph: RelationshipGraph,\n    private catalog: RelationshipCatalog\n  ) {}\n\n  /**\n   * Find connected components using undirected traversal\n   */\n  findConnectedComponents(): ConnectedComponent[] {\n    if (this.cachedComponents !== null) {\n      return this.cachedComponents;\n    }\n\n    const visited = new Set<string>();\n    const components: ConnectedComponent[] = [];\n\n    for (const nodeType of this.graph.getNodeTypes()) {\n      if (visited.has(nodeType)) {\n        continue;\n      }\n\n      // BFS to find component\n      const component = this.bfsComponent(nodeType, visited);\n      if (component.length > 0) {\n        components.push({\n          nodes: component,\n        });\n      }\n    }\n\n    this.cachedComponents = components.sort((a, b) => b.nodes.length - a.nodes.length);\n    return this.cachedComponents;\n  }\n\n  /**\n   * BFS to find connected component (undirected)\n   */\n  private bfsComponent(start: string, visited: Set<string>): string[] {\n    const component: string[] = [];\n    const queue: string[] = [start];\n\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n\n      if (visited.has(current)) {\n        continue;\n      }\n\n      visited.add(current);\n      component.push(current);\n\n      // Get neighbors (both incoming and outgoing)\n      const neighbors = this.graph.getNeighbors(current);\n      for (const neighbor of neighbors) {\n        if (!visited.has(neighbor)) {\n          queue.push(neighbor);\n        }\n      }\n    }\n\n    return component;\n  }\n\n  /**\n   * Calculate node degree distribution\n   */\n  calculateDegreeDistribution(): NodeDegree[] {\n    if (this.cachedDegrees !== null) {\n      return this.cachedDegrees;\n    }\n\n    const degrees: NodeDegree[] = [];\n\n    for (const nodeType of this.graph.getNodeTypes()) {\n      const outgoing = this.graph.getOutgoingRelationships(nodeType);\n      const incoming = this.graph.getIncomingRelationships(nodeType);\n\n      degrees.push({\n        nodeType,\n        inDegree: incoming.length,\n        outDegree: outgoing.length,\n        totalDegree: incoming.length + outgoing.length,\n      });\n    }\n\n    this.cachedDegrees = degrees.sort((a, b) => b.totalDegree - a.totalDegree);\n    return this.cachedDegrees;\n  }\n\n  /**\n   * Identify isolated nodes (degree === 0)\n   */\n  findIsolatedNodes(): string[] {\n    const degrees = this.calculateDegreeDistribution();\n    return degrees\n      .filter((d) => d.totalDegree === 0)\n      .map((d) => d.nodeType);\n  }\n\n  /**\n   * Find transitive chains for transitive predicates\n   */\n  async findTransitiveChains(): Promise<TransitiveChain[]> {\n    const chains: TransitiveChain[] = [];\n\n    // Get all transitive predicates\n    const allTypes = this.catalog.getAllTypes();\n    const transitivePredicates = allTypes\n      .filter((t) => t.semantics.transitivity)\n      .map((t) => t.predicate);\n\n    // For each transitive predicate, find chains\n    for (const predicate of transitivePredicates) {\n      const predicateChains = this.findChainsForPredicate(predicate);\n      chains.push(...predicateChains);\n    }\n\n    return chains.sort((a, b) => b.chain.length - a.chain.length);\n  }\n\n  /**\n   * Find chains for a specific predicate\n   */\n  private findChainsForPredicate(predicate: string): TransitiveChain[] {\n    const chains: TransitiveChain[] = [];\n    const visited = new Set<string>();\n\n    for (const nodeType of this.graph.getNodeTypes()) {\n      if (visited.has(nodeType)) {\n        continue;\n      }\n\n      // DFS to find chain\n      const chain = this.dfsChain(nodeType, predicate, visited, []);\n      if (chain.length > 1) {\n        chains.push({\n          predicate,\n          chain,\n        });\n      }\n    }\n\n    return chains.sort((a, b) => b.chain.length - a.chain.length);\n  }\n\n  /**\n   * DFS to find transitive chain\n   */\n  private dfsChain(\n    current: string,\n    predicate: string,\n    visited: Set<string>,\n    path: string[]\n  ): string[] {\n    if (visited.has(current)) {\n      return path;\n    }\n\n    visited.add(current);\n    path.push(current);\n\n    // Find outgoing edges with the predicate\n    const outgoing = this.graph\n      .getOutgoingRelationships(current)\n      .filter((e) => e.predicate === predicate);\n\n    if (outgoing.length === 0) {\n      return path;\n    }\n\n    // Follow the first edge (prefer longest chain)\n    let longestChain = path;\n    for (const edge of outgoing) {\n      const chain = this.dfsChain(\n        edge.destination,\n        predicate,\n        new Set(visited),\n        [...path]\n      );\n      if (chain.length > longestChain.length) {\n        longestChain = chain;\n      }\n    }\n\n    return longestChain;\n  }\n\n  /**\n   * Get statistics about connectivity\n   */\n  getConnectivityStats(): {\n    nodeCount: number;\n    edgeCount: number;\n    componentCount: number;\n    isolatedNodeCount: number;\n    largestComponentSize: number;\n    averageDegree: number;\n  } {\n    const components = this.findConnectedComponents();\n    const isolated = this.findIsolatedNodes();\n    const degrees = this.calculateDegreeDistribution();\n\n    const totalDegree = degrees.reduce(\n      (sum, d) => sum + d.totalDegree,\n      0\n    );\n    const averageDegree =\n      degrees.length > 0 ? totalDegree / degrees.length : 0;\n\n    return {\n      nodeCount: this.graph.getNodeCount(),\n      edgeCount: this.graph.getEdgeCount(),\n      componentCount: components.length,\n      isolatedNodeCount: isolated.length,\n      largestComponentSize:\n        components.length > 0 ? components[0].nodes.length : 0,\n      averageDegree,\n    };\n  }\n}\n"],
+  "mappings": "AAqBM,MAAO,qBAAoB;EAMrB;EACA;;EALF,mBAAgD;EAChD,gBAAqC;EAE7C,YACU,OACA,SAA4B;AAD5B,SAAA,QAAA,OACA,KAAA,UAAA;EACP;;;;EAKH,0BAAuB;AACrB,QAAI,KAAK,qBAAqB;AAC5B,aAAO,KAAK;AAGd,UAAM,UAAU,oBAAI,IAAG,GACjB,aAAmC,CAAA;AAEzC,eAAW,YAAY,KAAK,MAAM,aAAY,GAAI;AAChD,UAAI,QAAQ,IAAI,QAAQ;AACtB;AAIF,YAAM,YAAY,KAAK,aAAa,UAAU,OAAO;AACrD,MAAI,UAAU,SAAS,KACrB,WAAW,KAAK;QACd,OAAO;OACR;IAEL;AAEA,gBAAK,mBAAmB,WAAW,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,SAAS,EAAE,MAAM,MAAM,GAC1E,KAAK;EACd;;;;EAKQ,aAAa,OAAe,SAAoB;AACtD,UAAM,YAAsB,CAAA,GACtB,QAAkB,CAAC,KAAK;AAE9B,WAAO,MAAM,SAAS,KAAG;AACvB,YAAM,UAAU,MAAM,MAAK;AAE3B,UAAI,QAAQ,IAAI,OAAO;AACrB;AAGF,cAAQ,IAAI,OAAO,GACnB,UAAU,KAAK,OAAO;AAGtB,YAAM,YAAY,KAAK,MAAM,aAAa,OAAO;AACjD,iBAAW,YAAY;AACrB,QAAK,QAAQ,IAAI,QAAQ,KACvB,MAAM,KAAK,QAAQ;IAGzB;AAEA,WAAO;EACT;;;;EAKA,8BAA2B;AACzB,QAAI,KAAK,kBAAkB;AACzB,aAAO,KAAK;AAGd,UAAM,UAAwB,CAAA;AAE9B,eAAW,YAAY,KAAK,MAAM,aAAY,GAAI;AAChD,YAAM,WAAW,KAAK,MAAM,yBAAyB,QAAQ,GACvD,WAAW,KAAK,MAAM,yBAAyB,QAAQ;AAE7D,cAAQ,KAAK;QACX;QACA,UAAU,SAAS;QACnB,WAAW,SAAS;QACpB,aAAa,SAAS,SAAS,SAAS;OACzC;IACH;AAEA,gBAAK,gBAAgB,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW,GAClE,KAAK;EACd;;;;EAKA,oBAAiB;AAEf,WADgB,KAAK,4BAA2B,EAE7C,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,EACjC,IAAI,CAAC,MAAM,EAAE,QAAQ;EAC1B;;;;EAKA,MAAM,uBAAoB;AACxB,UAAM,SAA4B,CAAA,GAI5B,uBADW,KAAK,QAAQ,YAAW,EAEtC,OAAO,CAAC,MAAM,EAAE,UAAU,YAAY,EACtC,IAAI,CAAC,MAAM,EAAE,SAAS;AAGzB,eAAW,aAAa,sBAAsB;AAC5C,YAAM,kBAAkB,KAAK,uBAAuB,SAAS;AAC7D,aAAO,KAAK,GAAG,eAAe;IAChC;AAEA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,SAAS,EAAE,MAAM,MAAM;EAC9D;;;;EAKQ,uBAAuB,WAAiB;AAC9C,UAAM,SAA4B,CAAA,GAC5B,UAAU,oBAAI,IAAG;AAEvB,eAAW,YAAY,KAAK,MAAM,aAAY,GAAI;AAChD,UAAI,QAAQ,IAAI,QAAQ;AACtB;AAIF,YAAM,QAAQ,KAAK,SAAS,UAAU,WAAW,SAAS,CAAA,CAAE;AAC5D,MAAI,MAAM,SAAS,KACjB,OAAO,KAAK;QACV;QACA;OACD;IAEL;AAEA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,SAAS,EAAE,MAAM,MAAM;EAC9D;;;;EAKQ,SACN,SACA,WACA,SACA,MAAc;AAEd,QAAI,QAAQ,IAAI,OAAO;AACrB,aAAO;AAGT,YAAQ,IAAI,OAAO,GACnB,KAAK,KAAK,OAAO;AAGjB,UAAM,WAAW,KAAK,MACnB,yBAAyB,OAAO,EAChC,OAAO,CAAC,MAAM,EAAE,cAAc,SAAS;AAE1C,QAAI,SAAS,WAAW;AACtB,aAAO;AAIT,QAAI,eAAe;AACnB,eAAW,QAAQ,UAAU;AAC3B,YAAM,QAAQ,KAAK,SACjB,KAAK,aACL,WACA,IAAI,IAAI,OAAO,GACf,CAAC,GAAG,IAAI,CAAC;AAEX,MAAI,MAAM,SAAS,aAAa,WAC9B,eAAe;IAEnB;AAEA,WAAO;EACT;;;;EAKA,uBAAoB;AAQlB,UAAM,aAAa,KAAK,wBAAuB,GACzC,WAAW,KAAK,kBAAiB,GACjC,UAAU,KAAK,4BAA2B,GAE1C,cAAc,QAAQ,OAC1B,CAAC,KAAK,MAAM,MAAM,EAAE,aACpB,CAAC,GAEG,gBACJ,QAAQ,SAAS,IAAI,cAAc,QAAQ,SAAS;AAEtD,WAAO;MACL,WAAW,KAAK,MAAM,aAAY;MAClC,WAAW,KAAK,MAAM,aAAY;MAClC,gBAAgB,WAAW;MAC3B,mBAAmB,SAAS;MAC5B,sBACE,WAAW,SAAS,IAAI,WAAW,CAAC,EAAE,MAAM,SAAS;MACvD;;EAEJ;;",
+  "names": []
+}

package/dist/audit/relationships/graph/relationship-graph.js

@@ -0,0 +1,179 @@
+import { GraphModel } from "../../../core/graph-model.js";
+import { RELATIONSHIPS } from "../../../generated/relationship-index.js";
+import { getAllLayers } from "../../../generated/layer-registry.js";
+class RelationshipGraph {
+  graph;
+  constructor() {
+    this.graph = new GraphModel();
+  }
+  /**
+   * Build graph from intra-layer relationships
+   */
+  async build(layerId) {
+    this.graph.clear();
+    const relationships = layerId ? RELATIONSHIPS.filter((r) => r.sourceSpecNodeId.startsWith(`${layerId}.`)) : RELATIONSHIPS, nodeTypes = /* @__PURE__ */ new Set();
+    for (const rel of relationships)
+      nodeTypes.add(rel.sourceSpecNodeId), nodeTypes.add(rel.destinationSpecNodeId);
+    if (layerId) {
+      const layer = getAllLayers().find((l) => l.id === layerId);
+      if (layer)
+        for (const nodeType of layer.nodeTypes)
+          nodeTypes.add(nodeType);
+    }
+    for (const nodeType of nodeTypes) {
+      const [layer, type] = nodeType.split(".");
+      this.graph.addNode({
+        id: nodeType,
+        layer: layer || "unknown",
+        type: type || "unknown",
+        name: nodeType,
+        properties: {}
+      });
+    }
+    const skippedEdges = [];
+    for (const rel of relationships)
+      try {
+        this.graph.addEdge({
+          id: rel.id,
+          source: rel.sourceSpecNodeId,
+          destination: rel.destinationSpecNodeId,
+          predicate: rel.predicate,
+          properties: {
+            cardinality: rel.cardinality,
+            strength: rel.strength,
+            required: rel.required
+          }
+        });
+      } catch (error) {
+        const reason = error instanceof Error ? error.message : String(error);
+        skippedEdges.push({
+          relationshipId: rel.id,
+          source: rel.sourceSpecNodeId,
+          destination: rel.destinationSpecNodeId,
+          reason
+        }), console.error(`\u26A0\uFE0F  Data integrity issue: Relationship "${rel.id}" references non-existent node type. ${reason}`);
+      }
+    skippedEdges.length > 0 && (console.error(`
+\u26A0\uFE0F  Warning: ${skippedEdges.length} relationship(s) skipped due to missing node type references.`), console.error("This indicates data integrity issues in the relationship schemas."), console.error(`Run 'dr schema relationships' to validate relationship definitions.
+`));
+  }
+  /**
+   * Get node count
+   */
+  getNodeCount() {
+    return this.graph.getNodeCount();
+  }
+  /**
+   * Get edge count
+   */
+  getEdgeCount() {
+    return this.graph.getEdgeCount();
+  }
+  /**
+   * Get all node types in the graph
+   */
+  getNodeTypes() {
+    return Array.from(this.graph.nodes.keys());
+  }
+  /**
+   * Get outgoing relationships for a node type
+   */
+  getOutgoingRelationships(nodeType) {
+    return this.graph.getEdgesFrom(nodeType);
+  }
+  /**
+   * Get incoming relationships for a node type
+   */
+  getIncomingRelationships(nodeType) {
+    return this.graph.getEdgesTo(nodeType);
+  }
+  /**
+   * Get all relationships for a node type
+   */
+  getAllRelationships(nodeType) {
+    return [
+      ...this.graph.getEdgesFrom(nodeType),
+      ...this.graph.getEdgesTo(nodeType)
+    ];
+  }
+  /**
+   * Find paths between two node types
+   */
+  findPaths(sourceType, destType, maxDepth = 5) {
+    const paths = [], visited = /* @__PURE__ */ new Set(), dfs = (current, path, depth) => {
+      if (depth > maxDepth)
+        return;
+      if (current === destType) {
+        paths.push([...path, current]);
+        return;
+      }
+      if (visited.has(current))
+        return;
+      visited.add(current), path.push(current);
+      const outgoing = this.graph.getEdgesFrom(current);
+      for (const edge of outgoing)
+        dfs(edge.destination, [...path], depth + 1);
+      visited.delete(current);
+    };
+    return dfs(sourceType, [], 0), paths;
+  }
+  /**
+   * Get neighbors of a node type
+   */
+  getNeighbors(nodeType) {
+    const neighbors = /* @__PURE__ */ new Set(), outgoing = this.graph.getEdgesFrom(nodeType);
+    for (const edge of outgoing)
+      neighbors.add(edge.destination);
+    const incoming = this.graph.getEdgesTo(nodeType);
+    for (const edge of incoming)
+      neighbors.add(edge.source);
+    return Array.from(neighbors);
+  }
+  /**
+   * Get the underlying graph model
+   */
+  getGraphModel() {
+    return this.graph;
+  }
+  /**
+   * Build graph from actual model relationship instances and elements.
+   * Used by ModelAuditOrchestrator to analyse the project model rather than spec schemas.
+   */
+  buildFromModel(relationships, elements) {
+    this.graph.clear();
+    const elementById = /* @__PURE__ */ new Map();
+    for (const e of elements)
+      elementById.set(e.id, e), e.path && e.path !== e.id && elementById.set(e.path, e);
+    const specNodeIds = new Set(elements.map((e) => e.spec_node_id).filter(Boolean));
+    for (const specNodeId of specNodeIds) {
+      const [layer, type] = specNodeId.split(".");
+      this.graph.addNode({
+        id: specNodeId,
+        layer: layer ?? "unknown",
+        type: type ?? "unknown",
+        name: specNodeId,
+        properties: {}
+      });
+    }
+    let edgeCounter = 0;
+    for (const rel of relationships) {
+      const srcEl = elementById.get(rel.source), dstEl = elementById.get(rel.target);
+      if (!(!srcEl?.spec_node_id || !dstEl?.spec_node_id))
+        try {
+          this.graph.addEdge({
+            id: `model-rel-${edgeCounter++}`,
+            source: srcEl.spec_node_id,
+            destination: dstEl.spec_node_id,
+            predicate: rel.predicate,
+            properties: rel.properties,
+            category: rel.category
+          });
+        } catch {
+        }
+    }
+  }
+}
+export {
+  RelationshipGraph
+};
+//# sourceMappingURL=relationship-graph.js.map