@aiready/context-analyzer 0.22.14 → 0.22.16

package/dist/chunk-WLXLBWDU.mjs

@@ -0,0 +1,96 @@
+// src/utils/dependency-graph-utils.ts
+function calculateImportDepthFromEdges(file, edges, visited = /* @__PURE__ */ new Set(), depth = 0) {
+  if (visited.has(file)) return depth;
+  const dependencies = edges.get(file);
+  if (!dependencies || dependencies.size === 0) return depth;
+  const nextVisited = new Set(visited);
+  nextVisited.add(file);
+  let maxDepth = depth;
+  for (const dep of dependencies) {
+    maxDepth = Math.max(
+      maxDepth,
+      calculateImportDepthFromEdges(dep, edges, nextVisited, depth + 1)
+    );
+  }
+  return maxDepth;
+}
+function getTransitiveDependenciesFromEdges(file, edges, visited = /* @__PURE__ */ new Set()) {
+  const result = /* @__PURE__ */ new Set();
+  function dfs(current) {
+    if (visited.has(current)) return;
+    visited.add(current);
+    const dependencies = edges.get(current);
+    if (!dependencies) return;
+    for (const dep of dependencies) {
+      if (dep !== file) {
+        result.add(dep);
+        dfs(dep);
+      }
+    }
+  }
+  dfs(file);
+  return Array.from(result);
+}
+function detectGraphCycles(edges) {
+  const cycles = [];
+  const visited = /* @__PURE__ */ new Set();
+  const recursionStack = /* @__PURE__ */ new Set();
+  function dfs(file, path) {
+    if (recursionStack.has(file)) {
+      const cycleStart = path.indexOf(file);
+      if (cycleStart !== -1) {
+        cycles.push([...path.slice(cycleStart), file]);
+      }
+      return;
+    }
+    if (visited.has(file)) return;
+    visited.add(file);
+    recursionStack.add(file);
+    const dependencies = edges.get(file);
+    if (dependencies) {
+      for (const dep of dependencies) {
+        dfs(dep, [...path, file]);
+      }
+    }
+    recursionStack.delete(file);
+  }
+  for (const file of edges.keys()) {
+    if (!visited.has(file)) {
+      dfs(file, []);
+    }
+  }
+  return cycles;
+}
+function detectGraphCyclesFromFile(file, edges) {
+  const cycles = [];
+  const visited = /* @__PURE__ */ new Set();
+  const recursionStack = /* @__PURE__ */ new Set();
+  function dfs(current, path) {
+    if (recursionStack.has(current)) {
+      const cycleStart = path.indexOf(current);
+      if (cycleStart !== -1) {
+        cycles.push([...path.slice(cycleStart), current]);
+      }
+      return;
+    }
+    if (visited.has(current)) return;
+    visited.add(current);
+    recursionStack.add(current);
+    const dependencies = edges.get(current);
+    if (dependencies) {
+      for (const dep of dependencies) {
+        dfs(dep, [...path, current]);
+      }
+    }
+    recursionStack.delete(current);
+  }
+  dfs(file, []);
+  return cycles;
+}
+
+export {
+  calculateImportDepthFromEdges,
+  getTransitiveDependenciesFromEdges,
+  detectGraphCycles,
+  detectGraphCyclesFromFile
+};