@harness-engineering/graph 0.2.3 → 0.3.1

package/dist/index.d.mts

@@ -527,6 +527,52 @@ declare class GraphCouplingAdapter {
     private computeTransitiveDepth;
 }
 
+interface AnomalyDetectionOptions {
+    threshold?: number;
+    metrics?: string[];
+}
+interface StatisticalOutlier {
+    nodeId: string;
+    nodeName: string;
+    nodePath?: string | undefined;
+    nodeType: string;
+    metric: string;
+    value: number;
+    zScore: number;
+    mean: number;
+    stdDev: number;
+}
+interface ArticulationPoint {
+    nodeId: string;
+    nodeName: string;
+    nodePath?: string | undefined;
+    componentsIfRemoved: number;
+    dependentCount: number;
+}
+interface AnomalyReport {
+    statisticalOutliers: StatisticalOutlier[];
+    articulationPoints: ArticulationPoint[];
+    overlapping: string[];
+    summary: {
+        totalNodesAnalyzed: number;
+        outlierCount: number;
+        articulationPointCount: number;
+        overlapCount: number;
+        metricsAnalyzed: string[];
+        warnings: string[];
+        threshold: number;
+    };
+}
+declare class GraphAnomalyAdapter {
+    private readonly store;
+    constructor(store: GraphStore);
+    detect(options?: AnomalyDetectionOptions): AnomalyReport;
+    private collectMetricValues;
+    private computeZScoreOutliers;
+    private findArticulationPoints;
+    private computeRemovalImpact;
+}
+
 interface AssembledContext {
     readonly nodes: readonly GraphNode[];
     readonly edges: readonly GraphEdge[];
@@ -662,4 +708,4 @@ declare class GraphFeedbackAdapter {
 
 declare const VERSION = "0.2.0";
 
-export { type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };
+export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };

package/dist/index.d.ts

@@ -527,6 +527,52 @@ declare class GraphCouplingAdapter {
     private computeTransitiveDepth;
 }
 
+interface AnomalyDetectionOptions {
+    threshold?: number;
+    metrics?: string[];
+}
+interface StatisticalOutlier {
+    nodeId: string;
+    nodeName: string;
+    nodePath?: string | undefined;
+    nodeType: string;
+    metric: string;
+    value: number;
+    zScore: number;
+    mean: number;
+    stdDev: number;
+}
+interface ArticulationPoint {
+    nodeId: string;
+    nodeName: string;
+    nodePath?: string | undefined;
+    componentsIfRemoved: number;
+    dependentCount: number;
+}
+interface AnomalyReport {
+    statisticalOutliers: StatisticalOutlier[];
+    articulationPoints: ArticulationPoint[];
+    overlapping: string[];
+    summary: {
+        totalNodesAnalyzed: number;
+        outlierCount: number;
+        articulationPointCount: number;
+        overlapCount: number;
+        metricsAnalyzed: string[];
+        warnings: string[];
+        threshold: number;
+    };
+}
+declare class GraphAnomalyAdapter {
+    private readonly store;
+    constructor(store: GraphStore);
+    detect(options?: AnomalyDetectionOptions): AnomalyReport;
+    private collectMetricValues;
+    private computeZScoreOutliers;
+    private findArticulationPoints;
+    private computeRemovalImpact;
+}
+
 interface AssembledContext {
     readonly nodes: readonly GraphNode[];
     readonly edges: readonly GraphEdge[];
@@ -662,4 +708,4 @@ declare class GraphFeedbackAdapter {
 
 declare const VERSION = "0.2.0";
 
-export { type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };
+export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };

package/dist/index.js

@@ -41,6 +41,7 @@ __export(index_exports, {
   EDGE_TYPES: () => EDGE_TYPES,
   FusionLayer: () => FusionLayer,
   GitIngestor: () => GitIngestor,
+  GraphAnomalyAdapter: () => GraphAnomalyAdapter,
   GraphComplexityAdapter: () => GraphComplexityAdapter,
   GraphConstraintAdapter: () => GraphConstraintAdapter,
   GraphCouplingAdapter: () => GraphCouplingAdapter,
@@ -2272,6 +2273,244 @@ var GraphCouplingAdapter = class {
   }
 };
 
+// src/entropy/GraphAnomalyAdapter.ts
+var DEFAULT_THRESHOLD = 2;
+var DEFAULT_METRICS = [
+  "cyclomaticComplexity",
+  "fanIn",
+  "fanOut",
+  "hotspotScore",
+  "transitiveDepth"
+];
+var RECOGNIZED_METRICS = new Set(DEFAULT_METRICS);
+var GraphAnomalyAdapter = class {
+  constructor(store) {
+    this.store = store;
+  }
+  detect(options) {
+    const threshold = options?.threshold != null && options.threshold > 0 ? options.threshold : DEFAULT_THRESHOLD;
+    const requestedMetrics = options?.metrics ?? [...DEFAULT_METRICS];
+    const warnings = [];
+    const metricsToAnalyze = [];
+    for (const m of requestedMetrics) {
+      if (RECOGNIZED_METRICS.has(m)) {
+        metricsToAnalyze.push(m);
+      } else {
+        warnings.push(m);
+      }
+    }
+    const allOutliers = [];
+    const analyzedNodeIds = /* @__PURE__ */ new Set();
+    const couplingMetrics = ["fanIn", "fanOut", "transitiveDepth"];
+    const needsCoupling = metricsToAnalyze.some((m) => couplingMetrics.includes(m));
+    const needsComplexity = metricsToAnalyze.includes("hotspotScore");
+    const cachedCouplingData = needsCoupling ? new GraphCouplingAdapter(this.store).computeCouplingData() : void 0;
+    const cachedHotspotData = needsComplexity ? new GraphComplexityAdapter(this.store).computeComplexityHotspots() : void 0;
+    for (const metric of metricsToAnalyze) {
+      const entries = this.collectMetricValues(metric, cachedCouplingData, cachedHotspotData);
+      for (const e of entries) {
+        analyzedNodeIds.add(e.nodeId);
+      }
+      const outliers = this.computeZScoreOutliers(entries, metric, threshold);
+      allOutliers.push(...outliers);
+    }
+    allOutliers.sort((a, b) => b.zScore - a.zScore);
+    const articulationPoints = this.findArticulationPoints();
+    const outlierNodeIds = new Set(allOutliers.map((o) => o.nodeId));
+    const apNodeIds = new Set(articulationPoints.map((ap) => ap.nodeId));
+    const overlapping = [...outlierNodeIds].filter((id) => apNodeIds.has(id));
+    return {
+      statisticalOutliers: allOutliers,
+      articulationPoints,
+      overlapping,
+      summary: {
+        totalNodesAnalyzed: analyzedNodeIds.size,
+        outlierCount: allOutliers.length,
+        articulationPointCount: articulationPoints.length,
+        overlapCount: overlapping.length,
+        metricsAnalyzed: metricsToAnalyze,
+        warnings,
+        threshold
+      }
+    };
+  }
+  collectMetricValues(metric, cachedCouplingData, cachedHotspotData) {
+    const entries = [];
+    if (metric === "cyclomaticComplexity") {
+      const functionNodes = [
+        ...this.store.findNodes({ type: "function" }),
+        ...this.store.findNodes({ type: "method" })
+      ];
+      for (const node of functionNodes) {
+        const cc = node.metadata?.cyclomaticComplexity;
+        if (typeof cc === "number") {
+          entries.push({
+            nodeId: node.id,
+            nodeName: node.name,
+            nodePath: node.path,
+            nodeType: node.type,
+            value: cc
+          });
+        }
+      }
+    } else if (metric === "fanIn" || metric === "fanOut" || metric === "transitiveDepth") {
+      const couplingData = cachedCouplingData ?? new GraphCouplingAdapter(this.store).computeCouplingData();
+      const fileNodes = this.store.findNodes({ type: "file" });
+      for (const fileData of couplingData.files) {
+        const fileNode = fileNodes.find((n) => (n.path ?? n.name) === fileData.file);
+        if (!fileNode) continue;
+        entries.push({
+          nodeId: fileNode.id,
+          nodeName: fileNode.name,
+          nodePath: fileNode.path,
+          nodeType: "file",
+          value: fileData[metric]
+        });
+      }
+    } else if (metric === "hotspotScore") {
+      const hotspots = cachedHotspotData ?? new GraphComplexityAdapter(this.store).computeComplexityHotspots();
+      const functionNodes = [
+        ...this.store.findNodes({ type: "function" }),
+        ...this.store.findNodes({ type: "method" })
+      ];
+      for (const h of hotspots.hotspots) {
+        const fnNode = functionNodes.find(
+          (n) => n.name === h.function && (n.path ?? "") === (h.file ?? "")
+        );
+        if (!fnNode) continue;
+        entries.push({
+          nodeId: fnNode.id,
+          nodeName: fnNode.name,
+          nodePath: fnNode.path,
+          nodeType: fnNode.type,
+          value: h.hotspotScore
+        });
+      }
+    }
+    return entries;
+  }
+  computeZScoreOutliers(entries, metric, threshold) {
+    if (entries.length === 0) return [];
+    const values = entries.map((e) => e.value);
+    const mean = values.reduce((sum, v) => sum + v, 0) / values.length;
+    const variance = values.reduce((sum, v) => sum + (v - mean) ** 2, 0) / values.length;
+    const stdDev = Math.sqrt(variance);
+    if (stdDev === 0) return [];
+    const outliers = [];
+    for (const entry of entries) {
+      const zScore = Math.abs(entry.value - mean) / stdDev;
+      if (zScore > threshold) {
+        outliers.push({
+          nodeId: entry.nodeId,
+          nodeName: entry.nodeName,
+          nodePath: entry.nodePath,
+          nodeType: entry.nodeType,
+          metric,
+          value: entry.value,
+          zScore,
+          mean,
+          stdDev
+        });
+      }
+    }
+    return outliers;
+  }
+  findArticulationPoints() {
+    const fileNodes = this.store.findNodes({ type: "file" });
+    if (fileNodes.length === 0) return [];
+    const nodeMap = /* @__PURE__ */ new Map();
+    const adj = /* @__PURE__ */ new Map();
+    for (const node of fileNodes) {
+      nodeMap.set(node.id, { name: node.name, path: node.path });
+      adj.set(node.id, /* @__PURE__ */ new Set());
+    }
+    const importEdges = this.store.getEdges({ type: "imports" });
+    for (const edge of importEdges) {
+      if (adj.has(edge.from) && adj.has(edge.to)) {
+        adj.get(edge.from).add(edge.to);
+        adj.get(edge.to).add(edge.from);
+      }
+    }
+    const disc = /* @__PURE__ */ new Map();
+    const low = /* @__PURE__ */ new Map();
+    const parent = /* @__PURE__ */ new Map();
+    const apSet = /* @__PURE__ */ new Set();
+    let timer = 0;
+    const dfs = (u) => {
+      disc.set(u, timer);
+      low.set(u, timer);
+      timer++;
+      let children = 0;
+      for (const v of adj.get(u)) {
+        if (!disc.has(v)) {
+          children++;
+          parent.set(v, u);
+          dfs(v);
+          low.set(u, Math.min(low.get(u), low.get(v)));
+          if (parent.get(u) === null && children > 1) {
+            apSet.add(u);
+          }
+          if (parent.get(u) !== null && low.get(v) >= disc.get(u)) {
+            apSet.add(u);
+          }
+        } else if (v !== parent.get(u)) {
+          low.set(u, Math.min(low.get(u), disc.get(v)));
+        }
+      }
+    };
+    for (const nodeId of adj.keys()) {
+      if (!disc.has(nodeId)) {
+        parent.set(nodeId, null);
+        dfs(nodeId);
+      }
+    }
+    const results = [];
+    for (const apId of apSet) {
+      const { components, dependentCount } = this.computeRemovalImpact(apId, adj);
+      const info = nodeMap.get(apId);
+      results.push({
+        nodeId: apId,
+        nodeName: info.name,
+        nodePath: info.path,
+        componentsIfRemoved: components,
+        dependentCount
+      });
+    }
+    results.sort((a, b) => b.dependentCount - a.dependentCount);
+    return results;
+  }
+  computeRemovalImpact(removedId, adj) {
+    const visited = /* @__PURE__ */ new Set();
+    visited.add(removedId);
+    const componentSizes = [];
+    for (const nodeId of adj.keys()) {
+      if (visited.has(nodeId)) continue;
+      const queue = [nodeId];
+      visited.add(nodeId);
+      let size = 0;
+      let head = 0;
+      while (head < queue.length) {
+        const current = queue[head++];
+        size++;
+        for (const neighbor of adj.get(current)) {
+          if (!visited.has(neighbor)) {
+            visited.add(neighbor);
+            queue.push(neighbor);
+          }
+        }
+      }
+      componentSizes.push(size);
+    }
+    const components = componentSizes.length;
+    if (componentSizes.length <= 1) {
+      return { components, dependentCount: 0 };
+    }
+    const maxSize = Math.max(...componentSizes);
+    const dependentCount = componentSizes.reduce((sum, s) => sum + s, 0) - maxSize;
+    return { components, dependentCount };
+  }
+};
+
 // src/context/Assembler.ts
 var PHASE_NODE_TYPES = {
   implement: ["file", "function", "class", "method", "interface", "variable"],
@@ -2909,6 +3148,7 @@ var VERSION = "0.2.0";
   EDGE_TYPES,
   FusionLayer,
   GitIngestor,
+  GraphAnomalyAdapter,
   GraphComplexityAdapter,
   GraphConstraintAdapter,
   GraphCouplingAdapter,

package/dist/index.mjs

@@ -2205,6 +2205,244 @@ var GraphCouplingAdapter = class {
   }
 };
 
+// src/entropy/GraphAnomalyAdapter.ts
+var DEFAULT_THRESHOLD = 2;
+var DEFAULT_METRICS = [
+  "cyclomaticComplexity",
+  "fanIn",
+  "fanOut",
+  "hotspotScore",
+  "transitiveDepth"
+];
+var RECOGNIZED_METRICS = new Set(DEFAULT_METRICS);
+var GraphAnomalyAdapter = class {
+  constructor(store) {
+    this.store = store;
+  }
+  detect(options) {
+    const threshold = options?.threshold != null && options.threshold > 0 ? options.threshold : DEFAULT_THRESHOLD;
+    const requestedMetrics = options?.metrics ?? [...DEFAULT_METRICS];
+    const warnings = [];
+    const metricsToAnalyze = [];
+    for (const m of requestedMetrics) {
+      if (RECOGNIZED_METRICS.has(m)) {
+        metricsToAnalyze.push(m);
+      } else {
+        warnings.push(m);
+      }
+    }
+    const allOutliers = [];
+    const analyzedNodeIds = /* @__PURE__ */ new Set();
+    const couplingMetrics = ["fanIn", "fanOut", "transitiveDepth"];
+    const needsCoupling = metricsToAnalyze.some((m) => couplingMetrics.includes(m));
+    const needsComplexity = metricsToAnalyze.includes("hotspotScore");
+    const cachedCouplingData = needsCoupling ? new GraphCouplingAdapter(this.store).computeCouplingData() : void 0;
+    const cachedHotspotData = needsComplexity ? new GraphComplexityAdapter(this.store).computeComplexityHotspots() : void 0;
+    for (const metric of metricsToAnalyze) {
+      const entries = this.collectMetricValues(metric, cachedCouplingData, cachedHotspotData);
+      for (const e of entries) {
+        analyzedNodeIds.add(e.nodeId);
+      }
+      const outliers = this.computeZScoreOutliers(entries, metric, threshold);
+      allOutliers.push(...outliers);
+    }
+    allOutliers.sort((a, b) => b.zScore - a.zScore);
+    const articulationPoints = this.findArticulationPoints();
+    const outlierNodeIds = new Set(allOutliers.map((o) => o.nodeId));
+    const apNodeIds = new Set(articulationPoints.map((ap) => ap.nodeId));
+    const overlapping = [...outlierNodeIds].filter((id) => apNodeIds.has(id));
+    return {
+      statisticalOutliers: allOutliers,
+      articulationPoints,
+      overlapping,
+      summary: {
+        totalNodesAnalyzed: analyzedNodeIds.size,
+        outlierCount: allOutliers.length,
+        articulationPointCount: articulationPoints.length,
+        overlapCount: overlapping.length,
+        metricsAnalyzed: metricsToAnalyze,
+        warnings,
+        threshold
+      }
+    };
+  }
+  collectMetricValues(metric, cachedCouplingData, cachedHotspotData) {
+    const entries = [];
+    if (metric === "cyclomaticComplexity") {
+      const functionNodes = [
+        ...this.store.findNodes({ type: "function" }),
+        ...this.store.findNodes({ type: "method" })
+      ];
+      for (const node of functionNodes) {
+        const cc = node.metadata?.cyclomaticComplexity;
+        if (typeof cc === "number") {
+          entries.push({
+            nodeId: node.id,
+            nodeName: node.name,
+            nodePath: node.path,
+            nodeType: node.type,
+            value: cc
+          });
+        }
+      }
+    } else if (metric === "fanIn" || metric === "fanOut" || metric === "transitiveDepth") {
+      const couplingData = cachedCouplingData ?? new GraphCouplingAdapter(this.store).computeCouplingData();
+      const fileNodes = this.store.findNodes({ type: "file" });
+      for (const fileData of couplingData.files) {
+        const fileNode = fileNodes.find((n) => (n.path ?? n.name) === fileData.file);
+        if (!fileNode) continue;
+        entries.push({
+          nodeId: fileNode.id,
+          nodeName: fileNode.name,
+          nodePath: fileNode.path,
+          nodeType: "file",
+          value: fileData[metric]
+        });
+      }
+    } else if (metric === "hotspotScore") {
+      const hotspots = cachedHotspotData ?? new GraphComplexityAdapter(this.store).computeComplexityHotspots();
+      const functionNodes = [
+        ...this.store.findNodes({ type: "function" }),
+        ...this.store.findNodes({ type: "method" })
+      ];
+      for (const h of hotspots.hotspots) {
+        const fnNode = functionNodes.find(
+          (n) => n.name === h.function && (n.path ?? "") === (h.file ?? "")
+        );
+        if (!fnNode) continue;
+        entries.push({
+          nodeId: fnNode.id,
+          nodeName: fnNode.name,
+          nodePath: fnNode.path,
+          nodeType: fnNode.type,
+          value: h.hotspotScore
+        });
+      }
+    }
+    return entries;
+  }
+  computeZScoreOutliers(entries, metric, threshold) {
+    if (entries.length === 0) return [];
+    const values = entries.map((e) => e.value);
+    const mean = values.reduce((sum, v) => sum + v, 0) / values.length;
+    const variance = values.reduce((sum, v) => sum + (v - mean) ** 2, 0) / values.length;
+    const stdDev = Math.sqrt(variance);
+    if (stdDev === 0) return [];
+    const outliers = [];
+    for (const entry of entries) {
+      const zScore = Math.abs(entry.value - mean) / stdDev;
+      if (zScore > threshold) {
+        outliers.push({
+          nodeId: entry.nodeId,
+          nodeName: entry.nodeName,
+          nodePath: entry.nodePath,
+          nodeType: entry.nodeType,
+          metric,
+          value: entry.value,
+          zScore,
+          mean,
+          stdDev
+        });
+      }
+    }
+    return outliers;
+  }
+  findArticulationPoints() {
+    const fileNodes = this.store.findNodes({ type: "file" });
+    if (fileNodes.length === 0) return [];
+    const nodeMap = /* @__PURE__ */ new Map();
+    const adj = /* @__PURE__ */ new Map();
+    for (const node of fileNodes) {
+      nodeMap.set(node.id, { name: node.name, path: node.path });
+      adj.set(node.id, /* @__PURE__ */ new Set());
+    }
+    const importEdges = this.store.getEdges({ type: "imports" });
+    for (const edge of importEdges) {
+      if (adj.has(edge.from) && adj.has(edge.to)) {
+        adj.get(edge.from).add(edge.to);
+        adj.get(edge.to).add(edge.from);
+      }
+    }
+    const disc = /* @__PURE__ */ new Map();
+    const low = /* @__PURE__ */ new Map();
+    const parent = /* @__PURE__ */ new Map();
+    const apSet = /* @__PURE__ */ new Set();
+    let timer = 0;
+    const dfs = (u) => {
+      disc.set(u, timer);
+      low.set(u, timer);
+      timer++;
+      let children = 0;
+      for (const v of adj.get(u)) {
+        if (!disc.has(v)) {
+          children++;
+          parent.set(v, u);
+          dfs(v);
+          low.set(u, Math.min(low.get(u), low.get(v)));
+          if (parent.get(u) === null && children > 1) {
+            apSet.add(u);
+          }
+          if (parent.get(u) !== null && low.get(v) >= disc.get(u)) {
+            apSet.add(u);
+          }
+        } else if (v !== parent.get(u)) {
+          low.set(u, Math.min(low.get(u), disc.get(v)));
+        }
+      }
+    };
+    for (const nodeId of adj.keys()) {
+      if (!disc.has(nodeId)) {
+        parent.set(nodeId, null);
+        dfs(nodeId);
+      }
+    }
+    const results = [];
+    for (const apId of apSet) {
+      const { components, dependentCount } = this.computeRemovalImpact(apId, adj);
+      const info = nodeMap.get(apId);
+      results.push({
+        nodeId: apId,
+        nodeName: info.name,
+        nodePath: info.path,
+        componentsIfRemoved: components,
+        dependentCount
+      });
+    }
+    results.sort((a, b) => b.dependentCount - a.dependentCount);
+    return results;
+  }
+  computeRemovalImpact(removedId, adj) {
+    const visited = /* @__PURE__ */ new Set();
+    visited.add(removedId);
+    const componentSizes = [];
+    for (const nodeId of adj.keys()) {
+      if (visited.has(nodeId)) continue;
+      const queue = [nodeId];
+      visited.add(nodeId);
+      let size = 0;
+      let head = 0;
+      while (head < queue.length) {
+        const current = queue[head++];
+        size++;
+        for (const neighbor of adj.get(current)) {
+          if (!visited.has(neighbor)) {
+            visited.add(neighbor);
+            queue.push(neighbor);
+          }
+        }
+      }
+      componentSizes.push(size);
+    }
+    const components = componentSizes.length;
+    if (componentSizes.length <= 1) {
+      return { components, dependentCount: 0 };
+    }
+    const maxSize = Math.max(...componentSizes);
+    const dependentCount = componentSizes.reduce((sum, s) => sum + s, 0) - maxSize;
+    return { components, dependentCount };
+  }
+};
+
 // src/context/Assembler.ts
 var PHASE_NODE_TYPES = {
   implement: ["file", "function", "class", "method", "interface", "variable"],
@@ -2841,6 +3079,7 @@ export {
   EDGE_TYPES,
   FusionLayer,
   GitIngestor,
+  GraphAnomalyAdapter,
   GraphComplexityAdapter,
   GraphConstraintAdapter,
   GraphCouplingAdapter,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@harness-engineering/graph",
-  "version": "0.2.3",
+  "version": "0.3.1",
   "license": "MIT",
   "description": "Knowledge graph for context assembly in Harness Engineering",
   "main": "./dist/index.js",