@graphty/algorithms 1.0.1 → 1.2.0

package/dist/test/unit/connected-components.test.js

@@ -1,355 +0,0 @@
-import { describe, expect, it } from "vitest";
-import { condensationGraph, connectedComponents, connectedComponentsDFS, getConnectedComponent, isConnected, isStronglyConnected, isWeaklyConnected, largestConnectedComponent, numberOfConnectedComponents, stronglyConnectedComponents, weaklyConnectedComponents, } from "../../src/algorithms/components/connected.js";
-import { Graph } from "../../src/core/graph.js";
-describe("Connected Components", () => {
-    describe("connectedComponents", () => {
-        it("should find single component in connected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "d");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]).toHaveLength(4);
-            expect(components[0]?.sort()).toEqual(["a", "b", "c", "d"]);
-        });
-        it("should find multiple components in disconnected graph", () => {
-            const graph = new Graph();
-            // Two disconnected components
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            graph.addNode("isolated");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(3);
-            const sizes = components.map((comp) => comp.length).sort();
-            expect(sizes).toEqual([1, 2, 2]);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph();
-            const components = connectedComponents(graph);
-            expect(components).toEqual([]);
-        });
-        it("should handle single node", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]).toEqual(["only"]);
-        });
-        it("should throw error for directed graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            expect(() => connectedComponents(graph)).toThrow("Connected components algorithm requires an undirected graph");
-        });
-        it("should handle complex graph", () => {
-            const graph = new Graph();
-            // Component 1: triangle
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            // Component 2: path
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "f");
-            // Component 3: isolated nodes
-            graph.addNode("g");
-            graph.addNode("h");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(4);
-            const sizes = components.map((comp) => comp.length).sort();
-            expect(sizes).toEqual([1, 1, 3, 3]);
-        });
-        it("should work with numeric node IDs", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(3, 4);
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(2);
-            expect(components[0]).toHaveLength(2);
-            expect(components[1]).toHaveLength(2);
-        });
-    });
-    describe("connectedComponentsDFS", () => {
-        it("should produce same results as Union-Find method", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            graph.addNode("isolated");
-            const componentsUF = connectedComponents(graph);
-            const componentsDFS = connectedComponentsDFS(graph);
-            expect(componentsDFS).toHaveLength(componentsUF.length);
-            // Sort for comparison
-            const sortedUF = componentsUF.map((comp) => comp.sort()).sort();
-            const sortedDFS = componentsDFS.map((comp) => comp.sort()).sort();
-            expect(sortedDFS).toEqual(sortedUF);
-        });
-        it("should throw error for directed graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            expect(() => connectedComponentsDFS(graph)).toThrow("Connected components algorithm requires an undirected graph");
-        });
-    });
-    describe("numberOfConnectedComponents", () => {
-        it("should count components correctly", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            graph.addNode("isolated");
-            expect(numberOfConnectedComponents(graph)).toBe(3);
-        });
-        it("should return 0 for empty graph", () => {
-            const graph = new Graph();
-            expect(numberOfConnectedComponents(graph)).toBe(0);
-        });
-    });
-    describe("isConnected", () => {
-        it("should return true for connected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            expect(isConnected(graph)).toBe(true);
-        });
-        it("should return false for disconnected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            expect(isConnected(graph)).toBe(false);
-        });
-        it("should return true for empty graph", () => {
-            const graph = new Graph();
-            expect(isConnected(graph)).toBe(true);
-        });
-        it("should return true for single node", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            expect(isConnected(graph)).toBe(true);
-        });
-    });
-    describe("largestConnectedComponent", () => {
-        it("should find largest component", () => {
-            const graph = new Graph();
-            // Small component
-            graph.addEdge("a", "b");
-            // Large component
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "f");
-            const largest = largestConnectedComponent(graph);
-            expect(largest).toHaveLength(4);
-            expect(largest.sort()).toEqual(["c", "d", "e", "f"]);
-        });
-        it("should return empty array for empty graph", () => {
-            const graph = new Graph();
-            const largest = largestConnectedComponent(graph);
-            expect(largest).toEqual([]);
-        });
-    });
-    describe("getConnectedComponent", () => {
-        it("should get component containing specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("d", "e");
-            const component = getConnectedComponent(graph, "b");
-            expect(component).toHaveLength(3);
-            expect(component.sort()).toEqual(["a", "b", "c"]);
-        });
-        it("should throw error for non-existent node", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            expect(() => getConnectedComponent(graph, "nonexistent")).toThrow("Node nonexistent not found");
-        });
-        it("should throw error for directed graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            expect(() => getConnectedComponent(graph, "a")).toThrow("Connected components algorithm requires an undirected graph");
-        });
-    });
-    describe("stronglyConnectedComponents", () => {
-        it("should find SCCs in directed graph", () => {
-            const graph = new Graph({ directed: true });
-            // Create two SCCs
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a"); // SCC 1: {a, b, c}
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "d"); // SCC 2: {d, e}
-            const components = stronglyConnectedComponents(graph);
-            expect(components).toHaveLength(2);
-            const sizes = components.map((comp) => comp.length).sort();
-            expect(sizes).toEqual([2, 3]);
-        });
-        it("should handle single node components", () => {
-            const graph = new Graph({ directed: true });
-            // Create a DAG (each node is its own SCC)
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            const components = stronglyConnectedComponents(graph);
-            expect(components).toHaveLength(3);
-            expect(components.every((comp) => comp.length === 1)).toBe(true);
-        });
-        it("should handle self-loops", () => {
-            const graph = new Graph({ directed: true, allowSelfLoops: true });
-            graph.addEdge("a", "a");
-            graph.addEdge("a", "b");
-            const components = stronglyConnectedComponents(graph);
-            expect(components).toHaveLength(2);
-            expect(components.some((comp) => comp.includes("a") && comp.length === 1)).toBe(true);
-            expect(components.some((comp) => comp.includes("b") && comp.length === 1)).toBe(true);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            expect(() => stronglyConnectedComponents(graph)).toThrow("Strongly connected components require a directed graph");
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph({ directed: true });
-            const components = stronglyConnectedComponents(graph);
-            expect(components).toEqual([]);
-        });
-        it("should handle complex SCC structure", () => {
-            const graph = new Graph({ directed: true });
-            // Complex graph with multiple SCCs
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "a"); // SCC 1: {a, b}
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "e");
-            graph.addEdge("e", "c"); // SCC 2: {c, d, e}
-            graph.addEdge("b", "c"); // Connection between SCCs
-            graph.addEdge("e", "f"); // f is isolated
-            const components = stronglyConnectedComponents(graph);
-            expect(components).toHaveLength(3);
-            const sizes = components.map((comp) => comp.length).sort();
-            expect(sizes).toEqual([1, 2, 3]);
-        });
-    });
-    describe("isStronglyConnected", () => {
-        it("should return true for strongly connected graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            expect(isStronglyConnected(graph)).toBe(true);
-        });
-        it("should return false for weakly connected graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            expect(isStronglyConnected(graph)).toBe(false);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            expect(() => isStronglyConnected(graph)).toThrow("Strong connectivity check requires a directed graph");
-        });
-    });
-    describe("weaklyConnectedComponents", () => {
-        it("should find weakly connected components", () => {
-            const graph = new Graph({ directed: true });
-            // Two weakly connected components
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            const components = weaklyConnectedComponents(graph);
-            expect(components).toHaveLength(2);
-            expect(components[0]).toHaveLength(2);
-            expect(components[1]).toHaveLength(2);
-        });
-        it("should treat directed edges as undirected", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b"); // b is reachable from both a and c
-            const components = weaklyConnectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]).toHaveLength(3);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            expect(() => weaklyConnectedComponents(graph)).toThrow("Weakly connected components are for directed graphs");
-        });
-    });
-    describe("isWeaklyConnected", () => {
-        it("should return true for weakly connected graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b");
-            expect(isWeaklyConnected(graph)).toBe(true);
-        });
-        it("should return false for disconnected graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            expect(isWeaklyConnected(graph)).toBe(false);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            expect(() => isWeaklyConnected(graph)).toThrow("Weak connectivity check requires a directed graph");
-        });
-    });
-    describe("condensationGraph", () => {
-        it("should create condensation graph", () => {
-            const graph = new Graph({ directed: true });
-            // Two SCCs with connection
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "a"); // SCC 0: {a, b}
-            graph.addEdge("c", "d");
-            graph.addEdge("d", "c"); // SCC 1: {c, d}
-            graph.addEdge("b", "c"); // Edge between SCCs
-            const result = condensationGraph(graph);
-            expect(result.components).toHaveLength(2);
-            expect(result.condensedGraph.nodeCount).toBe(2);
-            expect(result.condensedGraph.totalEdgeCount).toBe(1);
-            // Check component mapping
-            expect(result.componentMap.get("a")).toBeDefined();
-            expect(result.componentMap.get("b")).toBeDefined();
-            expect(result.componentMap.get("c")).toBeDefined();
-            expect(result.componentMap.get("d")).toBeDefined();
-        });
-        it("should handle single SCC", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("b", "c");
-            graph.addEdge("c", "a");
-            const result = condensationGraph(graph);
-            expect(result.components).toHaveLength(1);
-            expect(result.condensedGraph.nodeCount).toBe(1);
-            expect(result.condensedGraph.totalEdgeCount).toBe(0);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            expect(() => condensationGraph(graph)).toThrow("Condensation graph requires a directed graph");
-        });
-    });
-    describe("edge cases", () => {
-        it("should handle graphs with self-loops", () => {
-            const graph = new Graph({ allowSelfLoops: true });
-            graph.addEdge("a", "a");
-            graph.addEdge("a", "b");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]?.sort()).toEqual(["a", "b"]);
-        });
-        it("should handle large graphs efficiently", () => {
-            const graph = new Graph();
-            const nodeCount = 1000;
-            // Create a path graph
-            for (let i = 0; i < nodeCount - 1; i++) {
-                graph.addEdge(i, i + 1);
-            }
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]).toHaveLength(nodeCount);
-        });
-        it("should handle mixed node ID types", () => {
-            const graph = new Graph();
-            graph.addEdge("string", 123);
-            graph.addEdge(123, "another");
-            const components = connectedComponents(graph);
-            expect(components).toHaveLength(1);
-            expect(components[0]).toHaveLength(3);
-        });
-    });
-});
-//# sourceMappingURL=connected-components.test.js.map

package/dist/test/unit/connected-components.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"connected-components.test.js","sourceRoot":"","sources":["../../../test/unit/connected-components.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EACH,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,qBAAqB,EACrB,WAAW,EACX,mBAAmB,EACnB,iBAAiB,EACjB,yBAAyB,EACzB,2BAA2B,EAC3B,2BAA2B,EAC3B,yBAAyB,GAC5B,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,iDAAiD,EAAE,GAAG,EAAE;YACvD,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,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC7D,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;YACxB,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAE1B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAEnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,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,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5C,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,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC;QACpH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACnC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,wBAAwB;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,oBAAoB;YACpB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,8BAA8B;YAC9B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAEnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,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,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACpC,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,UAAU,CAAC,CAAC;YAE1B,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,aAAa,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;YAEpD,MAAM,CAAC,aAAa,CAAC,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAExD,sBAAsB;YACtB,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAChE,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAElE,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACxC,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,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC;QACvH,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACzC,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,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,UAAU,CAAC,CAAC;YAE1B,MAAM,CAAC,2BAA2B,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,MAAM,CAAC,2BAA2B,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,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,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,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,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,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,oCAAoC,EAAE,GAAG,EAAE;YAC1C,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;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,kBAAkB;YAClB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,kBAAkB;YAClB,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,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEjD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,MAAM,OAAO,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEjD,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACnC,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,SAAS,GAAG,qBAAqB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAEpD,MAAM,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACtD,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,qBAAqB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC;QACpG,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,qBAAqB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC;QAC3H,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACzC,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,kBAAkB;YAClB,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,mBAAmB;YAE5C,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;YAEzC,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAEnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,0CAA0C;YAC1C,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,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAC,CAAC,CAAC;YAEhE,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,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtF,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1F,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,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC;QACvH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,mCAAmC;YACnC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YAEzC,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,mBAAmB;YAE5C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,0BAA0B;YACnD,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YAEzC,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;YAEtD,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAEnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACvD,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,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACtD,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,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,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,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qDAAqD,CAAC,CAAC;QAC5G,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,kCAAkC;YAClC,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,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,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,mCAAmC;YAE5D,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;YAEpD,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,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,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qDAAqD,CAAC,CAAC;QAClH,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC/B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,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,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,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,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjD,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,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QACxG,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC/B,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACxC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YAEzC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;YAEzC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,oBAAoB;YAE7C,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAExC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAErD,0BAA0B;YAC1B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,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,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAExC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,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,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC;QACnG,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,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,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC;YAEvB,sBAAsB;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;YAED,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;YAE1B,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAE9B,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAE9C,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/test/unit/degree-centrality.test.d.ts

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

package/dist/test/unit/degree-centrality.test.d.ts.map

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

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

@@ -1,260 +0,0 @@
-/* eslint-disable dot-notation */
-import { describe, expect, it } from "vitest";
-import { degreeCentrality, nodeDegreeCentrality } from "../../src/algorithms/centrality/degree.js";
-import { Graph } from "../../src/core/graph.js";
-describe("Degree Centrality", () => {
-    describe("degreeCentrality", () => {
-        it("should calculate degree centrality for undirected graph", () => {
-            const graph = new Graph();
-            // Create a star graph: center connected to 3 others
-            graph.addEdge("center", "a");
-            graph.addEdge("center", "b");
-            graph.addEdge("center", "c");
-            const centrality = degreeCentrality(graph);
-            expect(centrality["center"]).toBe(3);
-            expect(centrality["a"]).toBe(1);
-            expect(centrality["b"]).toBe(1);
-            expect(centrality["c"]).toBe(1);
-        });
-        it("should calculate normalized degree centrality", () => {
-            const graph = new Graph();
-            // 4 nodes: max possible degree is 3
-            graph.addEdge("center", "a");
-            graph.addEdge("center", "b");
-            graph.addEdge("center", "c");
-            const centrality = degreeCentrality(graph, { normalized: true });
-            expect(centrality["center"]).toBeCloseTo(1.0); // 3/3 = 1.0
-            expect(centrality["a"]).toBeCloseTo(0.333, 2); // 1/3 ≈ 0.333
-            expect(centrality["b"]).toBeCloseTo(0.333, 2);
-            expect(centrality["c"]).toBeCloseTo(0.333, 2);
-        });
-        it("should handle directed graph with total degree mode", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b");
-            graph.addEdge("b", "d");
-            const centrality = degreeCentrality(graph, { mode: "total" });
-            expect(centrality["a"]).toBe(1); // out-degree: 1
-            expect(centrality["b"]).toBe(3); // in-degree: 2, out-degree: 1
-            expect(centrality["c"]).toBe(1); // out-degree: 1
-            expect(centrality["d"]).toBe(1); // in-degree: 1
-        });
-        it("should handle directed graph with in-degree mode", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b");
-            graph.addEdge("b", "d");
-            const centrality = degreeCentrality(graph, { mode: "in" });
-            expect(centrality["a"]).toBe(0);
-            expect(centrality["b"]).toBe(2); // Receives edges from a and c
-            expect(centrality["c"]).toBe(0);
-            expect(centrality["d"]).toBe(1); // Receives edge from b
-        });
-        it("should handle directed graph with out-degree mode", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b");
-            graph.addEdge("b", "d");
-            const centrality = degreeCentrality(graph, { mode: "out" });
-            expect(centrality["a"]).toBe(1); // Sends edge to b
-            expect(centrality["b"]).toBe(1); // Sends edge to d
-            expect(centrality["c"]).toBe(1); // Sends edge to b
-            expect(centrality["d"]).toBe(0);
-        });
-        it("should handle single node graph", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const centrality = degreeCentrality(graph);
-            expect(centrality["only"]).toBe(0);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph();
-            const centrality = degreeCentrality(graph);
-            expect(Object.keys(centrality)).toHaveLength(0);
-        });
-        it("should handle disconnected components", () => {
-            const graph = new Graph();
-            // Two disconnected pairs
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "d");
-            graph.addNode("isolated");
-            const centrality = degreeCentrality(graph);
-            expect(centrality["a"]).toBe(1);
-            expect(centrality["b"]).toBe(1);
-            expect(centrality["c"]).toBe(1);
-            expect(centrality["d"]).toBe(1);
-            expect(centrality["isolated"]).toBe(0);
-        });
-        it("should handle self-loops correctly", () => {
-            const graph = new Graph({ allowSelfLoops: true });
-            graph.addEdge("a", "a"); // Self-loop
-            graph.addEdge("a", "b");
-            const centrality = degreeCentrality(graph);
-            // Self-loop should count as degree 1 in undirected graph
-            expect(centrality["a"]).toBe(2); // Self-loop + edge to b
-            expect(centrality["b"]).toBe(1);
-        });
-        it("should convert node IDs to strings in result", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(2, 3);
-            const centrality = degreeCentrality(graph);
-            expect(centrality["1"]).toBe(1);
-            expect(centrality["2"]).toBe(2);
-            expect(centrality["3"]).toBe(1);
-        });
-        it("should handle normalized centrality with single node", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const centrality = degreeCentrality(graph, { normalized: true });
-            expect(centrality["only"]).toBe(0); // 0/0 should be handled gracefully
-        });
-        it("should handle normalized centrality with two nodes", () => {
-            const graph = new Graph();
-            graph.addEdge("a", "b");
-            const centrality = degreeCentrality(graph, { normalized: true });
-            expect(centrality["a"]).toBe(1); // 1/1 = 1.0
-            expect(centrality["b"]).toBe(1); // 1/1 = 1.0
-        });
-    });
-    describe("nodeDegreeCentrality", () => {
-        it("should calculate centrality for specific node", () => {
-            const graph = new Graph();
-            graph.addEdge("center", "a");
-            graph.addEdge("center", "b");
-            graph.addEdge("a", "b");
-            const centralityA = nodeDegreeCentrality(graph, "a");
-            const centralityCenter = nodeDegreeCentrality(graph, "center");
-            expect(centralityA).toBe(2);
-            expect(centralityCenter).toBe(2);
-        });
-        it("should calculate normalized centrality for specific node", () => {
-            const graph = new Graph();
-            // 3 nodes: max possible degree is 2
-            graph.addEdge("a", "b");
-            graph.addEdge("a", "c");
-            const centrality = nodeDegreeCentrality(graph, "a", { normalized: true });
-            expect(centrality).toBe(1.0); // 2/2 = 1.0
-        });
-        it("should handle directed graph modes for specific node", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "b");
-            graph.addEdge("b", "d");
-            expect(nodeDegreeCentrality(graph, "b", { mode: "in" })).toBe(2);
-            expect(nodeDegreeCentrality(graph, "b", { mode: "out" })).toBe(1);
-            expect(nodeDegreeCentrality(graph, "b", { mode: "total" })).toBe(3);
-        });
-        it("should throw error for non-existent node", () => {
-            const graph = new Graph();
-            graph.addNode("a");
-            expect(() => nodeDegreeCentrality(graph, "nonexistent")).toThrow("Node nonexistent not found");
-        });
-        it("should handle numeric node ID", () => {
-            const graph = new Graph();
-            graph.addEdge(1, 2);
-            graph.addEdge(1, 3);
-            const centrality = nodeDegreeCentrality(graph, 1);
-            expect(centrality).toBe(2);
-        });
-        it("should handle normalized centrality for single node graph", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const centrality = nodeDegreeCentrality(graph, "only", { normalized: true });
-            expect(centrality).toBe(0);
-        });
-        it("should handle self-loops for specific node", () => {
-            const graph = new Graph({ allowSelfLoops: true, directed: true });
-            graph.addEdge("a", "a"); // Self-loop
-            graph.addEdge("a", "b");
-            graph.addEdge("c", "a");
-            expect(nodeDegreeCentrality(graph, "a", { mode: "in" })).toBe(2); // Self-loop + from c
-            expect(nodeDegreeCentrality(graph, "a", { mode: "out" })).toBe(2); // Self-loop + to b
-            expect(nodeDegreeCentrality(graph, "a", { mode: "total" })).toBe(4);
-        });
-    });
-    describe("edge cases", () => {
-        it("should handle graph with only self-loops", () => {
-            const graph = new Graph({ allowSelfLoops: true });
-            graph.addEdge("a", "a");
-            graph.addEdge("b", "b");
-            const centrality = degreeCentrality(graph);
-            expect(centrality["a"]).toBe(1);
-            expect(centrality["b"]).toBe(1);
-        });
-        it("should handle complete graph", () => {
-            const graph = new Graph();
-            // Complete graph with 4 nodes
-            const nodes = ["a", "b", "c", "d"];
-            for (let i = 0; i < nodes.length; i++) {
-                for (let j = i + 1; j < nodes.length; j++) {
-                    const nodeI = nodes[i];
-                    const nodeJ = nodes[j];
-                    if (nodeI && nodeJ) {
-                        graph.addEdge(nodeI, nodeJ);
-                    }
-                }
-            }
-            const centrality = degreeCentrality(graph, { normalized: true });
-            // Each node connected to all others
-            for (const node of nodes) {
-                expect(centrality[node]).toBe(1.0);
-            }
-        });
-        it("should handle large graphs efficiently", () => {
-            const graph = new Graph();
-            const nodeCount = 1000;
-            // Create a star graph
-            for (let i = 1; i < nodeCount; i++) {
-                graph.addEdge(0, i);
-            }
-            const centrality = degreeCentrality(graph);
-            expect(centrality["0"]).toBe(nodeCount - 1);
-            for (let i = 1; i < nodeCount; i++) {
-                expect(centrality[i.toString()]).toBe(1);
-            }
-        });
-        it("should handle mixed node ID types", () => {
-            const graph = new Graph();
-            graph.addEdge("string", 123);
-            graph.addEdge(123, "another");
-            const centrality = degreeCentrality(graph);
-            expect(centrality["string"]).toBe(1);
-            expect(centrality["123"]).toBe(2);
-            expect(centrality["another"]).toBe(1);
-        });
-        it("should handle normalized centrality edge case with division by zero", () => {
-            const graph = new Graph();
-            graph.addNode("only");
-            const centrality = degreeCentrality(graph, { normalized: true });
-            // Should handle division by zero gracefully
-            expect(centrality["only"]).toBe(0);
-        });
-        it("should maintain consistency between undirected and directed default behavior", () => {
-            const undirectedGraph = new Graph({ directed: false });
-            const directedGraph = new Graph({ directed: true });
-            // Same edges added to both
-            undirectedGraph.addEdge("a", "b");
-            directedGraph.addEdge("a", "b");
-            const undirectedCentrality = degreeCentrality(undirectedGraph);
-            const directedCentrality = degreeCentrality(directedGraph);
-            // In undirected graph, both nodes have degree 1
-            expect(undirectedCentrality["a"]).toBe(1);
-            expect(undirectedCentrality["b"]).toBe(1);
-            // In directed graph, total degree by default
-            expect(directedCentrality["a"]).toBe(1); // out-degree: 1
-            expect(directedCentrality["b"]).toBe(1); // in-degree: 1
-        });
-        it("should handle very high degree nodes", () => {
-            const graph = new Graph();
-            // Create a node with very high degree
-            const centerNode = "center";
-            for (let i = 0; i < 10000; i++) {
-                graph.addEdge(centerNode, `node_${i}`);
-            }
-            const centrality = nodeDegreeCentrality(graph, centerNode);
-            expect(centrality).toBe(10000);
-        });
-    });
-});
-//# sourceMappingURL=degree-centrality.test.js.map