@graphty/algorithms 1.0.1 → 1.1.0

package/dist/test/unit/bfs.test.js

@@ -1,277 +0,0 @@
-import { describe, expect, it } from "vitest";
-import { breadthFirstSearch, isBipartite, shortestPathBFS, singleSourceShortestPathBFS } from "../../src/algorithms/traversal/bfs.js";
-import { Graph } from "../../src/core/graph.js";
-describe("BFS Algorithms", () => {
-    describe("breadthFirstSearch", () => {
-        it("should traverse graph in breadth-first order", () => {
-            const graph = new Graph();
-            // Create a simple tree: a -> b, c; b -> d, e
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            graph.addEdge("b", "e");
-            const result = breadthFirstSearch(graph, "a");
-            expect(result.visited.size).toBe(5);
-            expect(result.order).toHaveLength(5);
-            expect(result.order[0]).toBe("a"); // Start node first
-            // Level 1 nodes (b, c) should come before level 2 nodes (d, e)
-            const bIndex = result.order.indexOf("b");
-            const cIndex = result.order.indexOf("c");
-            const dIndex = result.order.indexOf("d");
-            const eIndex = result.order.indexOf("e");
-            expect(Math.max(bIndex, cIndex)).toBeLessThan(Math.min(dIndex, eIndex));
-        });
-        it("should build correct spanning tree", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            const result = breadthFirstSearch(graph, "a");
-            expect(result.tree.get("a")).toBeNull();
-            expect(result.tree.get("b")).toBe("a");
-            expect(result.tree.get("c")).toBe("a");
-            expect(result.tree.get("d")).toBe("b");
-        });
-        it("should handle early termination with target node", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            graph.addEdge("c", "e");
-            const result = breadthFirstSearch(graph, "a", { targetNode: "b" });
-            expect(result.visited.has("b")).toBe(true);
-            expect(result.order).toContain("b");
-            // Should not visit nodes beyond target if target is found early
-            expect(result.order.length).toBeLessThanOrEqual(3);
-        });
-        it("should call visitor callback with correct parameters", () => {
-            const graph = new Graph();
-            const visits = [];
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            breadthFirstSearch(graph, "a", {
-                visitCallback: (node, level) => {
-                    visits.push({ node: node.toString(), level });
-                },
-            });
-            expect(visits).toHaveLength(3);
-            expect(visits[0]).toEqual({ node: "a", level: 0 });
-            const level1Visits = visits.filter((v) => v.level === 1);
-            expect(level1Visits).toHaveLength(2);
-        });
-        it("should throw error for non-existent start node", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            expect(() => breadthFirstSearch(graph, "nonexistent")).toThrow("Start node nonexistent not found");
-        });
-        it("should handle disconnected components", () => {
-            const graph = new Graph();
-            // Two disconnected components
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            const result = breadthFirstSearch(graph, "a");
-            expect(result.visited.has("a")).toBe(true);
-            expect(result.visited.has("b")).toBe(true);
-            expect(result.visited.has("c")).toBe(false);
-            expect(result.visited.has("d")).toBe(false);
-        });
-        it("should handle single node graph", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const result = breadthFirstSearch(graph, "only");
-            expect(result.visited.size).toBe(1);
-            expect(result.order).toEqual(["only"]);
-            expect(result.tree.get("only")).toBeNull();
-        });
-    });
-    describe("shortestPathBFS", () => {
-        it("should find shortest path in unweighted graph", () => {
-            const graph = new Graph();
-            // Create a diamond graph: a -> b,c -> d
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            graph.addEdge("c", "d");
-            const result = shortestPathBFS(graph, "a", "d");
-            expect(result).not.toBeNull();
-            expect(result.distance).toBe(2);
-            expect(result.path).toHaveLength(3);
-            expect(result.path[0]).toBe("a");
-            expect(result.path[2]).toBe("d");
-            // Middle node should be either b or c
-            expect(["b", "c"]).toContain(result.path[1]);
-        });
-        it("should return null for unreachable target", () => {
-            const graph = new Graph();
-            // Two disconnected nodes
-            graph.addNode("a");
-            graph.addNode("b");
-            const result = shortestPathBFS(graph, "a", "b");
-            expect(result).toBeNull();
-        });
-        it("should handle same source and target", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            const result = shortestPathBFS(graph, "a", "a");
-            expect(result).not.toBeNull();
-            expect(result.distance).toBe(0);
-            expect(result.path).toEqual(["a"]);
-        });
-        it("should throw error for non-existent nodes", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            expect(() => shortestPathBFS(graph, "nonexistent", "a")).toThrow("Source node nonexistent not found");
-            expect(() => shortestPathBFS(graph, "a", "nonexistent")).toThrow("Target node nonexistent not found");
-        });
-        it("should find shortest path in complex graph", () => {
-            const graph = new Graph();
-            // Create a more complex graph
-            graph.addEdge("start", "a");
-            graph.addEdge("start", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "end");
-            graph.addEdge("a", "end"); // Longer path
-            const result = shortestPathBFS(graph, "start", "end");
-            expect(result).not.toBeNull();
-            expect(result.distance).toBe(2); // start -> a -> end
-        });
-    });
-    describe("singleSourceShortestPathBFS", () => {
-        it("should find shortest paths to all reachable nodes", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            graph.addEdge("c", "d");
-            const results = singleSourceShortestPathBFS(graph, "a");
-            expect(results.size).toBe(4);
-            expect(results.get("a").distance).toBe(0);
-            expect(results.get("b").distance).toBe(1);
-            expect(results.get("c").distance).toBe(1);
-            expect(results.get("d").distance).toBe(2);
-        });
-        it("should only include reachable nodes", () => {
-            const graph = new Graph();
-            // Two disconnected components
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            const results = singleSourceShortestPathBFS(graph, "a");
-            expect(results.size).toBe(2);
-            expect(results.has("a")).toBe(true);
-            expect(results.has("b")).toBe(true);
-            expect(results.has("c")).toBe(false);
-            expect(results.has("d")).toBe(false);
-        });
-        it("should provide correct paths for all nodes", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const results = singleSourceShortestPathBFS(graph, "a");
-            expect(results.get("a").path).toEqual(["a"]);
-            expect(results.get("b").path).toEqual(["a", "b"]);
-            expect(results.get("c").path).toEqual(["a", "b", "c"]);
-        });
-    });
-    describe("isBipartite", () => {
-        it("should return true for bipartite graph", () => {
-            const graph = new Graph();
-            // Create a simple bipartite graph
-            graph.addEdge("a1", "b1");
-            graph.addEdge("a1", "b2");
-            graph.addEdge("a2", "b1");
-            graph.addEdge("a2", "b2");
-            expect(isBipartite(graph)).toBe(true);
-        });
-        it("should return false for graph with odd cycle", () => {
-            const graph = new Graph();
-            // Create a triangle (odd cycle)
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            expect(isBipartite(graph)).toBe(false);
-        });
-        it("should return true for graph with even cycle", () => {
-            const graph = new Graph();
-            // Create a square (even cycle)
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "a");
-            expect(isBipartite(graph)).toBe(true);
-        });
-        it("should handle disconnected components", () => {
-            const graph = new Graph();
-            // Two bipartite components
-            graph.addEdge("a1", "b1");
-            graph.addEdge("a1", "b2");
-            graph.addEdge("c1", "d1");
-            graph.addEdge("c1", "d2");
-            expect(isBipartite(graph)).toBe(true);
-        });
-        it("should handle single node", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            expect(isBipartite(graph)).toBe(true);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph();
-            expect(isBipartite(graph)).toBe(true);
-        });
-        it("should throw error for directed graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            expect(() => isBipartite(graph)).toThrow("Bipartite test requires an undirected graph");
-        });
-        it("should detect non-bipartite in complex graph", () => {
-            const graph = new Graph();
-            // Create a graph with both bipartite and non-bipartite parts
-            graph.addEdge("a", "b"); // Bipartite part
-            graph.addEdge("c", "d"); // Another bipartite part
-            graph.addEdge("e", "f"); // Connect to triangle
-            graph.addEdge("f", "g");
-            graph.addEdge("g", "e"); // Triangle makes it non-bipartite
-            expect(isBipartite(graph)).toBe(false);
-        });
-    });
-    describe("edge cases", () => {
-        it("should handle self-loops correctly", () => {
-            const graph = new Graph({ allowSelfLoops: true });
-            graph.addEdge("a", "a");
-            const result = breadthFirstSearch(graph, "a");
-            expect(result.visited.has("a")).toBe(true);
-            expect(result.order).toEqual(["a"]);
-        });
-        it("should handle directed graphs", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "a"); // a can't reach c in directed graph
-            const result = breadthFirstSearch(graph, "a");
-            expect(result.visited.has("a")).toBe(true);
-            expect(result.visited.has("b")).toBe(true);
-            expect(result.visited.has("c")).toBe(false);
-        });
-        it("should work with numeric node IDs", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(2, 3);
-            const result = shortestPathBFS(graph, 1, 3);
-            expect(result).not.toBeNull();
-            expect(result.distance).toBe(2);
-            expect(result.path).toEqual([1, 2, 3]);
-        });
-        it("should handle large graphs efficiently", () => {
-            const graph = new Graph();
-            const nodes = 1000;
-            // Create a path graph: 0 -> 1 -> 2 -> ... -> 999
-            for (let i = 0; i < nodes - 1; i++) {
-                graph.addEdge(i, i + 1);
-            }
-            const result = shortestPathBFS(graph, 0, nodes - 1);
-            expect(result).not.toBeNull();
-            expect(result.distance).toBe(nodes - 1);
-            expect(result.path).toHaveLength(nodes);
-        });
-    });
-});
-//# sourceMappingURL=bfs.test.js.map

package/dist/test/unit/bfs.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bfs.test.js","sourceRoot":"","sources":["../../../test/unit/bfs.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EAAC,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAE,2BAA2B,EAAC,MAAM,uCAAuC,CAAC;AACpI,OAAO,EAAC,KAAK,EAAC,MAAM,yBAAyB,CAAC;AAE9C,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC5B,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,6CAA6C;YAC7C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE9C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAEtD,+DAA+D;YAC/D,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEzC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE9C,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,EAAC,UAAU,EAAE,GAAG,EAAC,CAAC,CAAC;YAEjE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACpC,gEAAgE;YAChE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAoC,EAAE,CAAC;YAEnD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE;gBAC3B,aAAa,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;oBAC3B,MAAM,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAC,CAAC,CAAC;gBAChD,CAAC;aACJ,CAAC,CAAC;YAEH,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;YAEjD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,YAAY,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACtD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,kCAAkC,CAAC,CAAC;QACvG,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,8BAA8B;YAC9B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE9C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAEtB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAEjD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,CAAC,IAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC7B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,wCAAwC;YACxC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAEhD,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClC,sCAAsC;YACtC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,yBAAyB;YACzB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAEhD,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAEhD,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC;YACtG,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,8BAA8B;YAC9B,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC5B,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC5B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,cAAc;YAEzC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAEtD,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB;QAC1D,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACzC,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,OAAO,GAAG,2BAA2B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAExD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,8BAA8B;YAC9B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,OAAO,GAAG,2BAA2B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAExD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,OAAO,GAAG,2BAA2B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAExD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,kCAAkC;YAClC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAE1B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,gCAAgC;YAChC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,+BAA+B;YAC/B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAE1B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAEtB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;QAC5F,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,6DAA6D;YAC7D,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,iBAAiB;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,yBAAyB;YAClD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,sBAAsB;YAC/C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,kCAAkC;YAE3D,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,cAAc,EAAE,IAAI,EAAC,CAAC,CAAC;YAEhD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE9C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,oCAAoC;YAE7D,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE9C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEpB,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAE5C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC;YAEnB,iDAAiD;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;YAED,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAEpD,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/test/unit/closeness.test.d.ts

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

package/dist/test/unit/closeness.test.d.ts.map

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

package/dist/test/unit/closeness.test.js

@@ -1,266 +0,0 @@
-/* eslint-disable dot-notation */
-import { describe, expect, it } from "vitest";
-import { closenessCentrality, nodeClosenessCentrality, nodeWeightedClosenessCentrality, weightedClosenessCentrality, } from "../../src/algorithms/centrality/closeness.js";
-import { Graph } from "../../src/core/graph.js";
-describe("Closeness Centrality", () => {
-    describe("closenessCentrality", () => {
-        it("should calculate closeness centrality for a simple path graph", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = closenessCentrality(graph);
-            // In a path graph A-B-C-D:
-            // A: distances are 1,2,3 -> total 6 -> closeness 1/6
-            // B: distances are 1,1,2 -> total 4 -> closeness 1/4
-            // C: distances are 2,1,1 -> total 4 -> closeness 1/4
-            // D: distances are 3,2,1 -> total 6 -> closeness 1/6
-            expect(centrality["A"]).toBeCloseTo(1 / 6);
-            expect(centrality["B"]).toBeCloseTo(1 / 4);
-            expect(centrality["C"]).toBeCloseTo(1 / 4);
-            expect(centrality["D"]).toBeCloseTo(1 / 6);
-        });
-        it("should handle star graph", () => {
-            const graph = new Graph();
-            graph.addEdge("center", "A");
-            graph.addEdge("center", "B");
-            graph.addEdge("center", "C");
-            graph.addEdge("center", "D");
-            const centrality = closenessCentrality(graph);
-            // Center has distance 1 to all 4 nodes -> closeness 1/4
-            expect(centrality["center"]).toBeCloseTo(1 / 4);
-            // Each peripheral node has distance 1 to center and 2 to others
-            // Total distance: 1 + 2 + 2 + 2 = 7 -> closeness 1/7
-            expect(centrality["A"]).toBeCloseTo(1 / 7);
-        });
-        it("should handle disconnected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("C", "D");
-            const centrality = closenessCentrality(graph);
-            // A can only reach B (distance 1)
-            expect(centrality["A"]).toBe(1);
-            expect(centrality["B"]).toBe(1);
-            expect(centrality["C"]).toBe(1);
-            expect(centrality["D"]).toBe(1);
-        });
-        it("should handle single node", () => {
-            const graph = new Graph();
-            graph.addNode("A");
-            const centrality = closenessCentrality(graph);
-            expect(centrality["A"]).toBe(0);
-        });
-        it("should handle harmonic centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = closenessCentrality(graph, { harmonic: true });
-            // Harmonic centrality sums reciprocals of distances
-            // A: 1/1 + 1/2 + 1/3 = 1.833...
-            expect(centrality["A"]).toBeCloseTo(1 + (1 / 2) + (1 / 3));
-            // B: 1/1 + 1/1 + 1/2 = 2.5
-            expect(centrality["B"]).toBeCloseTo(2.5);
-        });
-        it("should handle normalized centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = closenessCentrality(graph, { normalized: true });
-            // A can reach B (distance 1) and C (distance 2) -> total 3
-            // Normalization: (1/3) * (2/2) = 1/3
-            expect(centrality["A"]).toBeCloseTo(1 / 3);
-            // B can reach both at distance 1 -> total 2
-            // Normalization: (1/2) * (2/2) = 1/2
-            expect(centrality["B"]).toBeCloseTo(1 / 2);
-        });
-        it("should handle cutoff parameter", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = closenessCentrality(graph, { cutoff: 2 });
-            // With cutoff 2, A can reach B (1) and C (2) -> total 3
-            expect(centrality["A"]).toBeCloseTo(1 / 3);
-            // B can reach A (1), C (1), D (2) -> total 4
-            expect(centrality["B"]).toBeCloseTo(1 / 4);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph();
-            const centrality = closenessCentrality(graph);
-            expect(centrality).toEqual({});
-        });
-        it("should handle harmonic centrality with normalization", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = closenessCentrality(graph, {
-                harmonic: true,
-                normalized: true,
-            });
-            // A: harmonic sum = 1/1 + 1/2 = 1.5, normalized by (n-1) = 2
-            expect(centrality["A"]).toBeCloseTo(1.5 / 2);
-            // B: harmonic sum = 1/1 + 1/1 = 2, normalized by (n-1) = 2
-            expect(centrality["B"]).toBeCloseTo(2 / 2);
-        });
-    });
-    describe("nodeClosenessCentrality", () => {
-        it("should calculate centrality for a specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centralityB = nodeClosenessCentrality(graph, "B");
-            expect(centralityB).toBeCloseTo(1 / 2);
-        });
-        it("should throw error for non-existent node", () => {
-            const graph = new Graph();
-            graph.addNode("A");
-            expect(() => {
-                nodeClosenessCentrality(graph, "B");
-            }).toThrow("Node B not found in graph");
-        });
-        it("should handle isolated node", () => {
-            const graph = new Graph();
-            graph.addNode("A");
-            graph.addNode("B");
-            const centrality = nodeClosenessCentrality(graph, "A");
-            expect(centrality).toBe(0);
-        });
-        it("should handle cutoff with harmonic centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = nodeClosenessCentrality(graph, "A", {
-                harmonic: true,
-                cutoff: 2,
-            });
-            // A can reach B (1) and C (2) within cutoff
-            expect(centrality).toBeCloseTo(1 + (1 / 2));
-        });
-    });
-    describe("weightedClosenessCentrality", () => {
-        it("should calculate weighted closeness centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = weightedClosenessCentrality(graph);
-            // Check that function returns results for all nodes
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-            expect(centrality).toHaveProperty("D");
-            expect(Object.keys(centrality)).toHaveLength(4);
-        });
-        it("should handle disconnected weighted graph", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addNode("C");
-            const centrality = weightedClosenessCentrality(graph);
-            // Check all nodes have centrality values
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-            expect(centrality["C"]).toBe(0); // Isolated node should have 0 centrality
-        });
-        it("should handle harmonic weighted centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = weightedClosenessCentrality(graph, { harmonic: true });
-            // Check that harmonic option works
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-            expect(Object.keys(centrality)).toHaveLength(3);
-        });
-        it("should handle normalized weighted centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = weightedClosenessCentrality(graph, { normalized: true });
-            // Check normalized option works
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-        });
-        it("should handle cutoff in weighted graph", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = weightedClosenessCentrality(graph, { cutoff: 5 });
-            // Check cutoff option works
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-            expect(centrality).toHaveProperty("D");
-        });
-        it("should handle empty weighted graph", () => {
-            const graph = new Graph();
-            const centrality = weightedClosenessCentrality(graph);
-            expect(centrality).toEqual({});
-        });
-        it("should handle zero-weight edges", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = weightedClosenessCentrality(graph);
-            // Check zero-weight edges are handled
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-        });
-    });
-    describe("nodeWeightedClosenessCentrality", () => {
-        it("should calculate weighted centrality for specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = nodeWeightedClosenessCentrality(graph, "B");
-            expect(typeof centrality).toBe("number");
-            expect(centrality).toBeGreaterThanOrEqual(0);
-        });
-        it("should throw error for non-existent node", () => {
-            const graph = new Graph();
-            graph.addNode("A");
-            expect(() => {
-                nodeWeightedClosenessCentrality(graph, "B");
-            }).toThrow("Node B not found in graph");
-        });
-        it("should handle node with no reachable neighbors", () => {
-            const graph = new Graph();
-            graph.addNode("A");
-            graph.addNode("B");
-            const centrality = nodeWeightedClosenessCentrality(graph, "A");
-            expect(centrality).toBe(0);
-        });
-        it("should handle harmonic centrality with cutoff", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            const centrality = nodeWeightedClosenessCentrality(graph, "A", {
-                harmonic: true,
-                cutoff: 3,
-            });
-            // Check harmonic with cutoff works
-            expect(typeof centrality).toBe("number");
-            expect(centrality).toBeGreaterThanOrEqual(0);
-        });
-        it("should handle normalized harmonic centrality", () => {
-            const graph = new Graph();
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const centrality = nodeWeightedClosenessCentrality(graph, "A", {
-                harmonic: true,
-                normalized: true,
-            });
-            // Check combined options work
-            expect(typeof centrality).toBe("number");
-            expect(centrality).toBeGreaterThanOrEqual(0);
-        });
-    });
-});
-//# sourceMappingURL=closeness.test.js.map

package/dist/test/unit/closeness.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"closeness.test.js","sourceRoot":"","sources":["../../../test/unit/closeness.test.ts"],"names":[],"mappings":"AAAA,iCAAiC;AACjC,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EACH,mBAAmB,EACnB,uBAAuB,EACvB,+BAA+B,EAC/B,2BAA2B,GAC9B,MAAM,8CAA8C,CAAC;AACtD,OAAO,EAAC,KAAK,EAAC,MAAM,yBAAyB,CAAC;AAE9C,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IAClC,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACrE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,2BAA2B;YAC3B,qDAAqD;YACrD,qDAAqD;YACrD,qDAAqD;YACrD,qDAAqD;YACrD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAE7B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,wDAAwD;YACxD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,gEAAgE;YAChE,qDAAqD;YACrD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACxC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,kCAAkC;YAClC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAEhE,oDAAoD;YACpD,gCAAgC;YAChC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3D,2BAA2B;YAC3B,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;YAElE,2DAA2D;YAC3D,qCAAqC;YACrC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,4CAA4C;YAC5C,qCAAqC;YACrC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,EAAC,MAAM,EAAE,CAAC,EAAC,CAAC,CAAC;YAE3D,wDAAwD;YACxD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,6CAA6C;YAC7C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9C,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE;gBAC1C,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI;aACnB,CAAC,CAAC;YAEH,6DAA6D;YAC7D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAC7C,2DAA2D;YAC3D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACrC,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACvD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,WAAW,GAAG,uBAAuB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxD,MAAM,CAAC,WAAW,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,EAAE;gBACR,uBAAuB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACnC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACvD,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,GAAG,EAAE;gBACnD,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,4CAA4C;YAC5C,MAAM,CAAC,UAAU,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACzC,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACtD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,oDAAoD;YACpD,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,yCAAyC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,yCAAyC;QAC9E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,EAAE,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAExE,mCAAmC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1E,gCAAgC;YAChC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,EAAE,EAAC,MAAM,EAAE,CAAC,EAAC,CAAC,CAAC;YAEnE,4BAA4B;YAC5B,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YACtD,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,sCAAsC;YACtC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC7C,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YAC9D,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,+BAA+B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/D,MAAM,CAAC,OAAO,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,EAAE;gBACR,+BAA+B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC,CAAC,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACtD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,+BAA+B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/D,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,+BAA+B,CAAC,KAAK,EAAE,GAAG,EAAE;gBAC3D,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,mCAAmC;YACnC,MAAM,CAAC,OAAO,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,+BAA+B,CAAC,KAAK,EAAE,GAAG,EAAE;gBAC3D,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI;aACnB,CAAC,CAAC;YAEH,8BAA8B;YAC9B,MAAM,CAAC,OAAO,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

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

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

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

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