@nexus-ioc/graph-analyzer 0.1.0 → 0.2.0

package/CHANGELOG.md

@@ -5,6 +5,16 @@ All notable changes to the @nexus-ioc/graph-analyzer package will be documented
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## 0.2.0 (2026-10-12)
+
+### BREAKING CHANGES
+
+- `scopeAnalysis` JSON shape: Transient providers were previously mislabelled `"Singleton"` in `providerScopes` and are now labelled `"Transient"`. `scopedProviders` is renamed to `transientProviders`. `scopeMismatches` and the `ScopeMismatch` export are removed, because `Scope.Scoped` no longer exists in `@nexus-ioc/core`.
+
+### Added
+
+- Child scopes: the graph follows `@Module({ children })`. JSON modules gain `scope` (the module that roots the child scope) and `children`, and a provider dependency gets `crossScope: true` when a child-scope provider gets it from an ancestor scope (approximate).
+
 ## [0.1.0] - 2025-01-18
 
 **First public release of @nexus-ioc/graph-analyzer!**

package/README.md

@@ -8,7 +8,7 @@
 [![Tests](https://img.shields.io/badge/tests-443%20passing-brightgreen.svg)](./src)
 [![Node.js](https://img.shields.io/badge/node-%3E%3D14.0.0-brightgreen.svg)](https://nodejs.org/)
 
-Analyze and visualize dependency injection graphs in [Nexus IoC](https://github.com/Isqanderm/ioc) applications. Extract complete metadata about modules, providers, and dependencies **without running your application**. Detect circular dependencies, unused providers, scope mismatches, and visualize your architecture with interactive HTML graphs.
+Analyze and visualize dependency injection graphs in [Nexus IoC](https://github.com/Isqanderm/ioc) applications. Extract complete metadata about modules, providers, and dependencies **without running your application**. Detect circular dependencies, unused providers, provider scopes, and visualize your architecture with interactive HTML graphs.
 
 ## ✨ Features
 
@@ -24,7 +24,7 @@ Analyze and visualize dependency injection graphs in [Nexus IoC](https://github.
 - 🔄 **Circular Dependency Detection** - Detect circular imports and provider dependencies
 - 🗑️ **Unused Provider Detection** - Find providers that are registered but never injected
 - 📊 **Module Depth Analysis** - Analyze module hierarchy depth and complexity metrics
-- 🎯 **Provider Scope Analysis** - Detect scope mismatches (Singleton depending on Request-scoped)
+- 🎯 **Provider Scope Analysis** - Report each provider's scope (Singleton or Transient)
 - ⚠️ **Missing Decorator Detection** - Identify dependencies without explicit `@Inject` decorators
 
 ### Visualization & Output
@@ -141,7 +141,7 @@ graph-analyzer [options] <entry-file>
 | `--check-circular` | Detect circular dependencies in modules and providers | `false` |
 | `--check-unused` | Detect providers that are registered but never injected | `false` |
 | `--check-depth` | Analyze module hierarchy depth and complexity | `false` |
-| `--check-scope` | Detect provider scope mismatches | `false` |
+| `--check-scope` | Report provider scopes (Singleton or Transient) | `false` |
 | `--check-ci` | Enable all checks (circular, unused, depth, scope) | `false` |
 | `--deep-module-threshold <n>` | Threshold for identifying deep modules | `5` |
 
@@ -177,7 +177,7 @@ npx graph-analyzer --check-unused -f html src/main.ts
 # Analyze module depth and complexity
 npx graph-analyzer --check-depth --deep-module-threshold 3 src/main.ts
 
-# Detect scope mismatches (Singleton depending on Request-scoped)
+# Report provider scopes (Singleton or Transient)
 npx graph-analyzer --check-scope src/main.ts
 
 # HTML with dark theme and WebStorm links
@@ -302,41 +302,77 @@ npx graph-analyzer --check-depth --deep-module-threshold 5 src/main.ts
 
 ### Provider Scope Analysis
 
-Detects scope mismatches where Singleton providers depend on Request-scoped providers.
+Reports the scope of every provider. `Scope.Scoped` was removed from `@nexus-ioc/core`, so only `Singleton` and `Transient` exist and there are no scope mismatches to detect.
 
 ```bash
 npx graph-analyzer --check-scope src/main.ts
 ```
 
-**Detects:**
-- Singleton providers depending on Request-scoped providers (memory leak risk)
-- Scope inconsistencies that can cause unexpected behavior
-- Provides suggestions for fixing scope issues
-
 **Example Output:**
 ```json
 {
   "analysis": {
     "scopeAnalysis": {
-      "scopeMismatches": [
-        {
-          "provider": "UserService",
-          "providerScope": "Singleton",
-          "dependency": "RequestContext",
-          "dependencyScope": "Request",
-          "severity": "error",
-          "message": "Singleton provider 'UserService' depends on Request-scoped provider 'RequestContext'",
-          "suggestions": [
-            "Change 'UserService' to Request scope",
-            "Change 'RequestContext' to Singleton scope if it doesn't need request-specific state"
-          ]
-        }
+      "totalProviders": 2,
+      "singletonProviders": 1,
+      "transientProviders": 1,
+      "providerScopes": [
+        { "token": "UserService", "module": "AppModule", "scope": "Singleton", "type": "Class", "dependencies": ["RequestContext"] },
+        { "token": "RequestContext", "module": "AppModule", "scope": "Transient", "type": "Class", "dependencies": [] }
       ]
     }
   }
 }
 ```
 
+**Migration from earlier output:**
+- Transient providers were previously labelled `"Singleton"` in `providerScopes`; they are now labelled `"Transient"`.
+- `scopedProviders` is renamed to `transientProviders`.
+- `scopeMismatches` and the `ScopeMismatch` export are removed.
+
+### Child Scopes
+
+Modules listed in `@Module({ children })` (direct class references and the `lazy(() => import("...").then((m) => m.X))` shape) are not imports: each one opens a child container scope that is created at runtime with `createChild()`. The analyzer follows them, resolves each scope's dependencies with the declaring module's visibility as the fallback, and reports the scopes in the output. Applications without `children` are unchanged.
+
+**Example Output:**
+```json
+{
+  "modules": [
+    {
+      "name": "AppModule",
+      "path": "/path/to/app.module.ts",
+      "imports": [],
+      "exports": [],
+      "providers": ["EventBus"],
+      "isGlobal": false,
+      "scope": "AppModule",
+      "children": [{ "name": "ProfileModule", "path": "/path/to/profile.module.ts" }]
+    },
+    {
+      "name": "ProfileModule",
+      "path": "/path/to/profile.module.ts",
+      "imports": [],
+      "exports": [],
+      "providers": ["ProfileStore"],
+      "isGlobal": false,
+      "scope": "ProfileModule"
+    }
+  ],
+  "providers": [
+    {
+      "token": "ProfileStore",
+      "type": "Class",
+      "module": { "name": "ProfileModule", "path": "/path/to/profile.module.ts" },
+      "dependencies": [{ "token": "EventBus", "optional": false, "crossScope": true }]
+    }
+  ]
+}
+```
+
+- `scope` on a module is the name of the module that roots its scope (a module present in several scopes is tagged with the first one). `children` lists the modules it declares as children.
+- `crossScope: true` on a dependency means a provider in a child scope gets that token from an ancestor scope. It is approximate: it only checks that some module of an ancestor scope registers the token, not the imports/exports visibility rules. `@nexus-ioc/type-checker` reports the visibility-correct answer as `fromParentScope`.
+- Circular dependency detection is scope-aware: a child-scope provider that shadows a parent token (the parent's `A -> B` plus a child's `B -> A`) is not reported as a cycle, while a real cycle inside a child scope still is.
+
 ### Missing Decorator Detection
 
 Identifies dependencies that lack explicit `@Inject` decorators.
@@ -403,7 +439,7 @@ The JSON output provides a structured representation of your dependency graph wi
     "circularDependencies": [],
     "unusedProviders": [],
     "depthAnalysis": { "maxDepth": 3, "averageDepth": 2.1 },
-    "scopeAnalysis": { "scopeMismatches": [] }
+    "scopeAnalysis": { "totalProviders": 0, "singletonProviders": 0, "transientProviders": 0, "providerScopes": [] }
   },
   "metadata": {
     "entryPoint": "/path/to/main.ts",
@@ -493,7 +529,7 @@ class UserService {
 
 ✅ **Different Provider Types**
 ```typescript
-@NsModule({
+@Module({
   providers: [
     UserService,                                    // Class
     { provide: 'CONFIG', useValue: config },       // UseValue
@@ -505,11 +541,12 @@ class UserService {
 
 ### Token Types
 
-The analyzer detects three types of injection tokens:
+The analyzer detects four types of injection tokens:
 
 - **Class tokens**: `@Inject(UserService)`
 - **String tokens**: `@Inject('CONFIG')`
 - **Symbol tokens**: `@Inject(Symbol.for('key'))`
+- **InjectionToken constants**: `@Inject(CONFIG)` where `const CONFIG = new InjectionToken<Config>('CONFIG')`. The constant is one token across re-exports, and graph labels show the const name.
 
 ## 🏗️ Architecture
 

package/dist/analyzer/circular-dependency-detector.d.ts

@@ -1,5 +1,4 @@
-import type { ParseEntryFile } from "../parser/parse-entry-file";
-import type { ParseNsModule } from "../parser/parse-ns-module";
+import type { NexusGraphModel } from "../graph/nexus-graph-model";
 /**
  * Represents a circular dependency cycle
  */
@@ -30,11 +29,14 @@ export interface CircularDependencyAnalysis {
  * Detects circular dependencies in module imports and provider dependencies
  *
  * Uses depth-first search (DFS) to detect cycles in the dependency graph.
- * Can detect both module-level circular imports and provider-level circular dependencies.
+ * Can detect both module-level circular imports and provider-level circular
+ * dependencies — the latter covering both constructor-injected dependencies
+ * and `useFactory` `inject` tokens, since `NexusGraphModel` merges both into
+ * a single provider dependency list.
  *
  * @example
  * ```typescript
- * const detector = new CircularDependencyDetector(modulesGraph);
+ * const detector = new CircularDependencyDetector(graphModel);
  * const analysis = detector.analyze();
  *
  * if (analysis.hasCircularDependencies) {
@@ -46,13 +48,15 @@ export interface CircularDependencyAnalysis {
  * ```
  */
 export declare class CircularDependencyDetector {
-    private readonly graph;
+    private readonly graphModel;
+    /** `provider.id -> provider.token`, populated by `buildProviderDependencyMap()`. */
+    private readonly providerLabels;
     /**
      * Create a new CircularDependencyDetector instance
      *
-     * @param graph - Map of module names to parsed modules
+     * @param graphModel - The application's graph model
      */
-    constructor(graph: Map<string, ParseNsModule | ParseEntryFile>);
+    constructor(graphModel: NexusGraphModel);
     /**
      * Analyze the dependency graph for circular dependencies
      *
@@ -71,9 +75,12 @@ export declare class CircularDependencyDetector {
      */
     private detectModuleCircularDependencies;
     /**
-     * Depth-first search for module circular dependencies
+     * Depth-first search for module circular dependencies. Traverses by
+     * `GraphModuleNode.id` (collision-free); `cyclePath`/`path` are built
+     * from ids and translated to display names only when a cycle is reported.
      */
     private dfsModules;
+    private moduleLabel;
     /**
      * Detect circular dependencies in provider dependencies
      *
@@ -84,9 +91,22 @@ export declare class CircularDependencyDetector {
      */
     private detectProviderCircularDependencies;
     /**
-     * Build a map of provider tokens to their dependencies
+     * Build a map of provider ids to their dependency ids and a map of
+     * provider ids to display tokens, across every module in the graph.
+     * Keyed by `GraphProviderNode.id`/`GraphProviderDependency.tokenId`
+     * (collision-free), not the rendered `token` — two different provider
+     * classes named alike must not collapse into one map entry.
      */
     private buildProviderDependencyMap;
+    /**
+     * With child scopes, every scope has its own provider instances: a node
+     * is `(scope, provider id)`, and an edge goes to the nearest scope (own
+     * first, then ancestors) that registers the dependency. This keeps a
+     * child provider that overrides a parent token from being merged with
+     * the parent's provider into a false cycle.
+     */
+    private buildScopedProviderDependencyMap;
+    private providerLabel;
     /**
      * Depth-first search for provider circular dependencies
      */

package/dist/analyzer/circular-dependency-detector.js

@@ -1,15 +1,19 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.CircularDependencyDetector = void 0;
+const scope_resolution_1 = require("../graph/scope-resolution");
 /**
  * Detects circular dependencies in module imports and provider dependencies
  *
  * Uses depth-first search (DFS) to detect cycles in the dependency graph.
- * Can detect both module-level circular imports and provider-level circular dependencies.
+ * Can detect both module-level circular imports and provider-level circular
+ * dependencies — the latter covering both constructor-injected dependencies
+ * and `useFactory` `inject` tokens, since `NexusGraphModel` merges both into
+ * a single provider dependency list.
  *
  * @example
  * ```typescript
- * const detector = new CircularDependencyDetector(modulesGraph);
+ * const detector = new CircularDependencyDetector(graphModel);
  * const analysis = detector.analyze();
  *
  * if (analysis.hasCircularDependencies) {
@@ -24,10 +28,12 @@ class CircularDependencyDetector {
     /**
      * Create a new CircularDependencyDetector instance
      *
-     * @param graph - Map of module names to parsed modules
+     * @param graphModel - The application's graph model
      */
-    constructor(graph) {
-        this.graph = graph;
+    constructor(graphModel) {
+        this.graphModel = graphModel;
+        /** `provider.id -> provider.token`, populated by `buildProviderDependencyMap()`. */
+        this.providerLabels = new Map();
     }
     /**
      * Analyze the dependency graph for circular dependencies
@@ -64,52 +70,59 @@ class CircularDependencyDetector {
         const visited = new Set();
         const recursionStack = new Set();
         const path = [];
-        const entryModule = this.graph.get("entry");
-        if (!entryModule || !entryModule.name) {
+        const entryModuleId = this.graphModel.entryModuleId;
+        if (!entryModuleId) {
             return cycles;
         }
         // Start DFS from entry module
-        this.dfsModules(entryModule.name, visited, recursionStack, path, cycles);
+        this.dfsModules(entryModuleId, visited, recursionStack, path, cycles);
         return cycles;
     }
     /**
-     * Depth-first search for module circular dependencies
+     * Depth-first search for module circular dependencies. Traverses by
+     * `GraphModuleNode.id` (collision-free); `cyclePath`/`path` are built
+     * from ids and translated to display names only when a cycle is reported.
      */
-    dfsModules(moduleName, visited, recursionStack, path, cycles) {
+    dfsModules(moduleId, visited, recursionStack, path, cycles) {
         // Mark current node as visited and add to recursion stack
-        visited.add(moduleName);
-        recursionStack.add(moduleName);
-        path.push(moduleName);
-        const parseNsModule = this.graph.get(moduleName);
-        if (!parseNsModule) {
+        visited.add(moduleId);
+        recursionStack.add(moduleId);
+        path.push(moduleId);
+        const module = this.graphModel.modules.get(moduleId);
+        if (!module) {
             // Clean up and return
-            recursionStack.delete(moduleName);
+            recursionStack.delete(moduleId);
             path.pop();
             return;
         }
         // Visit all imported modules
-        for (const importedModule of parseNsModule.imports) {
-            if (!visited.has(importedModule)) {
+        for (const importedModule of module.imports) {
+            const importedId = importedModule.id;
+            if (!visited.has(importedId)) {
                 // Recursively visit unvisited module
-                this.dfsModules(importedModule, visited, recursionStack, path, cycles);
+                this.dfsModules(importedId, visited, recursionStack, path, cycles);
             }
-            else if (recursionStack.has(importedModule)) {
+            else if (recursionStack.has(importedId)) {
                 // Found a cycle - extract the cycle path
-                const cycleStartIndex = path.indexOf(importedModule);
+                const cycleStartIndex = path.indexOf(importedId);
                 const cyclePath = path.slice(cycleStartIndex);
-                cyclePath.push(importedModule); // Complete the cycle
+                cyclePath.push(importedId); // Complete the cycle
+                const cycleLabels = cyclePath.map((id) => this.moduleLabel(id));
                 cycles.push({
                     type: "module",
-                    cycle: cyclePath,
+                    cycle: cycleLabels,
                     severity: "error",
-                    message: `Circular module import detected: ${cyclePath.join(" -> ")}`,
+                    message: `Circular module import detected: ${cycleLabels.join(" -> ")}`,
                 });
             }
         }
         // Remove from recursion stack and path
-        recursionStack.delete(moduleName);
+        recursionStack.delete(moduleId);
         path.pop();
     }
+    moduleLabel(moduleId) {
+        return this.graphModel.modules.get(moduleId)?.name ?? moduleId;
+    }
     /**
      * Detect circular dependencies in provider dependencies
      *
@@ -126,76 +139,106 @@ class CircularDependencyDetector {
         // Build provider dependency map
         const providerDeps = this.buildProviderDependencyMap();
         // Run DFS from each provider
-        for (const providerToken of providerDeps.keys()) {
-            if (!visited.has(providerToken)) {
-                this.dfsProviders(providerToken, providerDeps, visited, recursionStack, path, cycles);
+        for (const providerId of providerDeps.keys()) {
+            if (!visited.has(providerId)) {
+                this.dfsProviders(providerId, providerDeps, visited, recursionStack, path, cycles);
             }
         }
         return cycles;
     }
     /**
-     * Build a map of provider tokens to their dependencies
+     * Build a map of provider ids to their dependency ids and a map of
+     * provider ids to display tokens, across every module in the graph.
+     * Keyed by `GraphProviderNode.id`/`GraphProviderDependency.tokenId`
+     * (collision-free), not the rendered `token` — two different provider
+     * classes named alike must not collapse into one map entry.
      */
     buildProviderDependencyMap() {
+        this.providerLabels.clear();
+        if (this.graphModel.scopes) {
+            return this.buildScopedProviderDependencyMap();
+        }
         const providerDeps = new Map();
-        // Traverse all modules
-        for (const [key, value] of this.graph.entries()) {
-            if (key === "entry")
-                continue;
-            const parseNsModule = value;
-            if (!parseNsModule.providers)
-                continue;
-            // Extract dependencies for each provider
-            for (const provider of parseNsModule.providers) {
-                if (!provider.token)
-                    continue;
-                const dependencies = [];
-                if (provider.dependencies && Array.isArray(provider.dependencies)) {
-                    for (const dep of provider.dependencies) {
-                        if (dep.token && !dep.optional) {
-                            dependencies.push(dep.token);
-                        }
-                    }
+        for (const module of this.graphModel.modules.values()) {
+            for (const provider of module.providers) {
+                const dependencies = provider.dependencies
+                    .filter((dependency) => !dependency.optional && dependency.tokenId)
+                    .map((dependency) => dependency.tokenId);
+                providerDeps.set(provider.id, dependencies);
+                this.providerLabels.set(provider.id, provider.token);
+            }
+        }
+        return providerDeps;
+    }
+    /**
+     * With child scopes, every scope has its own provider instances: a node
+     * is `(scope, provider id)`, and an edge goes to the nearest scope (own
+     * first, then ancestors) that registers the dependency. This keeps a
+     * child provider that overrides a parent token from being merged with
+     * the parent's provider into a false cycle.
+     */
+    buildScopedProviderDependencyMap() {
+        const providerDeps = new Map();
+        const scopeIndex = new scope_resolution_1.GraphScopeIndex(this.graphModel);
+        const key = (scopeRootId, providerId) => `${scopeRootId}\u0000${providerId}`;
+        for (const scope of this.graphModel.scopes ?? []) {
+            for (const moduleId of scope.moduleIds) {
+                const module = this.graphModel.modules.get(moduleId);
+                for (const provider of module?.providers ?? []) {
+                    const dependencies = provider.dependencies
+                        .filter((dependency) => !dependency.optional && dependency.tokenId)
+                        .map((dependency) => {
+                        const tokenId = dependency.tokenId;
+                        const providingScope = scopeIndex.providingScope(scope.rootId, tokenId) ??
+                            scope.rootId;
+                        return key(providingScope, tokenId);
+                    });
+                    const providerKey = key(scope.rootId, provider.id);
+                    providerDeps.set(providerKey, dependencies);
+                    this.providerLabels.set(providerKey, provider.token);
                 }
-                providerDeps.set(provider.token, dependencies);
             }
         }
         return providerDeps;
     }
+    providerLabel(providerId) {
+        return this.providerLabels.get(providerId) ?? providerId;
+    }
     /**
      * Depth-first search for provider circular dependencies
      */
-    dfsProviders(providerToken, providerDeps, visited, recursionStack, path, cycles) {
+    dfsProviders(providerId, providerDeps, visited, recursionStack, path, cycles) {
         // Mark current node as visited and add to recursion stack
-        visited.add(providerToken);
-        recursionStack.add(providerToken);
-        path.push(providerToken);
-        const dependencies = providerDeps.get(providerToken) || [];
+        visited.add(providerId);
+        recursionStack.add(providerId);
+        path.push(providerId);
+        const dependencies = providerDeps.get(providerId) || [];
         // Visit all dependencies
-        for (const depToken of dependencies) {
-            if (!providerDeps.has(depToken)) {
+        for (const depId of dependencies) {
+            if (!providerDeps.has(depId)) {
                 // Dependency is not a provider (might be external), skip
                 continue;
             }
-            if (!visited.has(depToken)) {
+            if (!visited.has(depId)) {
                 // Recursively visit unvisited dependency
-                this.dfsProviders(depToken, providerDeps, visited, recursionStack, path, cycles);
+                this.dfsProviders(depId, providerDeps, visited, recursionStack, path, cycles);
             }
-            else if (recursionStack.has(depToken)) {
+            else if (recursionStack.has(depId)) {
                 // Found a cycle - extract the cycle path
-                const cycleStartIndex = path.indexOf(depToken);
+                const cycleStartIndex = path.indexOf(depId);
                 const cyclePath = path.slice(cycleStartIndex);
-                cyclePath.push(depToken); // Complete the cycle
+                cyclePath.push(depId); // Complete the cycle
+                const cycleLabels = cyclePath.map((id) => this.providerLabel(id));
                 cycles.push({
                     type: "provider",
-                    cycle: cyclePath,
+                    cycle: cycleLabels,
                     severity: "error",
-                    message: `Circular provider dependency detected: ${cyclePath.join(" -> ")}`,
+                    message: `Circular provider dependency detected: ${cycleLabels.join(" -> ")}`,
                 });
             }
         }
         // Remove from recursion stack and path
-        recursionStack.delete(providerToken);
+        recursionStack.delete(providerId);
         path.pop();
     }
 }

package/dist/analyzer/circular-dependency-detector.js.map

@@ -1 +1 @@
-{"version":3,"file":"circular-dependency-detector.js","sourceRoot":"","sources":["../../src/analyzer/circular-dependency-detector.ts"],"names":[],"mappings":";;;AAgCA;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAa,0BAA0B;IACtC;;;;OAIG;IACH,YACkB,KAAkD;QAAlD,UAAK,GAAL,KAAK,CAA6C;IACjE,CAAC;IAEJ;;;;;;OAMG;IACH,OAAO;QACN,MAAM,oBAAoB,GAAyB,EAAE,CAAC;QAEtD,uCAAuC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,gCAAgC,EAAE,CAAC;QAC7D,oBAAoB,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE3C,8CAA8C;QAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,kCAAkC,EAAE,CAAC;QACjE,oBAAoB,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;QAE7C,OAAO;YACN,uBAAuB,EAAE,oBAAoB,CAAC,MAAM,GAAG,CAAC;YACxD,oBAAoB;YACpB,mBAAmB,EAAE,YAAY,CAAC,MAAM;YACxC,qBAAqB,EAAE,cAAc,CAAC,MAAM;SAC5C,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACK,gCAAgC;QACvC,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAmB,CAAC;QAC9D,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACvC,OAAO,MAAM,CAAC;QACf,CAAC;QAED,8BAA8B;QAC9B,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAEzE,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CACjB,UAAkB,EAClB,OAAoB,EACpB,cAA2B,EAC3B,IAAc,EACd,MAA4B;QAE5B,0DAA0D;QAC1D,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACxB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAkB,CAAC;QAClE,IAAI,CAAC,aAAa,EAAE,CAAC;YACpB,sBAAsB;YACtB,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO;QACR,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,cAAc,IAAI,aAAa,CAAC,OAAO,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;gBAClC,qCAAqC;gBACrC,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACxE,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/C,yCAAyC;gBACzC,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;gBACrD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,qBAAqB;gBAErD,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,SAAS;oBAChB,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,oCAAoC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBACrE,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,uCAAuC;QACvC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;OAOG;IACK,kCAAkC;QACzC,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,gCAAgC;QAChC,MAAM,YAAY,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAEvD,6BAA6B;QAC7B,KAAK,MAAM,aAAa,IAAI,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,YAAY,CAChB,aAAa,EACb,YAAY,EACZ,OAAO,EACP,cAAc,EACd,IAAI,EACJ,MAAM,CACN,CAAC;YACH,CAAC;QACF,CAAC;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;OAEG;IACK,0BAA0B;QACjC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEjD,uBAAuB;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,IAAI,GAAG,KAAK,OAAO;gBAAE,SAAS;YAE9B,MAAM,aAAa,GAAG,KAAsB,CAAC;YAC7C,IAAI,CAAC,aAAa,CAAC,SAAS;gBAAE,SAAS;YAEvC,yCAAyC;YACzC,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,SAAS,EAAE,CAAC;gBAChD,IAAI,CAAC,QAAQ,CAAC,KAAK;oBAAE,SAAS;gBAE9B,MAAM,YAAY,GAAa,EAAE,CAAC;gBAElC,IAAI,QAAQ,CAAC,YAAY,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;oBACnE,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,YAA4B,EAAE,CAAC;wBACzD,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;4BAChC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBAC9B,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAChD,CAAC;QACF,CAAC;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,YAAY,CACnB,aAAqB,EACrB,YAAmC,EACnC,OAAoB,EACpB,cAA2B,EAC3B,IAAc,EACd,MAA4B;QAE5B,0DAA0D;QAC1D,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC3B,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEzB,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAE3D,yBAAyB;QACzB,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;YACrC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjC,yDAAyD;gBACzD,SAAS;YACV,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,yCAAyC;gBACzC,IAAI,CAAC,YAAY,CAChB,QAAQ,EACR,YAAY,EACZ,OAAO,EACP,cAAc,EACd,IAAI,EACJ,MAAM,CACN,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,yCAAyC;gBACzC,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB;gBAE/C,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,UAAU;oBAChB,KAAK,EAAE,SAAS;oBAChB,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,0CAA0C,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBAC3E,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,uCAAuC;QACvC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;CACD;AAvOD,gEAuOC"}
+{"version":3,"file":"circular-dependency-detector.js","sourceRoot":"","sources":["../../src/analyzer/circular-dependency-detector.ts"],"names":[],"mappings":";;;AACA,gEAA4D;AA8B5D;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,0BAA0B;IAItC;;;;OAIG;IACH,YAA6B,UAA2B;QAA3B,eAAU,GAAV,UAAU,CAAiB;QARxD,oFAAoF;QACnE,mBAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAOD,CAAC;IAE5D;;;;;;OAMG;IACH,OAAO;QACN,MAAM,oBAAoB,GAAyB,EAAE,CAAC;QAEtD,uCAAuC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,gCAAgC,EAAE,CAAC;QAC7D,oBAAoB,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAE3C,8CAA8C;QAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,kCAAkC,EAAE,CAAC;QACjE,oBAAoB,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;QAE7C,OAAO;YACN,uBAAuB,EAAE,oBAAoB,CAAC,MAAM,GAAG,CAAC;YACxD,oBAAoB;YACpB,mBAAmB,EAAE,YAAY,CAAC,MAAM;YACxC,qBAAqB,EAAE,cAAc,CAAC,MAAM;SAC5C,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACK,gCAAgC;QACvC,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC;QACpD,IAAI,CAAC,aAAa,EAAE,CAAC;YACpB,OAAO,MAAM,CAAC;QACf,CAAC;QAED,8BAA8B;QAC9B,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAEtE,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;OAIG;IACK,UAAU,CACjB,QAAgB,EAChB,OAAoB,EACpB,cAA2B,EAC3B,IAAc,EACd,MAA4B;QAE5B,0DAA0D;QAC1D,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtB,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,sBAAsB;YACtB,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO;QACR,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9B,qCAAqC;gBACrC,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACpE,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC3C,yCAAyC;gBACzC,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACjD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,qBAAqB;gBACjD,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;gBAEhE,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,WAAW;oBAClB,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,oCAAoC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBACvE,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,uCAAuC;QACvC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;IAEO,WAAW,CAAC,QAAgB;QACnC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,IAAI,QAAQ,CAAC;IAChE,CAAC;IAED;;;;;;;OAOG;IACK,kCAAkC;QACzC,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,gCAAgC;QAChC,MAAM,YAAY,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAEvD,6BAA6B;QAC7B,KAAK,MAAM,UAAU,IAAI,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,YAAY,CAChB,UAAU,EACV,YAAY,EACZ,OAAO,EACP,cAAc,EACd,IAAI,EACJ,MAAM,CACN,CAAC;YACH,CAAC;QACF,CAAC;QAED,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACK,0BAA0B;QACjC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAE5B,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,gCAAgC,EAAE,CAAC;QAChD,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEjD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACvD,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACzC,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY;qBACxC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,OAAO,CAAC;qBAClE,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAiB,CAAC,CAAC;gBAEpD,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;gBAC5C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtD,CAAC;QACF,CAAC;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACK,gCAAgC;QACvC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,MAAM,UAAU,GAAG,IAAI,kCAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,GAAG,GAAG,CAAC,WAAmB,EAAE,UAAkB,EAAE,EAAE,CACvD,GAAG,WAAW,SAAS,UAAU,EAAE,CAAC;QAErC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAClD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACrD,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;oBAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY;yBACxC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,OAAO,CAAC;yBAClE,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE;wBACnB,MAAM,OAAO,GAAG,UAAU,CAAC,OAAiB,CAAC;wBAC7C,MAAM,cAAc,GACnB,UAAU,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC;4BAChD,KAAK,CAAC,MAAM,CAAC;wBACd,OAAO,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;oBACrC,CAAC,CAAC,CAAC;oBAEJ,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACnD,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;oBAC5C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACtD,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,UAAkB;QACvC,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC;IAC1D,CAAC;IAED;;OAEG;IACK,YAAY,CACnB,UAAkB,EAClB,YAAmC,EACnC,OAAoB,EACpB,cAA2B,EAC3B,IAAc,EACd,MAA4B;QAE5B,0DAA0D;QAC1D,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACxB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtB,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAExD,yBAAyB;QACzB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,yDAAyD;gBACzD,SAAS;YACV,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,yCAAyC;gBACzC,IAAI,CAAC,YAAY,CAChB,KAAK,EACL,YAAY,EACZ,OAAO,EACP,cAAc,EACd,IAAI,EACJ,MAAM,CACN,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtC,yCAAyC;gBACzC,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,qBAAqB;gBAC5C,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;gBAElE,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,UAAU;oBAChB,KAAK,EAAE,WAAW;oBAClB,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,0CAA0C,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBAC7E,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,uCAAuC;QACvC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;CACD;AAtRD,gEAsRC"}

package/dist/analyzer/module-depth-analyzer.d.ts

@@ -1,5 +1,4 @@
-import type { ParseEntryFile } from "../parser/parse-entry-file";
-import type { ParseNsModule } from "../parser/parse-ns-module";
+import type { NexusGraphModel } from "../graph/nexus-graph-model";
 /**
  * Information about a module's position in the hierarchy
  */
@@ -59,7 +58,7 @@ export interface ModuleDepthAnalysis {
  *
  * @example
  * ```typescript
- * const analyzer = new ModuleDepthAnalyzer(modulesGraph);
+ * const analyzer = new ModuleDepthAnalyzer(graphModel);
  * const analysis = analyzer.analyze();
  *
  * console.log(`Max depth: ${analysis.maxDepth}`);
@@ -71,15 +70,15 @@ export interface ModuleDepthAnalysis {
  * ```
  */
 export declare class ModuleDepthAnalyzer {
-    private readonly graph;
+    private readonly graphModel;
     private readonly deepModuleThreshold;
     /**
      * Create a new ModuleDepthAnalyzer instance
      *
-     * @param graph - Map of module names to parsed modules
+     * @param graphModel - The application's graph model
      * @param deepModuleThreshold - Custom threshold for deep modules (optional)
      */
-    constructor(graph: Map<string, ParseNsModule | ParseEntryFile>, deepModuleThreshold?: number);
+    constructor(graphModel: NexusGraphModel, deepModuleThreshold?: number);
     /**
      * Analyze the module hierarchy depth and complexity
      *
@@ -87,19 +86,17 @@ export declare class ModuleDepthAnalyzer {
      */
     analyze(): ModuleDepthAnalysis;
     /**
-     * Get all modules from the graph (excluding entry file)
-     */
-    private getModules;
-    /**
-     * Calculate depth for each module using BFS from entry point
+     * Calculate depth for each module (by id) using BFS from entry point
      */
     private calculateModuleDepths;
     /**
-     * Calculate complexity metrics for each module
+     * Calculate complexity metrics for each module. `moduleDepths` is keyed
+     * by id; the returned `ModuleDepthInfo[]` reports display names, as before.
      */
     private calculateComplexityMetrics;
     /**
-     * Calculate fan-in for all modules (how many modules depend on each module)
+     * Calculate fan-in for all modules (how many modules depend on each
+     * module), keyed by id
      */
     private calculateFanIn;
     /**