graphbox 1.2.1 → 1.3.0

package/dist/algorithms/extraction/filter.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for attribute-based subgraph filtering
+ */
+export {};
+//# sourceMappingURL=filter.unit.test.d.ts.map

package/dist/algorithms/extraction/filter.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/filter.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/extraction/forbidden-subgraphs.d.ts

@@ -0,0 +1,211 @@
+/**
+ * Forbidden Subgraph Detection
+ *
+ * Efficient detection of induced subgraphs in graphs.
+ * Core infrastructure for 120+ forbidden subgraph graph classes.
+ *
+ * Key operations:
+ * - `hasInducedSubgraph()` - Check if graph contains specific induced subgraph
+ * - `detectMultipleSubgraphs()` - Batch detection of multiple patterns
+ * - `SUBGRAPH_PATTERNS` - Predefined pattern library
+ */
+/**
+ * Subgraph pattern template
+ *
+ * Patterns define vertex count and edge connections.
+ * Vertices are numbered 0 to size-1.
+ */
+export interface SubgraphPattern {
+    /** Pattern name (e.g., "P5", "C5", "bull") */
+    name: string;
+    /** Number of vertices in pattern */
+    size: number;
+    /** Edge connections as vertex pairs */
+    edges: Array<[number, number]>;
+}
+/**
+ * Adjacency list representation
+ *
+ * Maps vertex ID to set of adjacent vertices.
+ */
+export type AdjacencyList = ReadonlyMap<number, ReadonlySet<number>>;
+/**
+ * Build adjacency list from edge list
+ *
+ * @param vertices - Set of vertex IDs
+ * @param edges - Array of edge pairs
+ * @returns Adjacency list map
+ */
+export declare const buildAdjacencyList: (vertices: ReadonlySet<number>, edges: ReadonlyArray<readonly [number, number]>) => AdjacencyList;
+/**
+ * Check if graph contains induced subgraph matching pattern
+ *
+ * @param adjacency - Graph adjacency list
+ * @param pattern - Pattern to search for
+ * @returns true if induced subgraph exists
+ */
+export declare const hasInducedSubgraph: (adjacency: AdjacencyList, pattern: SubgraphPattern) => boolean;
+/**
+ * Detect multiple subgraph patterns in one pass
+ *
+ * Optimized batch detection that avoids redundant combination generation.
+ *
+ * @param adjacency - Graph adjacency list
+ * @param patterns - Array of patterns to detect
+ * @returns Map of pattern name to detection result
+ */
+export declare const detectMultipleSubgraphs: (adjacency: AdjacencyList, patterns: readonly SubgraphPattern[]) => ReadonlyMap<string, boolean>;
+/**
+ * Library of common forbidden subgraph patterns
+ */
+export declare const SUBGRAPH_PATTERNS: {
+    /** Path P3 (3 vertices) */
+    readonly P3: SubgraphPattern;
+    /** Path P4 (4 vertices) */
+    readonly P4: SubgraphPattern;
+    /** Path P5 (5 vertices) */
+    readonly P5: SubgraphPattern;
+    /** Path P6 (6 vertices) */
+    readonly P6: SubgraphPattern;
+    /** Path P7 (7 vertices) */
+    readonly P7: SubgraphPattern;
+    /** Cycle C3 (triangle) */
+    readonly C3: SubgraphPattern;
+    /** Cycle C4 (square) */
+    readonly C4: SubgraphPattern;
+    /** Cycle C5 (pentagon) */
+    readonly C5: SubgraphPattern;
+    /** Cycle C6 (hexagon) */
+    readonly C6: SubgraphPattern;
+    /** Cycle C7 (heptagon) */
+    readonly C7: SubgraphPattern;
+    /** Complete K2 (edge) */
+    readonly K2: SubgraphPattern;
+    /** Complete K3 (triangle) */
+    readonly K3: SubgraphPattern;
+    /** Complete K4 */
+    readonly K4: SubgraphPattern;
+    /** Complete K5 */
+    readonly K5: SubgraphPattern;
+    /**
+     * Bull graph
+     * Triangle with two pendant vertices
+     *
+     *     2
+     *     |
+     * 0 - 1 - 3
+     *     |
+     *     4
+     */
+    readonly bull: SubgraphPattern;
+    /**
+     * Gem graph
+     * P4 with a universal vertex
+     *
+     *     2
+     *     |
+     * 0 - 1 - 3
+     *     |
+     *     4
+     * plus all edges from vertex 1
+     */
+    readonly gem: SubgraphPattern;
+    /**
+     * Net graph
+     * Triangle with three pendant vertices
+     *
+     *       2
+     *      /|\
+     *     3 0 4
+     *      \|/
+     *       1
+     */
+    readonly net: SubgraphPattern;
+    /**
+     * House graph
+     * P5 with a chord forming a "roof"
+     *
+     *   2 - 3
+     *   |   |
+     * 0 - 1 - 4
+     */
+    readonly house: SubgraphPattern;
+    /**
+     * Diamond graph
+     * K4 minus one edge
+     *
+     *   2
+     *  /|\
+     * 3-0-1
+     *  \|/
+     *   4
+     */
+    readonly diamond: SubgraphPattern;
+    /**
+     * Claw graph K1,3
+     * Star with 3 leaves
+     *
+     *     2
+     *     |
+     * 0 - 1 - 3
+     *     |
+     *     4
+     */
+    readonly claw: SubgraphPattern;
+    /**
+     * Fork graph
+     * P4 with an extra pendant attached to second vertex
+     *
+     *     2
+     *     |
+     * 0 - 1 - 3 - 4
+     */
+    readonly fork: SubgraphPattern;
+    /**
+     * Chair graph
+     * P4 plus a pendant attached to center
+     *
+     *   2
+     *   |
+     *   1
+     *   |
+     * 0-1-3-4  (vertex 1 has pendant 2)
+     */
+    readonly chair: SubgraphPattern;
+    /**
+     * Dart graph
+     * Triangle with a path attached
+     *
+     *   1---2
+     *   |\ /
+     *   | 0
+     *   |/
+     *   3
+     */
+    readonly dart: SubgraphPattern;
+    /**
+     * Kite graph
+     * Diamond with a pendant
+     */
+    readonly kite: SubgraphPattern;
+    /**
+     * Banner graph
+     * Triangle with a path of length 2 attached
+     */
+    readonly banner: SubgraphPattern;
+    /**
+     * 4-cycle with chord
+     * C4 plus one diagonal
+     */
+    readonly C4_chord: SubgraphPattern;
+};
+/**
+ * Get all pattern names from library
+ */
+export declare const ALL_PATTERN_NAMES: readonly (keyof typeof SUBGRAPH_PATTERNS)[];
+/**
+ * Get pattern by name
+ * @param name
+ */
+export declare const getPattern: (name: keyof typeof SUBGRAPH_PATTERNS) => SubgraphPattern;
+//# sourceMappingURL=forbidden-subgraphs.d.ts.map

package/dist/algorithms/extraction/forbidden-subgraphs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"forbidden-subgraphs.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/forbidden-subgraphs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC/B,8CAA8C;IAC9C,IAAI,EAAE,MAAM,CAAC;IAEb,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IAEb,uCAAuC;IACvC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAC/B;AAED;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;AAErE;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,GAC9B,UAAU,WAAW,CAAC,MAAM,CAAC,EAC7B,OAAO,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAC7C,aAqBF,CAAC;AA6HF;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,GAC9B,WAAW,aAAa,EACxB,SAAS,eAAe,KACtB,OAmBF,CAAC;AAgCF;;;;;;;;GAQG;AACH,eAAO,MAAM,uBAAuB,GACnC,WAAW,aAAa,EACxB,UAAU,SAAS,eAAe,EAAE,KAClC,WAAW,CAAC,MAAM,EAAE,OAAO,CA8C7B,CAAC;AAwEF;;GAEG;AACH,eAAO,MAAM,iBAAiB;IAC7B,2BAA2B;;IAG3B,2BAA2B;;IAG3B,2BAA2B;;IAG3B,2BAA2B;;IAG3B,2BAA2B;;IAG3B,0BAA0B;;IAG1B,wBAAwB;;IAGxB,0BAA0B;;IAG1B,yBAAyB;;IAGzB,0BAA0B;;IAG1B,yBAAyB;;IAGzB,6BAA6B;;IAG7B,kBAAkB;;IAGlB,kBAAkB;;IAGlB;;;;;;;;;OASG;mBAWE,eAAe;IAEpB;;;;;;;;;;OAUG;kBAaE,eAAe;IAEpB;;;;;;;;;OASG;kBAYE,eAAe;IAEpB;;;;;;;OAOG;oBAWE,eAAe;IAEpB;;;;;;;;;OASG;sBAWE,eAAe;IAEpB;;;;;;;;;OASG;mBASE,eAAe;IAEpB;;;;;;;OAOG;mBAUE,eAAe;IAEpB;;;;;;;;;OASG;oBAUE,eAAe;IAEpB;;;;;;;;;OASG;mBAWE,eAAe;IAEpB;;;OAGG;mBAYE,eAAe;IAEpB;;;OAGG;qBAWE,eAAe;IAEpB;;;OAGG;uBAWE,eAAe;CACX,CAAC;AAEX;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAEzB,SAAS,CAAC,MAAM,OAAO,iBAAiB,CAAC,EAAE,CAAC;AAEjD;;;GAGG;AACH,eAAO,MAAM,UAAU,GACtB,MAAM,MAAM,OAAO,iBAAiB,KAClC,eAMF,CAAC"}

package/dist/algorithms/extraction/motif.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for motif detection algorithms
+ */
+export {};
+//# sourceMappingURL=motif.unit.test.d.ts.map

package/dist/algorithms/extraction/motif.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"motif.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/motif.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/extraction/path.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for path extraction utilities
+ */
+export {};
+//# sourceMappingURL=path.unit.test.d.ts.map

package/dist/algorithms/extraction/path.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/path.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/extraction/subgraph.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for subgraph extraction utilities
+ */
+export {};
+//# sourceMappingURL=subgraph.unit.test.d.ts.map

package/dist/algorithms/extraction/subgraph.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/subgraph.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/extraction/truss.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for K-Truss extraction algorithm
+ */
+export {};
+//# sourceMappingURL=truss.unit.test.d.ts.map

package/dist/algorithms/extraction/truss.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"truss.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/truss.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/extraction/validators.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=validators.unit.test.d.ts.map

package/dist/algorithms/extraction/validators.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validators.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/extraction/validators.unit.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/graph/graph-adapter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-adapter.d.ts","sourceRoot":"","sources":["../../../src/algorithms/graph/graph-adapter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AACrE,OAAO,KAAK,EAAE,IAAI,EAAC,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAErC;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,YAAY,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,CAAE,YAAW,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3E,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAAL,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAE/C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI;IAK7B,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAQlC,WAAW,IAAI,CAAC,EAAE;IAIlB,UAAU,IAAI,OAAO;IAIrB,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE;CAOjC"}
+{"version":3,"file":"graph-adapter.d.ts","sourceRoot":"","sources":["../../../src/algorithms/graph/graph-adapter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AACrE,OAAO,KAAK,EAAE,IAAI,EAAC,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAErC;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,YAAY,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,CAAE,YAAW,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3E,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAAL,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAE/C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI;IAK7B,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAUlC,WAAW,IAAI,CAAC,EAAE;IAIlB,UAAU,IAAI,OAAO;IAIrB,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE;CAOjC"}

package/dist/algorithms/graph/graph-adapter.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=graph-adapter.unit.test.d.ts.map

package/dist/algorithms/graph/graph-adapter.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adapter.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/graph/graph-adapter.unit.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/graph/graph.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for Graph class
+ */
+export {};
+//# sourceMappingURL=graph.unit.test.d.ts.map

package/dist/algorithms/graph/graph.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/graph/graph.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/hierarchical/clustering.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=clustering.unit.test.d.ts.map

package/dist/algorithms/hierarchical/clustering.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clustering.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/hierarchical/clustering.unit.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/layout/hierarchical-layout.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for hierarchical layout algorithm
+ */
+export {};
+//# sourceMappingURL=hierarchical-layout.unit.test.d.ts.map

package/dist/algorithms/layout/hierarchical-layout.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchical-layout.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/layout/hierarchical-layout.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/metrics/cluster-quality.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for cluster quality metrics
+ */
+export {};
+//# sourceMappingURL=cluster-quality.unit.test.d.ts.map

package/dist/algorithms/metrics/cluster-quality.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster-quality.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/metrics/cluster-quality.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/metrics/conductance.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for conductance calculation
+ */
+export {};
+//# sourceMappingURL=conductance.unit.test.d.ts.map

package/dist/algorithms/metrics/conductance.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conductance.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/metrics/conductance.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/metrics/modularity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"modularity.d.ts","sourceRoot":"","sources":["../../../src/algorithms/metrics/modularity.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,KAAK,EAAE,IAAI,EAAC,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,SAAS,CAAC,CAAC,CAAC,EAAE,KAAG,MA8GrH,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,4BAA4B,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,MAAM,KAAG,MA8E9I,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,wBAAwB,GAAI,SAAS,MAAM,EAAE,YAAY,MAAM,EAAE,WAAW,MAAM,EAAE,UAAU,MAAM,EAAE,GAAG,MAAM,KAAG,MAe9H,CAAC"}
+{"version":3,"file":"modularity.d.ts","sourceRoot":"","sources":["../../../src/algorithms/metrics/modularity.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,KAAK,EAAE,IAAI,EAAC,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,SAAS,CAAC,CAAC,CAAC,EAAE,KAAG,MA8GrH,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,4BAA4B,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,MAAM,KAAG,MAwE9I,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,wBAAwB,GAAI,SAAS,MAAM,EAAE,YAAY,MAAM,EAAE,WAAW,MAAM,EAAE,UAAU,MAAM,EAAE,GAAG,MAAM,KAAG,MAe9H,CAAC"}

package/dist/algorithms/metrics/modularity.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for modularity calculation
+ */
+export {};
+//# sourceMappingURL=modularity.unit.test.d.ts.map

package/dist/algorithms/metrics/modularity.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularity.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/metrics/modularity.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/partitioning/spectral.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for spectral graph partitioning
+ */
+export {};
+//# sourceMappingURL=spectral.unit.test.d.ts.map

package/dist/algorithms/partitioning/spectral.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spectral.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/partitioning/spectral.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/pathfinding/dijkstra.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for Dijkstra's shortest path algorithm
+ */
+export {};
+//# sourceMappingURL=dijkstra.unit.test.d.ts.map

package/dist/algorithms/pathfinding/dijkstra.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/dijkstra.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/pathfinding/mutual-information.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=mutual-information.unit.test.d.ts.map

package/dist/algorithms/pathfinding/mutual-information.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutual-information.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/mutual-information.unit.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/pathfinding/path-ranking.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"path-ranking.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/path-ranking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,KAAK,IAAI,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAQ,KAAK,MAAM,EAAQ,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EACN,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAE5B,MAAM,sBAAsB,CAAC;AAE9B;;;;;;;;;;;;GAYG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;AAEtD;;;;;;;;GAQG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,gBAAgB,CAAC;AAE9D;;;;GAIG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACzD,iCAAiC;IACjC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjB,+CAA+C;IAC/C,KAAK,EAAE,MAAM,CAAC;IAEd,yEAAyE;IACzE,eAAe,EAAE,MAAM,CAAC;IAExB,qDAAqD;IACrD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB,iEAAiE;IACjE,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,2EAA2E;IAC3E,YAAY,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,GAAG,IAAI;IACvE;;;;;OAKG;IACH,aAAa,CAAC,EAAE,aAAa,CAAC;IAE9B;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IAExB;;;OAGG;IACH,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB;;;;OAIG;IACH,OAAO,CAAC,EAAE,sBAAsB,CAAC;IAEjC;;OAEG;IACH,QAAQ,CAAC,EAAE,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzC;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CACjB;AAiaD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACvD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAS,MAAM,EACf,OAAO,MAAM,EACb,SAAQ,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAM,KAClC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CA8E/C,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACzD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAS,MAAM,EACf,OAAO,MAAM,EACb,SAAQ,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAM,KAClC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAY7C,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,gBAAgB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAC9D,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAQ,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAM;IAMpD;;;;;OAKG;oBAEO,MAAM,SACR,MAAM,cACF,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAG5C;;;;;OAKG;uBAEO,MAAM,SACR,MAAM,cACF,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI5C;;OAEG;;CAGJ,CAAC"}
+{"version":3,"file":"path-ranking.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/path-ranking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,KAAK,IAAI,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAQ,KAAK,MAAM,EAAQ,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EACN,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAE5B,MAAM,sBAAsB,CAAC;AAE9B;;;;;;;;;;;;GAYG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;AAEtD;;;;;;;;GAQG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,gBAAgB,CAAC;AAE9D;;;;GAIG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACzD,iCAAiC;IACjC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjB,+CAA+C;IAC/C,KAAK,EAAE,MAAM,CAAC;IAEd,yEAAyE;IACzE,eAAe,EAAE,MAAM,CAAC;IAExB,qDAAqD;IACrD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB,iEAAiE;IACjE,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,2EAA2E;IAC3E,YAAY,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,GAAG,IAAI;IACvE;;;;;OAKG;IACH,aAAa,CAAC,EAAE,aAAa,CAAC;IAE9B;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IAExB;;;OAGG;IACH,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IAEtC;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB;;;;OAIG;IACH,OAAO,CAAC,EAAE,sBAAsB,CAAC;IAEjC;;OAEG;IACH,QAAQ,CAAC,EAAE,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzC;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CACjB;AAicD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACvD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAS,MAAM,EACf,OAAO,MAAM,EACb,SAAQ,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAM,KAClC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAyF/C,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACzD,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAS,MAAM,EACf,OAAO,MAAM,EACb,SAAQ,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAM,KAClC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAY7C,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,gBAAgB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAC9D,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,SAAQ,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAM;IAMpD;;;;;OAKG;oBAEO,MAAM,SACR,MAAM,cACF,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAG5C;;;;;OAKG;uBAEO,MAAM,SACR,MAAM,cACF,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI5C;;OAEG;;CAGJ,CAAC"}

package/dist/algorithms/pathfinding/path-ranking.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=path-ranking.unit.test.d.ts.map

package/dist/algorithms/pathfinding/path-ranking.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-ranking.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/path-ranking.unit.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/pathfinding/priority-queue.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for MinHeap priority queue
+ */
+export {};
+//# sourceMappingURL=priority-queue.unit.test.d.ts.map

package/dist/algorithms/pathfinding/priority-queue.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/priority-queue.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/pathfinding/random-path-sampling.d.ts

@@ -0,0 +1,31 @@
+import { Graph } from '../graph/graph.js';
+import { GraphError } from '../types/errors.js';
+import { Edge, Node } from '../types/graph.js';
+import { Result } from '../types/result.js';
+import { RankedPath } from './path-ranking.js';
+/**
+ * Configuration for random path sampling.
+ */
+export interface RandomPathSamplingConfig {
+    /** Maximum number of paths to sample */
+    maxPaths?: number;
+    /** Random seed for reproducibility */
+    seed?: number;
+    /** Maximum path length to prevent infinite walks */
+    maxLength?: number;
+    /** Maximum attempts per path before giving up */
+    maxAttemptsPerPath?: number;
+}
+/**
+ * Sample random paths between source and target using random walks.
+ *
+ * Performs multiple random walks from source, attempting to reach target.
+ * Each successful path is converted to a RankedPath with placeholder MI values.
+ * @param graph - The graph to sample paths from
+ * @param sourceId - Starting node ID
+ * @param targetId - Ending node ID
+ * @param config - Sampling configuration
+ * @returns Result containing array of ranked paths or error
+ */
+export declare const sampleRandomPaths: <N extends Node, E extends Edge>(graph: Graph<N, E>, sourceId: string, targetId: string, config?: RandomPathSamplingConfig) => Result<Array<RankedPath<N, E>>, GraphError>;
+//# sourceMappingURL=random-path-sampling.d.ts.map

package/dist/algorithms/pathfinding/random-path-sampling.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-path-sampling.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/random-path-sampling.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAE/C,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,oBAAoB,CAAC;AACpE,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACxC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sCAAsC;IACtC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iDAAiD;IACjD,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAeD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,iBAAiB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAC/D,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,UAAU,MAAM,EAChB,UAAU,MAAM,EAChB,SAAQ,wBAA6B,KACnC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CA8D5C,CAAC"}

package/dist/algorithms/pathfinding/shortest-path-ranking.d.ts

@@ -0,0 +1,28 @@
+import { Graph } from '../graph/graph.js';
+import { GraphError } from '../types/errors.js';
+import { Edge, Node } from '../types/graph.js';
+import { Result } from '../types/result.js';
+import { RankedPath } from './path-ranking.js';
+/**
+ * Configuration for shortest path ranking.
+ */
+export interface ShortestPathRankingConfig {
+    /** Maximum number of paths to find */
+    maxPaths?: number;
+}
+/**
+ * Find k-shortest paths between source and target.
+ *
+ * Uses a modified Dijkstra approach: finds shortest path, then iteratively
+ * finds next-shortest paths by removing edges from previously found paths.
+ *
+ * Note: This is a simplified k-shortest paths implementation. For production,
+ * consider Yen's algorithm or Eppstein's algorithm for better performance.
+ * @param graph - The graph to search
+ * @param sourceId - Starting node ID
+ * @param targetId - Ending node ID
+ * @param config - Configuration for pathfinding
+ * @returns Result containing array of ranked paths or error
+ */
+export declare const shortestPathRanking: <N extends Node, E extends Edge>(graph: Graph<N, E>, sourceId: string, targetId: string, config?: ShortestPathRankingConfig) => Result<Array<RankedPath<N, E>>, GraphError>;
+//# sourceMappingURL=shortest-path-ranking.d.ts.map

package/dist/algorithms/pathfinding/shortest-path-ranking.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path-ranking.d.ts","sourceRoot":"","sources":["../../../src/algorithms/pathfinding/shortest-path-ranking.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAEpE,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACzC,sCAAsC;IACtC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACjE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,UAAU,MAAM,EAChB,UAAU,MAAM,EAChB,SAAQ,yBAA8B,KACpC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CA4D5C,CAAC"}

package/dist/algorithms/traversal/bidirectional-bfs.d.ts

@@ -26,6 +26,19 @@ export interface BidirectionalBFSResult {
 /**
  * Generic bidirectional breadth-first search with degree-based node prioritization.
  *
+ * **NOTE: This is an earlier design with parameterised termination.**
+ * For the parameter-free version that aligns with the thesis theoretical framework,
+ * see DegreePrioritisedExpansion (N≥1 seeds, frontier exhaustion only).
+ *
+ * **Design Relationship**:
+ * - BidirectionalBFS: Earlier design, N=2 only, has termination parameters (targetPaths, maxIterations)
+ * - DegreePrioritisedExpansion: Refined design, N≥1 with identical code path, parameter-free
+ *
+ * This implementation is suitable for production use cases where:
+ * - Predictable resource consumption is required
+ * - Finding *a* path quickly is more important than exhaustive sampling
+ * - Service-level objectives constrain iteration count
+ *
  * Searches for paths between two seed nodes by expanding frontiers from both directions.
  * Uses priority queue to process low-degree nodes first, naturally prioritizing specific
  * connections over generic ones.
@@ -52,6 +65,8 @@ export interface BidirectionalBFSResult {
  * const result = await bfs.search();
  * console.log(`Found ${result.paths.length} paths in ${result.iterations} iterations`);
  * ```
+ *
+ * @see DegreePrioritisedExpansion - Parameter-free version for N≥1 seeds
  */
 export declare class BidirectionalBFS<T> {
     private readonly expander;

package/dist/algorithms/traversal/bidirectional-bfs.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bidirectional-bfs.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/bidirectional-bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAGhE;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACvC,qCAAqC;IACrC,WAAW,EAAE,MAAM,CAAC;IAEpB,6CAA6C;IAC7C,aAAa,EAAE,MAAM,CAAC;IAEtB,qFAAqF;IACrF,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,0EAA0E;IAC1E,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAElB,+BAA+B;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAEtB,+BAA+B;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAEtB,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAC;CACnB;AAYD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,qBAAa,gBAAgB,CAAC,CAAC;IAM7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO;IARzB,OAAO,CAAC,UAAU,CAAkB;IACpC,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,MAAM,CAAW;gBAGP,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,uBAAuB;IAuBlD;;;;OAIG;IACG,MAAM,IAAI,OAAO,CAAC,sBAAsB,CAAC;IA0E/C;;;;;OAKG;YACW,cAAc;IA8B5B;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAsB3B;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IA4BvB;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAQlB;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;CAwB/B"}
+{"version":3,"file":"bidirectional-bfs.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/bidirectional-bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAGhE;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACvC,qCAAqC;IACrC,WAAW,EAAE,MAAM,CAAC;IAEpB,6CAA6C;IAC7C,aAAa,EAAE,MAAM,CAAC;IAEtB,qFAAqF;IACrF,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,0EAA0E;IAC1E,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAElB,+BAA+B;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAEtB,+BAA+B;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAEtB,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAC;CACnB;AAYD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,qBAAa,gBAAgB,CAAC,CAAC;IAM7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO;IARzB,OAAO,CAAC,UAAU,CAAkB;IACpC,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,MAAM,CAAW;gBAGP,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,uBAAuB;IAuBlD;;;;OAIG;IACG,MAAM,IAAI,OAAO,CAAC,sBAAsB,CAAC;IA0E/C;;;;;OAKG;YACW,cAAc;IA8B5B;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAsB3B;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IA4BvB;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAQlB;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;CAwB/B"}

package/dist/algorithms/traversal/degree-prioritised-expansion-intersection.unit.test.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Regression test for frontier intersection detection bug (Jan 21 2026).
+ *
+ * BACKGROUND:
+ * Commit bec6dbf optimized intersection checking from O(F) to O(1) using
+ * nodeToFrontierIndex Map. The bug: Map was updated on every visit instead
+ * of only first visit, preventing intersection detection.
+ *
+ * This test creates a minimal graph where two frontiers MUST meet, verifying
+ * that path recording works correctly.
+ */
+export {};
+//# sourceMappingURL=degree-prioritised-expansion-intersection.unit.test.d.ts.map

package/dist/algorithms/traversal/degree-prioritised-expansion-intersection.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"degree-prioritised-expansion-intersection.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/degree-prioritised-expansion-intersection.unit.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG"}

package/dist/algorithms/traversal/degree-prioritised-expansion.d.ts

@@ -17,6 +17,12 @@ export interface DegreePrioritisedExpansionResult {
     visitedPerFrontier: Array<Set<string>>;
     /** Statistics about the expansion */
     stats: ExpansionStats;
+    /**
+     * Maps each sampled node to the iteration when it was first discovered.
+     * Used for computing coverage efficiency metrics (first-discovery iteration,
+     * budget checkpoint coverage, area-under-curve).
+     */
+    nodeDiscoveryIteration: Map<string, number>;
 }
 /**
  * Statistics collected during expansion.
@@ -34,6 +40,22 @@ export interface ExpansionStats {
 /**
  * Degree-Prioritised Bidirectional Expansion
  *
+ * **Thesis Alignment**: This is the primary implementation of the seed-bounded
+ * sampling algorithm described in Chapter 4 of the thesis. It embodies the
+ * parameter-free design with implicit termination via frontier exhaustion.
+ *
+ * **Design Relationship**:
+ * - BidirectionalBFS: Earlier design, N=2 only, has termination parameters (targetPaths, maxIterations)
+ * - DegreePrioritisedExpansion: Refined design (this file), N≥1 with identical code path, parameter-free
+ *
+ * Use this implementation when:
+ * - Representative sampling of graph structure is required
+ * - Evaluation dataset construction demands bias-free samples
+ * - N≥1 seed nodes need to be supported
+ * - Termination should be determined by graph structure, not arbitrary limits
+ *
+ * For production pathfinding with resource constraints, consider BidirectionalBFS instead.
+ *
  * A unified algorithm for representative graph sampling between N ≥ 1 seed nodes.
  * Uses node degree as priority (low degree = high priority) to explore peripheral
  * routes before hub-dominated paths.
@@ -69,6 +91,8 @@ export interface ExpansionStats {
  * console.log(`Found ${result.paths.length} paths`);
  * console.log(`Sampled ${result.sampledNodes.size} nodes`);
  * ```
+ *
+ * @see BidirectionalBFS - Parameterised version for N=2 with resource constraints
  */
 export declare class DegreePrioritisedExpansion<T> {
     private readonly expander;
@@ -77,6 +101,12 @@ export declare class DegreePrioritisedExpansion<T> {
     private readonly paths;
     private readonly sampledEdges;
     private stats;
+    /** Tracks when each node was first discovered (iteration number) */
+    private readonly nodeDiscoveryIteration;
+    /** Track which frontier owns each node for O(1) intersection checking */
+    private readonly nodeToFrontierIndex;
+    /** Track path signatures for O(1) deduplication */
+    private readonly pathSignatures;
     /**
      * Create a new degree-prioritised expansion.
      *
@@ -120,13 +150,15 @@ export declare class DegreePrioritisedExpansion<T> {
      */
     private reconstructPath;
     /**
-     * Check if an equivalent path already exists.
+     * Create a unique signature for a path to enable O(1) deduplication.
+     * Signature is bidirectional (A-B same as B-A) and includes the actual
+     * node sequence to distinguish different paths with the same length.
      * @param fromSeed
      * @param toSeed
      * @param nodes
      * @internal
      */
-    private pathExists;
+    private createPathSignature;
     /**
      * Record degree in distribution histogram.
      * @param degree