graphbox 1.2.1 → 1.2.2

package/dist/__tests__/integration/bipartite.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Integration tests for Bipartite graph class
+ *
+ * Bipartite: vertices can be partitioned into two disjoint sets
+ * such that every edge connects a vertex in one set to one in the other.
+ * Equivalent: graph contains no odd-length cycles.
+ */
+export {};
+//# sourceMappingURL=bipartite.integration.test.d.ts.map

package/dist/__tests__/integration/bipartite.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bipartite.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/bipartite.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/__tests__/integration/chordal.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Integration tests for Chordal graph class
+ *
+ * Chordal: every cycle of length >= 4 has a chord (edge between non-adjacent vertices).
+ * Equivalent: has a perfect elimination ordering.
+ * Examples: trees, complete graphs, interval graphs.
+ */
+export {};
+//# sourceMappingURL=chordal.integration.test.d.ts.map

package/dist/__tests__/integration/chordal.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chordal.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/chordal.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/__tests__/integration/cograph.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Cograph graph class
+ *
+ * Cograph: P4-free graph (contains no induced path on 4 vertices).
+ * Can be constructed recursively using disjoint union and complement operations.
+ */
+export {};
+//# sourceMappingURL=cograph.integration.test.d.ts.map

package/dist/__tests__/integration/cograph.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cograph.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/cograph.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/comparability.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Comparability graph class
+ *
+ * Comparability: edges can be transitively oriented (partial order).
+ * Equivalent: intersection graph of a family of sets ordered by inclusion.
+ */
+export {};
+//# sourceMappingURL=comparability.integration.test.d.ts.map

package/dist/__tests__/integration/comparability.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comparability.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/comparability.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/eulerian.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Integration tests for Eulerian graph class
+ *
+ * Eulerian: has a circuit that visits every edge exactly once.
+ * Equivalent: connected graph where all vertices have even degree.
+ * Semi-Eulerian: has a trail (not circuit) visiting every edge exactly once.
+ */
+export {};
+//# sourceMappingURL=eulerian.integration.test.d.ts.map

package/dist/__tests__/integration/eulerian.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eulerian.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/eulerian.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/__tests__/integration/hamiltonian.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Hamiltonian graph class
+ *
+ * Hamiltonian: has a cycle that visits every vertex exactly once.
+ * Determining Hamiltonicity is NP-complete.
+ */
+export {};
+//# sourceMappingURL=hamiltonian.integration.test.d.ts.map

package/dist/__tests__/integration/hamiltonian.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hamiltonian.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/hamiltonian.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/helpers.d.ts

@@ -0,0 +1,8 @@
+import { AnalyzerGraph } from '../../analyzer/types';
+import { TestGraph } from '../../generation/generator';
+/**
+ * Convert a TestGraph to an AnalyzerGraph for classification.
+ * @param testGraph
+ */
+export declare const toAnalyzerGraph: (testGraph: TestGraph) => AnalyzerGraph;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/__tests__/integration/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAgB,aAAa,EAAkB,MAAM,sBAAsB,CAAC;AACxF,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAE5D;;;GAGG;AACH,eAAO,MAAM,eAAe,GAAI,WAAW,SAAS,KAAG,aAiBtD,CAAC"}

package/dist/__tests__/integration/interval.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Interval graph class
+ *
+ * Interval: can be represented as intersection graph of intervals on the real line.
+ * Interval graphs are chordal.
+ */
+export {};
+//# sourceMappingURL=interval.integration.test.d.ts.map

package/dist/__tests__/integration/interval.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interval.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/interval.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/perfect.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Perfect graph class
+ *
+ * Perfect: ω(H) = χ(H) for all induced subgraphs H (clique number = chromatic number).
+ * Examples: chordal, bipartite, cograph.
+ */
+export {};
+//# sourceMappingURL=perfect.integration.test.d.ts.map

package/dist/__tests__/integration/perfect.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"perfect.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/perfect.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/permutation.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Permutation graph class
+ *
+ * Permutation: intersection graph of line segments between two parallel lines.
+ * Permutation graphs are comparability graphs and co-comparability graphs.
+ */
+export {};
+//# sourceMappingURL=permutation.integration.test.d.ts.map

package/dist/__tests__/integration/permutation.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutation.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/permutation.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/planar.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Planar graph class
+ *
+ * Planar: can be drawn in the plane without edge crossings.
+ * Equivalent: does not contain K5 or K3,3 as a minor (Kuratowski's theorem).
+ */
+export {};
+//# sourceMappingURL=planar.integration.test.d.ts.map

package/dist/__tests__/integration/planar.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planar.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/planar.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/regular.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Regular graph class
+ *
+ * Regular: all vertices have the same degree k.
+ * Special cases: cubic (3-regular), cycle (2-regular).
+ */
+export {};
+//# sourceMappingURL=regular.integration.test.d.ts.map

package/dist/__tests__/integration/regular.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regular.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/regular.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/split.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Split graph class
+ *
+ * Split: vertices can be partitioned into a clique K and an independent set I.
+ * Split graphs are chordal.
+ */
+export {};
+//# sourceMappingURL=split.integration.test.d.ts.map

package/dist/__tests__/integration/split.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/split.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/__tests__/integration/tree.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Integration tests for Tree graph class
+ *
+ * Tree: undirected, acyclic, connected graph
+ * Properties: |E| = |V| - 1, unique path between any two vertices
+ */
+export {};
+//# sourceMappingURL=tree.integration.test.d.ts.map

package/dist/__tests__/integration/tree.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.integration.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/tree.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/algorithms/analysis/connected-components.unit.test.d.ts

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

package/dist/algorithms/analysis/connected-components.unit.test.d.ts.map

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

package/dist/algorithms/analysis/cycle-detection.unit.test.d.ts

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

package/dist/algorithms/analysis/cycle-detection.unit.test.d.ts.map

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

package/dist/algorithms/analysis/scc.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for strongly connected components (Tarjan's algorithm)
+ */
+export {};
+//# sourceMappingURL=scc.unit.test.d.ts.map

package/dist/algorithms/analysis/scc.unit.test.d.ts.map

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

package/dist/algorithms/analysis/topological-sort.unit.test.d.ts

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

package/dist/algorithms/analysis/topological-sort.unit.test.d.ts.map

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

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

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

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

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

package/dist/algorithms/clustering/label-propagation.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for Label Propagation clustering algorithm
+ */
+export {};
+//# sourceMappingURL=label-propagation.unit.test.d.ts.map

package/dist/algorithms/clustering/label-propagation.unit.test.d.ts.map

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

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

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

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

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

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

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

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

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

package/dist/algorithms/decomposition/biconnected.unit.test.d.ts

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

package/dist/algorithms/decomposition/biconnected.unit.test.d.ts.map

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

package/dist/algorithms/decomposition/core-periphery.unit.test.d.ts

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

package/dist/algorithms/decomposition/core-periphery.unit.test.d.ts.map

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

package/dist/algorithms/decomposition/k-core.unit.test.d.ts

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

package/dist/algorithms/decomposition/k-core.unit.test.d.ts.map

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

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/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.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/traversal/degree-prioritised-expansion.unit.test.d.ts

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

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

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

package/dist/algorithms/utils/csr.unit.test.d.ts

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

package/dist/algorithms/utils/csr.unit.test.d.ts.map

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

package/dist/algorithms/utils/type-guards.unit.test.d.ts

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

package/dist/algorithms/utils/type-guards.unit.test.d.ts.map

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

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

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

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

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

package/dist/analyzer/advanced-props.unit.test.d.ts

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

package/dist/analyzer/advanced-props.unit.test.d.ts.map

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

package/dist/analyzer/advanced-structures.unit.test.d.ts

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

package/dist/analyzer/advanced-structures.unit.test.d.ts.map

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

package/dist/analyzer/connectivity.unit.test.d.ts

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

package/dist/analyzer/connectivity.unit.test.d.ts.map

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

package/dist/analyzer/core-props.unit.test.d.ts

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

package/dist/analyzer/core-props.unit.test.d.ts.map

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

package/dist/analyzer/helpers.unit.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Unit tests for helpers.ts
+ *
+ * Note: helpers.ts is currently empty (contains only comments).
+ * This test file is a placeholder that documents this and provides
+ * a structure for future tests if functions are added to helpers.ts.
+ */
+export {};
+//# sourceMappingURL=helpers.unit.test.d.ts.map

package/dist/analyzer/helpers.unit.test.d.ts.map

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