@graphty/algorithms 1.0.1 → 1.2.0

package/dist/test/unit/betweenness-centrality.test.js

@@ -1,311 +0,0 @@
-/* eslint-disable dot-notation */
-import { describe, expect, it } from "vitest";
-import { betweennessCentrality, edgeBetweennessCentrality, nodeBetweennessCentrality } from "../../src/algorithms/centrality/betweenness.js";
-import { Graph } from "../../src/core/graph.js";
-describe("Betweenness Centrality", () => {
-    describe("betweennessCentrality", () => {
-        it("should calculate betweenness centrality for simple path graph", () => {
-            const graph = new Graph();
-            // Create a path: a - b - c - d
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "d");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["a"]).toBe(0); // Endpoint
-            expect(centrality["b"]).toBe(2); // paths: a↔c, a↔d pass through b
-            expect(centrality["c"]).toBe(2); // paths: a↔d, b↔d pass through c
-            expect(centrality["d"]).toBe(0); // Endpoint
-        });
-        it("should calculate betweenness centrality for star graph", () => {
-            const graph = new Graph();
-            // Create a star: center connected to a, b, c
-            graph.addEdge("center", "a");
-            graph.addEdge("center", "b");
-            graph.addEdge("center", "c");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["center"]).toBe(3); // All paths between periphery nodes go through center
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0);
-            expect(centrality["c"]).toBe(0);
-        });
-        it("should calculate normalized betweenness centrality", () => {
-            const graph = new Graph();
-            // Create a path: a - b - c
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = betweennessCentrality(graph, { normalized: true });
-            // For 3 nodes in undirected graph: normalization factor = (3-1)*(3-2)/2 = 1
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(1); // 1 path / 1 = 1
-            expect(centrality["c"]).toBe(0);
-        });
-        it("should handle directed graphs", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("a", "c");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0); // Direct path a->c exists
-            expect(centrality["c"]).toBe(0);
-        });
-        it("should handle single node graph", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["only"]).toBe(0);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph();
-            const centrality = betweennessCentrality(graph);
-            expect(Object.keys(centrality)).toHaveLength(0);
-        });
-        it("should handle disconnected components", () => {
-            const graph = new Graph();
-            // Two disconnected edges
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0);
-            expect(centrality["c"]).toBe(0);
-            expect(centrality["d"]).toBe(0);
-        });
-        it("should handle triangle graph", () => {
-            const graph = new Graph();
-            // Create a triangle
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            const centrality = betweennessCentrality(graph);
-            // In a triangle, all nodes have equal betweenness (all are equally central)
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0);
-            expect(centrality["c"]).toBe(0);
-        });
-        it("should handle bridge node correctly", () => {
-            const graph = new Graph();
-            // Create two triangles connected by a bridge
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            graph.addEdge("c", "d"); // Bridge
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "f");
-            graph.addEdge("f", "d");
-            const centrality = betweennessCentrality(graph);
-            // c and d should have high betweenness as they bridge the two components
-            expect(centrality["c"]).toBeGreaterThan(centrality["a"] ?? 0);
-            expect(centrality["d"]).toBeGreaterThan(centrality["e"] ?? 0);
-        });
-        it("should convert node IDs to strings in result", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(2, 3);
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["1"]).toBe(0);
-            expect(centrality["2"]).toBe(1);
-            expect(centrality["3"]).toBe(0);
-        });
-    });
-    describe("nodeBetweennessCentrality", () => {
-        it("should calculate centrality for specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "d");
-            const centralityB = nodeBetweennessCentrality(graph, "b");
-            const centralityA = nodeBetweennessCentrality(graph, "a");
-            expect(centralityB).toBe(2);
-            expect(centralityA).toBe(0);
-        });
-        it("should handle normalized centrality for specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = nodeBetweennessCentrality(graph, "b", { normalized: true });
-            expect(centrality).toBe(1);
-        });
-        it("should throw error for non-existent node", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            expect(() => nodeBetweennessCentrality(graph, "nonexistent")).toThrow("Node nonexistent not found");
-        });
-        it("should handle numeric node ID", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(2, 3);
-            const centrality = nodeBetweennessCentrality(graph, 2);
-            expect(centrality).toBe(1);
-        });
-    });
-    describe("edgeBetweennessCentrality", () => {
-        it("should calculate edge betweenness centrality", () => {
-            const graph = new Graph();
-            // Create a path: a - b - c
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = edgeBetweennessCentrality(graph);
-            expect(centrality.get("a-b")).toBe(1);
-            expect(centrality.get("b-c")).toBe(1);
-        });
-        it("should calculate edge betweenness for star graph", () => {
-            const graph = new Graph();
-            // Create a star
-            graph.addEdge("center", "a");
-            graph.addEdge("center", "b");
-            graph.addEdge("center", "c");
-            const centrality = edgeBetweennessCentrality(graph);
-            // Each edge from center carries equal betweenness
-            expect(centrality.get("center-a")).toBe(1.5);
-            expect(centrality.get("center-b")).toBe(1.5);
-            expect(centrality.get("center-c")).toBe(1.5);
-        });
-        it("should handle normalized edge betweenness", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = edgeBetweennessCentrality(graph, { normalized: true });
-            expect(centrality.get("a-b")).toBe(1);
-            expect(centrality.get("b-c")).toBe(1);
-        });
-        it("should handle directed graphs for edge betweenness", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = edgeBetweennessCentrality(graph);
-            expect(centrality.get("a-b")).toBe(2);
-            expect(centrality.get("b-c")).toBe(2);
-        });
-        it("should handle bridge edges correctly", () => {
-            const graph = new Graph();
-            // Two components connected by a bridge
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "bridge1");
-            graph.addEdge("bridge1", "bridge2");
-            graph.addEdge("bridge2", "c");
-            graph.addEdge("c", "d");
-            const centrality = edgeBetweennessCentrality(graph);
-            // Bridge edge should have highest betweenness
-            const bridgeEdgeCentrality = centrality.get("bridge1-bridge2");
-            const normalEdgeCentrality = centrality.get("a-b");
-            expect(bridgeEdgeCentrality).toBeGreaterThan(normalEdgeCentrality);
-        });
-    });
-    describe("edge cases", () => {
-        it("should handle self-loops", () => {
-            const graph = new Graph({ allowSelfLoops: true });
-            graph.addEdge("a", "a");
-            graph.addEdge("a", "b");
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0);
-        });
-        it("should handle complex network", () => {
-            const graph = new Graph();
-            // Create a more complex network
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            graph.addEdge("b", "d");
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "f");
-            graph.addEdge("e", "g");
-            const centrality = betweennessCentrality(graph);
-            // Node e should have high betweenness as it connects to multiple end branches
-            expect(centrality["e"]).toBeGreaterThan(centrality["a"] ?? 0);
-            expect(centrality["e"]).toBeGreaterThan(centrality["f"] ?? 0);
-        });
-        it("should handle large star graph efficiently", () => {
-            const graph = new Graph();
-            const nodeCount = 100;
-            // Create a large star
-            for (let i = 1; i < nodeCount; i++) {
-                graph.addEdge("center", `node_${i}`);
-            }
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["center"]).toBe((nodeCount - 1) * (nodeCount - 2) / 2);
-            expect(centrality["node_1"]).toBe(0);
-        });
-        it("should handle endpoints option correctly", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centralityWithEndpoints = betweennessCentrality(graph, { endpoints: true });
-            const centralityWithoutEndpoints = betweennessCentrality(graph, { endpoints: false });
-            // Without endpoints, values should be different (typically smaller)
-            expect(centralityWithEndpoints["b"]).toBeGreaterThanOrEqual(centralityWithoutEndpoints["b"] ?? 0);
-        });
-        it("should handle weighted graphs", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b", 1);
-            graph.addEdge("b", "c", 1);
-            graph.addEdge("c", "d", 1);
-            graph.addEdge("a", "d", 10);
-            const centrality = betweennessCentrality(graph);
-            // In this graph structure, b and c are on the shortest path
-            expect(centrality["b"]).toBeGreaterThan(0);
-            expect(centrality["c"]).toBeGreaterThan(0);
-        });
-        it("should handle null weights gracefully", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const centrality = betweennessCentrality(graph);
-            // Basic betweenness should work
-            expect(centrality["b"]).toBeGreaterThan(0);
-        });
-        it("should handle zero shortest paths", () => {
-            const graph = new Graph({ directed: true });
-            // Create a directed graph where some nodes are unreachable
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            // No path from a,b to c,d
-            const centrality = betweennessCentrality(graph);
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(0);
-            expect(centrality["c"]).toBe(0);
-            expect(centrality["d"]).toBe(0);
-        });
-        it("should handle weighted edge betweenness", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b", 1);
-            graph.addEdge("b", "c", 1);
-            graph.addEdge("a", "c", 3);
-            const edgeCentrality = edgeBetweennessCentrality(graph);
-            // Edge a-b and b-c should be used in shortest paths
-            expect(edgeCentrality.get("a-b")).toBeGreaterThan(0);
-            expect(edgeCentrality.get("b-c")).toBeGreaterThan(0);
-        });
-        it("should handle parallel edges correctly", () => {
-            const graph = new Graph({ allowParallelEdges: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "b"); // Parallel edge
-            graph.addEdge("b", "c");
-            const centrality = betweennessCentrality(graph);
-            // Should still calculate correctly despite parallel edges
-            expect(centrality["b"]).toBeGreaterThan(0);
-        });
-        it("should handle directed graph with cycles", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a"); // Creates cycle
-            graph.addEdge("c", "d");
-            const centrality = betweennessCentrality(graph);
-            // c should have high betweenness as it's on paths to d
-            expect(centrality["c"]).toBeGreaterThan(0);
-        });
-        it("should handle weighted centrality with endpoints", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b", 1);
-            graph.addEdge("b", "c", 2);
-            const centrality = betweennessCentrality(graph, {
-                endpoints: true,
-                normalized: true,
-            });
-            expect(centrality["b"]).toBeGreaterThan(0);
-        });
-    });
-});
-//# sourceMappingURL=betweenness-centrality.test.js.map

package/dist/test/unit/betweenness-centrality.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"betweenness-centrality.test.js","sourceRoot":"","sources":["../../../test/unit/betweenness-centrality.test.ts"],"names":[],"mappings":"AAAA,iCAAiC;AACjC,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EAAC,qBAAqB,EAAE,yBAAyB,EAAE,yBAAyB,EAAC,MAAM,gDAAgD,CAAC;AAC3I,OAAO,EAAC,KAAK,EAAC,MAAM,yBAAyB,CAAC;AAE9C,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACpC,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACrE,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;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;YAC5C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;YAClE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;YAClE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YAC9D,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,6CAA6C;YAC7C,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,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,sDAAsD;YAC5F,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,oDAAoD,EAAE,GAAG,EAAE;YAC1D,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;YAEpE,4EAA4E;YAC5E,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,CAAC,iBAAiB;YAClD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,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;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,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,CAAC,0BAA0B;YAC3D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,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,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,yBAAyB;YACzB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,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,8BAA8B,EAAE,GAAG,EAAE;YACpC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,oBAAoB;YACpB,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,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,4EAA4E;YAC5E,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,qCAAqC,EAAE,GAAG,EAAE;YAC3C,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,CAAC,SAAS;YAClC,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,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,yEAAyE;YACzE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,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,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,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;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,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,WAAW,GAAG,yBAAyB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAG,yBAAyB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE1D,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC7D,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,UAAU,GAAG,yBAAyB,CAAC,KAAK,EAAE,GAAG,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;YAE7E,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,GAAG,EAAE,CAAC,yBAAyB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC;QACxG,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,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,UAAU,GAAG,yBAAyB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAEvD,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEpD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,gBAAgB;YAChB,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,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEpD,kDAAkD;YAClD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,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,UAAU,GAAG,yBAAyB,CAAC,KAAK,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;YAExE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC1D,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;YAExB,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEpD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,uCAAuC;YACvC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAC9B,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACpC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC9B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEpD,8CAA8C;YAC9C,MAAM,oBAAoB,GAAG,UAAU,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;YAC/D,MAAM,oBAAoB,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEnD,MAAM,CAAC,oBAAoB,CAAC,CAAC,eAAe,CAAC,oBAAqB,CAAC,CAAC;QACxE,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,cAAc,EAAE,IAAI,EAAC,CAAC,CAAC;YAEhD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,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,+BAA+B,EAAE,GAAG,EAAE;YACrC,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;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;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,8EAA8E;YAC9E,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,GAAG,CAAC;YAEtB,sBAAsB;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzC,CAAC;YAED,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzE,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,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,uBAAuB,GAAG,qBAAqB,CAAC,KAAK,EAAE,EAAC,SAAS,EAAE,IAAI,EAAC,CAAC,CAAC;YAChF,MAAM,0BAA0B,GAAG,qBAAqB,CAAC,KAAK,EAAE,EAAC,SAAS,EAAE,KAAK,EAAC,CAAC,CAAC;YAEpF,oEAAoE;YACpE,MAAM,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC,CAAC,sBAAsB,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtG,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YAE5B,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,4DAA4D;YAC5D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,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,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,gCAAgC;YAChC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,2DAA2D;YAC3D,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,0BAA0B;YAE1B,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,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,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAE3B,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAExD,oDAAoD;YACpD,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACrD,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,kBAAkB,EAAE,IAAI,EAAC,CAAC,CAAC;YAEpD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YACzC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,0DAA0D;YAC1D,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,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;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YACzC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAEhD,uDAAuD;YACvD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/C,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,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAE3B,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,EAAE;gBAC5C,SAAS,EAAE,IAAI;gBACf,UAAU,EAAE,IAAI;aACnB,CAAC,CAAC;YAEH,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

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

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

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

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

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