@danielsimonjr/memory-mcp 0.48.0 → 9.8.2

package/dist/core/GraphTraversal.d.ts

@@ -0,0 +1,141 @@
+/**
+ * Graph Traversal
+ *
+ * Phase 4 Sprints 6-8: Graph traversal algorithms for knowledge graph analysis.
+ * Includes BFS, DFS, shortest path, all paths, connected components, and centrality.
+ *
+ * @module core/GraphTraversal
+ */
+import type { Relation, TraversalOptions, TraversalResult, PathResult, ConnectedComponentsResult, CentralityResult } from '../types/index.js';
+import type { GraphStorage } from './GraphStorage.js';
+/**
+ * Graph traversal algorithms for knowledge graph analysis.
+ *
+ * Provides BFS, DFS, shortest path finding, connected component detection,
+ * and centrality metrics for analyzing graph structure.
+ */
+export declare class GraphTraversal {
+    private storage;
+    constructor(storage: GraphStorage);
+    /**
+     * Get neighbors of a node based on traversal direction and filters.
+     *
+     * @param entityName - Entity to get neighbors for
+     * @param options - Traversal options
+     * @returns Array of neighbor entity names with their relations
+     */
+    getNeighborsWithRelations(entityName: string, options?: TraversalOptions): Array<{
+        neighbor: string;
+        relation: Relation;
+    }>;
+    /**
+     * Breadth-First Search traversal starting from a given entity.
+     *
+     * @param startEntity - Entity name to start traversal from
+     * @param options - Traversal options
+     * @returns Traversal result with visited nodes, depths, and parent pointers
+     */
+    bfs(startEntity: string, options?: TraversalOptions): TraversalResult;
+    /**
+     * Depth-First Search traversal starting from a given entity.
+     *
+     * @param startEntity - Entity name to start traversal from
+     * @param options - Traversal options
+     * @returns Traversal result with visited nodes, depths, and parent pointers
+     */
+    dfs(startEntity: string, options?: TraversalOptions): TraversalResult;
+    /**
+     * Find the shortest path between two entities using BFS.
+     *
+     * @param source - Source entity name
+     * @param target - Target entity name
+     * @param options - Traversal options
+     * @returns PathResult if path exists, null otherwise
+     */
+    findShortestPath(source: string, target: string, options?: TraversalOptions): Promise<PathResult | null>;
+    /**
+     * Reconstruct path from parent pointers.
+     */
+    private reconstructPath;
+    /**
+     * Find all paths between two entities up to a maximum depth.
+     *
+     * Phase 9B: Supports cancellation via AbortSignal in options.
+     *
+     * @param source - Source entity name
+     * @param target - Target entity name
+     * @param maxDepth - Maximum path length (default: 5)
+     * @param options - Traversal options (includes signal for cancellation)
+     * @returns Array of PathResult objects for all found paths
+     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
+     */
+    findAllPaths(source: string, target: string, maxDepth?: number, options?: TraversalOptions & {
+        signal?: AbortSignal;
+    }): Promise<PathResult[]>;
+    /**
+     * Find all connected components in the graph.
+     *
+     * Uses BFS to find all weakly connected components (treating the graph as undirected).
+     *
+     * @returns ConnectedComponentsResult with all components
+     */
+    findConnectedComponents(): Promise<ConnectedComponentsResult>;
+    /**
+     * Calculate degree centrality for all entities.
+     *
+     * Degree centrality is the number of connections an entity has,
+     * normalized by the maximum possible connections.
+     *
+     * @param direction - Direction to count: 'in', 'out', or 'both' (default)
+     * @param topN - Number of top entities to return (default: 10)
+     * @returns CentralityResult with scores and top entities
+     */
+    calculateDegreeCentrality(direction?: 'in' | 'out' | 'both', topN?: number): Promise<CentralityResult>;
+    /**
+     * Calculate betweenness centrality for all entities.
+     *
+     * Betweenness centrality measures how often a node appears on shortest paths
+     * between other nodes. Uses Brandes' algorithm for efficiency.
+     *
+     * @param options - Configuration options
+     * @param options.topN - Number of top entities to return (default: 10)
+     * @param options.chunkSize - Yield control every N vertices (default: 50)
+     * @param options.onProgress - Progress callback (0.0 to 1.0)
+     * @param options.approximate - Use approximation for faster results (default: false)
+     * @param options.sampleRate - Sample rate for approximation (default: 0.2)
+     * @returns CentralityResult with scores and top entities
+     */
+    calculateBetweennessCentrality(options?: {
+        topN?: number;
+        chunkSize?: number;
+        onProgress?: (progress: number) => void;
+        approximate?: boolean;
+        sampleRate?: number;
+    }): Promise<CentralityResult>;
+    /**
+     * Sample entities randomly for approximation algorithms.
+     *
+     * @param entities - Array of entities to sample from
+     * @param sampleSize - Number of entities to sample
+     * @returns Array of sampled entities
+     */
+    private sampleEntities;
+    /**
+     * Calculate PageRank centrality for all entities.
+     *
+     * PageRank measures importance based on incoming connections from
+     * other important nodes. Uses iterative power method.
+     *
+     * @param dampingFactor - Damping factor (default: 0.85)
+     * @param maxIterations - Maximum iterations (default: 100)
+     * @param tolerance - Convergence tolerance (default: 1e-6)
+     * @param topN - Number of top entities to return (default: 10)
+     * @returns CentralityResult with scores and top entities
+     */
+    calculatePageRank(dampingFactor?: number, maxIterations?: number, tolerance?: number, topN?: number): Promise<CentralityResult>;
+    /**
+     * Get top N entities from a scores map.
+     */
+    private getTopEntities;
+}
+//# sourceMappingURL=GraphTraversal.d.ts.map

package/dist/core/GraphTraversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTraversal.d.ts","sourceRoot":"","sources":["../../src/core/GraphTraversal.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAEV,QAAQ,EACR,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,yBAAyB,EACzB,gBAAgB,EACjB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAatD;;;;;GAKG;AACH,qBAAa,cAAc;IACb,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,YAAY;IAIzC;;;;;;OAMG;IACH,yBAAyB,CACvB,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,gBAAqB,GAC7B,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,QAAQ,CAAA;KAAE,CAAC;IA4ClD;;;;;;OAMG;IACH,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,eAAe;IAwCzE;;;;;;OAMG;IACH,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,eAAe;IA8CzE;;;;;;;OAOG;IACG,gBAAgB,CACpB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,gBAAqB,GAC7B,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IA6C7B;;OAEG;IACH,OAAO,CAAC,eAAe;IA2BvB;;;;;;;;;;;OAWG;IACG,YAAY,CAChB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,QAAQ,GAAE,MAAU,EACpB,OAAO,GAAE,gBAAgB,GAAG;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAO,GACxD,OAAO,CAAC,UAAU,EAAE,CAAC;IAkExB;;;;;;OAMG;IACG,uBAAuB,IAAI,OAAO,CAAC,yBAAyB,CAAC;IA0CnE;;;;;;;;;OASG;IACG,yBAAyB,CAC7B,SAAS,GAAE,IAAI,GAAG,KAAK,GAAG,MAAe,EACzC,IAAI,GAAE,MAAW,GAChB,OAAO,CAAC,gBAAgB,CAAC;IA+B5B;;;;;;;;;;;;;OAaG;IACG,8BAA8B,CAClC,OAAO,GAAE;QACP,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;QACxC,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,UAAU,CAAC,EAAE,MAAM,CAAC;KAChB,GACL,OAAO,CAAC,gBAAgB,CAAC;IAiH5B;;;;;;OAMG;IACH,OAAO,CAAC,cAAc;IAUtB;;;;;;;;;;;OAWG;IACG,iBAAiB,CACrB,aAAa,GAAE,MAAa,EAC5B,aAAa,GAAE,MAAY,EAC3B,SAAS,GAAE,MAAa,EACxB,IAAI,GAAE,MAAW,GAChB,OAAO,CAAC,gBAAgB,CAAC;IA0E5B;;OAEG;IACH,OAAO,CAAC,cAAc;CASvB"}