@claude-flow/cli 3.0.0-alpha.2 → 3.0.0-alpha.20

package/dist/src/ruvector/graph-analyzer.d.ts

@@ -0,0 +1,174 @@
+/**
+ * Graph Analyzer Module
+ *
+ * Provides code dependency graph analysis using ruvector's graph algorithms:
+ * - MinCut for code boundary detection (refactoring suggestions)
+ * - Louvain for module/community detection
+ * - Circular dependency detection
+ * - DOT format export for visualization
+ *
+ * Falls back to built-in implementations when @ruvector/wasm is not available.
+ *
+ * @module @claude-flow/cli/ruvector/graph-analyzer
+ */
+/**
+ * Node in the dependency graph
+ */
+export interface GraphNode {
+    id: string;
+    path: string;
+    name: string;
+    type: 'file' | 'module' | 'package';
+    imports: string[];
+    exports: string[];
+    size: number;
+    complexity?: number;
+}
+/**
+ * Edge in the dependency graph
+ */
+export interface GraphEdge {
+    source: string;
+    target: string;
+    type: 'import' | 'require' | 'dynamic' | 're-export';
+    weight: number;
+}
+/**
+ * Dependency graph representation
+ */
+export interface DependencyGraph {
+    nodes: Map<string, GraphNode>;
+    edges: GraphEdge[];
+    metadata: {
+        rootDir: string;
+        totalFiles: number;
+        totalEdges: number;
+        buildTime: number;
+    };
+}
+/**
+ * MinCut result representing a natural boundary in the codebase
+ */
+export interface MinCutBoundary {
+    cutValue: number;
+    partition1: string[];
+    partition2: string[];
+    cutEdges: GraphEdge[];
+    suggestion: string;
+}
+/**
+ * Community/module detection result
+ */
+export interface ModuleCommunity {
+    id: number;
+    members: string[];
+    cohesion: number;
+    centralNode?: string;
+    suggestedName?: string;
+}
+/**
+ * Circular dependency info
+ */
+export interface CircularDependency {
+    cycle: string[];
+    severity: 'low' | 'medium' | 'high';
+    suggestion: string;
+}
+/**
+ * Analysis result
+ */
+export interface GraphAnalysisResult {
+    graph: DependencyGraph;
+    boundaries?: MinCutBoundary[];
+    communities?: ModuleCommunity[];
+    circularDependencies: CircularDependency[];
+    statistics: {
+        nodeCount: number;
+        edgeCount: number;
+        avgDegree: number;
+        maxDegree: number;
+        density: number;
+        componentCount: number;
+    };
+}
+/**
+ * Interface for ruvector graph operations
+ */
+interface IRuVectorGraph {
+    mincut(nodes: string[], edges: Array<[string, string, number]>): {
+        cutValue: number;
+        partition1: string[];
+        partition2: string[];
+        cutEdges: Array<[string, string]>;
+    };
+    louvain(nodes: string[], edges: Array<[string, string, number]>): {
+        communities: Array<{
+            id: number;
+            members: string[];
+        }>;
+        modularity: number;
+    };
+}
+/**
+ * Attempt to load ruvector graph algorithms
+ */
+declare function loadRuVector(): Promise<IRuVectorGraph | null>;
+/**
+ * Build dependency graph from source directory
+ */
+export declare function buildDependencyGraph(rootDir: string, options?: {
+    include?: string[];
+    exclude?: string[];
+    maxDepth?: number;
+}): Promise<DependencyGraph>;
+/**
+ * Stoer-Wagner MinCut algorithm (fallback when ruvector not available)
+ * Finds minimum cut with deterministic result
+ */
+declare function fallbackMinCut(nodes: string[], edges: Array<[string, string, number]>): {
+    cutValue: number;
+    partition1: string[];
+    partition2: string[];
+    cutEdges: Array<[string, string]>;
+};
+/**
+ * Louvain community detection algorithm (fallback when ruvector not available)
+ * Greedy modularity optimization
+ */
+declare function fallbackLouvain(nodes: string[], edges: Array<[string, string, number]>): {
+    communities: Array<{
+        id: number;
+        members: string[];
+    }>;
+    modularity: number;
+};
+/**
+ * Detect circular dependencies using DFS
+ */
+export declare function detectCircularDependencies(graph: DependencyGraph): CircularDependency[];
+/**
+ * Analyze graph boundaries using MinCut algorithm
+ */
+export declare function analyzeMinCutBoundaries(graph: DependencyGraph, numPartitions?: number): Promise<MinCutBoundary[]>;
+/**
+ * Analyze module communities using Louvain algorithm
+ */
+export declare function analyzeModuleCommunities(graph: DependencyGraph): Promise<ModuleCommunity[]>;
+/**
+ * Full graph analysis
+ */
+export declare function analyzeGraph(rootDir: string, options?: {
+    includeBoundaries?: boolean;
+    includeModules?: boolean;
+    numPartitions?: number;
+}): Promise<GraphAnalysisResult>;
+/**
+ * Export graph to DOT format for visualization
+ */
+export declare function exportToDot(result: GraphAnalysisResult, options?: {
+    includeLabels?: boolean;
+    colorByCommunity?: boolean;
+    highlightCycles?: boolean;
+}): string;
+export { loadRuVector, fallbackMinCut, fallbackLouvain, };
+//# sourceMappingURL=graph-analyzer.d.ts.map

package/dist/src/ruvector/graph-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-analyzer.d.ts","sourceRoot":"","sources":["../../../src/ruvector/graph-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AASH;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;IACpC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,CAAC;IACrD,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC9B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,QAAQ,EAAE;QACR,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;CACH;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,EAAE,SAAS,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACpC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,eAAe,CAAC;IACvB,UAAU,CAAC,EAAE,cAAc,EAAE,CAAC;IAC9B,WAAW,CAAC,EAAE,eAAe,EAAE,CAAC;IAChC,oBAAoB,EAAE,kBAAkB,EAAE,CAAC;IAC3C,UAAU,EAAE;QACV,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;CACH;AAMD;;GAEG;AACH,UAAU,cAAc;IACtB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG;QAC/D,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;KACnC,CAAC;IACF,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG;QAChE,WAAW,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,EAAE,CAAA;SAAE,CAAC,CAAC;QACtD,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;CACH;AAKD;;GAEG;AACH,iBAAe,YAAY,IAAI,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,CAwC5D;AAiHD;;GAEG;AACH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IACP,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACd,GACL,OAAO,CAAC,eAAe,CAAC,CAuI1B;AAiCD;;;GAGG;AACH,iBAAS,cAAc,CACrB,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,GACrC;IACD,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACnC,CAwGA;AAMD;;;GAGG;AACH,iBAAS,eAAe,CACtB,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,GACrC;IACD,WAAW,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACtD,UAAU,EAAE,MAAM,CAAC;CACpB,CAqIA;AAMD;;GAEG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,eAAe,GAAG,kBAAkB,EAAE,CAqDvF;AAoCD;;GAEG;AACH,wBAAsB,uBAAuB,CAC3C,KAAK,EAAE,eAAe,EACtB,aAAa,GAAE,MAAU,GACxB,OAAO,CAAC,cAAc,EAAE,CAAC,CAoD3B;AAsBD;;GAEG;AACH,wBAAsB,wBAAwB,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CA8CjG;AAqBD;;GAEG;AACH,wBAAsB,YAAY,CAChC,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IACP,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,aAAa,CAAC,EAAE,MAAM,CAAC;CACnB,GACL,OAAO,CAAC,mBAAmB,CAAC,CAyE9B;AAMD;;GAEG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,mBAAmB,EAC3B,OAAO,GAAE;IACP,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,eAAe,CAAC,EAAE,OAAO,CAAC;CACtB,GACL,MAAM,CAwFR;AAMD,OAAO,EACL,YAAY,EACZ,cAAc,EACd,eAAe,GAChB,CAAC"}