@graphty/algorithms 1.2.0 → 1.4.2

package/dist/src/benchmark-all-algorithms.js

@@ -0,0 +1,491 @@
+/* eslint-disable no-console */
+/**
+ * Comprehensive benchmark suite for ALL 98 algorithms in @graphty/algorithms
+ *
+ * Two modes:
+ * - Full benchmark: Completes in under 1 hour
+ * - Quick benchmark: Completes in under 2 minutes
+ */
+import * as algorithms from "./algorithms/index.js";
+import { Graph } from "./core/graph.js";
+const ALGORITHM_CATEGORIES = {
+    traversal: {
+        algorithms: [
+            "breadthFirstSearch",
+            "isBipartite",
+            "shortestPathBFS",
+            "singleSourceShortestPathBFS",
+            "depthFirstSearch",
+            "findStronglyConnectedComponents",
+            "hasCycleDFS",
+            "topologicalSort",
+        ],
+        config: {
+            name: "Traversal",
+            quick: { nodes: 1000, edges: 5000, runs: 3 },
+            full: { nodes: 10000, edges: 50000, runs: 10 },
+        },
+    },
+    shortestPath: {
+        algorithms: [
+            "bellmanFord",
+            "bellmanFordPath",
+            "hasNegativeCycle",
+            "allPairsShortestPath",
+            "dijkstra",
+            "dijkstraPath",
+            "singleSourceShortestPath",
+            "floydWarshall",
+            "floydWarshallPath",
+            "transitiveClosure",
+        ],
+        config: {
+            name: "Shortest Path",
+            quick: { nodes: 100, edges: 500, runs: 1 }, // Smaller for O(V³) algorithms
+            full: { nodes: 500, edges: 2500, runs: 3 },
+        },
+    },
+    centrality: {
+        algorithms: [
+            "betweennessCentrality",
+            "closenessCentrality",
+            "degreeCentrality",
+            "eigenvectorCentrality",
+            "hits",
+            "katzCentrality",
+            "pageRank",
+            "personalizedPageRank",
+        ],
+        config: {
+            name: "Centrality",
+            quick: { nodes: 500, edges: 2500, runs: 1 },
+            full: { nodes: 2000, edges: 10000, runs: 3 },
+        },
+    },
+    components: {
+        algorithms: [
+            "connectedComponents",
+            "connectedComponentsDFS",
+            "stronglyConnectedComponents",
+            "weaklyConnectedComponents",
+            "isConnected",
+            "isStronglyConnected",
+            "isWeaklyConnected",
+            "numberOfConnectedComponents",
+            "largestConnectedComponent",
+            "getConnectedComponent",
+        ],
+        config: {
+            name: "Components",
+            quick: { nodes: 2000, edges: 10000, runs: 3 },
+            full: { nodes: 10000, edges: 50000, runs: 10 },
+        },
+    },
+    mst: {
+        algorithms: ["kruskalMST", "primMST", "minimumSpanningTree"],
+        config: {
+            name: "Minimum Spanning Tree",
+            quick: { nodes: 1000, edges: 5000, runs: 5 },
+            full: { nodes: 5000, edges: 25000, runs: 10 },
+        },
+    },
+    community: {
+        algorithms: ["girvanNewman", "labelPropagation", "leiden", "louvain"],
+        config: {
+            name: "Community Detection",
+            quick: { nodes: 200, edges: 1000, runs: 1 }, // Very expensive algorithms
+            full: { nodes: 1000, edges: 5000, runs: 2 },
+        },
+    },
+    matching: {
+        algorithms: ["bipartitePartition", "greedyBipartiteMatching", "maximumBipartiteMatching"],
+        config: {
+            name: "Matching",
+            quick: { nodes: 500, edges: 1000, runs: 3 },
+            full: { nodes: 2000, edges: 4000, runs: 5 },
+        },
+    },
+};
+/**
+ * Main benchmark runner
+ * @param mode - The benchmark mode: "quick" for fast tests or "full" for comprehensive tests
+ * @returns Array of benchmark results for all tested algorithms
+ */
+export function runAllAlgorithmsBenchmark(mode = "full") {
+    const startTime = Date.now();
+    const timeLimit = mode === "quick" ? 2 * 60 * 1000 : 60 * 60 * 1000; // 2 min or 1 hour
+    console.log(`🚀 ${mode === "quick" ? "Quick" : "Comprehensive"} Benchmark - All ${String(getTotalAlgorithmCount())} Algorithms`);
+    console.log(`=${"=".repeat(60)}`);
+    console.log(`Time limit: ${mode === "quick" ? "2 minutes" : "1 hour"}`);
+    console.log(`Start time: ${new Date().toLocaleTimeString()}\n`);
+    const results = [];
+    let totalTested = 0;
+    let totalPassed = 0;
+    for (const [categoryKey, categoryData] of Object.entries(ALGORITHM_CATEGORIES)) {
+        const elapsed = Date.now() - startTime;
+        if (elapsed > timeLimit) {
+            console.log("⏰ Time limit reached, stopping benchmark");
+            break;
+        }
+        console.log(`\n📊 ${categoryData.config.name} Algorithms`);
+        console.log("-".repeat(categoryData.config.name.length + 12));
+        const config = categoryData.config[mode];
+        const graph = createTestGraph(config.nodes, config.edges, categoryKey);
+        for (const algoName of categoryData.algorithms) {
+            const elapsed = Date.now() - startTime;
+            if (elapsed > timeLimit) {
+                console.log(`⏰ Time limit reached in category ${categoryData.config.name}`);
+                break;
+            }
+            const result = benchmarkAlgorithm(algoName, categoryData.config.name, graph, config.runs, mode);
+            results.push(result);
+            totalTested++;
+            if (result.success) {
+                totalPassed++;
+                console.log(`  ✅ ${algoName}: ${result.executionTime.toFixed(2)}ms`);
+            }
+            else {
+                console.log(`  ❌ ${algoName}: ${result.error?.substring(0, 50) ?? "Failed"}`);
+            }
+        }
+    }
+    const totalTime = (Date.now() - startTime) / 1000;
+    console.log("\n📈 Benchmark Complete");
+    console.log("===================");
+    console.log(`Total time: ${totalTime.toFixed(1)}s`);
+    console.log(`Algorithms tested: ${String(totalTested)}`);
+    console.log(`Success rate: ${String(totalPassed)}/${String(totalTested)} (${((totalPassed / totalTested) * 100).toFixed(1)}%)`);
+    if (mode === "full") {
+        displayDetailedResults(results);
+    }
+    return results;
+}
+/**
+ * Benchmark a single algorithm
+ * @param algoName - The name of the algorithm to benchmark
+ * @param category - The category the algorithm belongs to
+ * @param graph - The test graph to run the algorithm on
+ * @param runs - Number of times to run the algorithm for averaging
+ * @param mode - The benchmark mode (quick or full)
+ * @returns The benchmark result containing timing and success information
+ */
+function benchmarkAlgorithm(algoName, category, graph, runs, mode) {
+    const algo = algorithms[algoName];
+    if (!algo || typeof algo !== "function") {
+        return {
+            algorithm: algoName,
+            category,
+            executionTime: 0,
+            success: false,
+            error: "Algorithm not found or not a function",
+            nodeCount: graph.nodeCount,
+            edgeCount: graph.uniqueEdgeCount,
+            mode,
+        };
+    }
+    try {
+        const times = [];
+        for (let i = 0; i < runs; i++) {
+            const args = getAlgorithmArgs(algoName, graph);
+            const start = performance.now();
+            algo(...args);
+            const time = performance.now() - start;
+            times.push(time);
+        }
+        // Use median time to avoid outliers
+        times.sort((a, b) => a - b);
+        const medianTime = times[Math.floor(times.length / 2)] ?? 0;
+        return {
+            algorithm: algoName,
+            category,
+            executionTime: medianTime,
+            success: true,
+            nodeCount: graph.nodeCount,
+            edgeCount: graph.uniqueEdgeCount,
+            mode,
+        };
+    }
+    catch (error) {
+        return {
+            algorithm: algoName,
+            category,
+            executionTime: 0,
+            success: false,
+            error: error instanceof Error ? error.message : String(error),
+            nodeCount: graph.nodeCount,
+            edgeCount: graph.uniqueEdgeCount,
+            mode,
+        };
+    }
+}
+/**
+ * Get appropriate arguments for each algorithm
+ * @param algoName - The name of the algorithm to get arguments for
+ * @param graph - The base graph to use for generating arguments
+ * @returns Array of arguments to pass to the algorithm function
+ */
+function getAlgorithmArgs(algoName, graph) {
+    // Get random nodes for algorithms that need them
+    const nodes = Array.from(graph.nodes()).map((n) => n.id);
+    const randomNode = nodes[Math.floor(Math.random() * nodes.length)];
+    const randomNode2 = nodes[Math.floor(Math.random() * nodes.length)];
+    // Algorithm-specific argument mapping
+    switch (algoName) {
+        // Single source algorithms
+        case "breadthFirstSearch":
+        case "depthFirstSearch":
+        case "singleSourceShortestPathBFS":
+        case "singleSourceShortestPath":
+        case "dijkstra":
+        case "bellmanFord":
+            return [graph, randomNode];
+        // PageRank algorithms need directed graph
+        case "pageRank": {
+            const directedForPR = createDirectedGraph(graph);
+            return [directedForPR];
+        }
+        case "personalizedPageRank": {
+            const directedForPPR = createDirectedGraph(graph);
+            const personalNodes = [randomNode]; // Array of nodes for personalization
+            return [directedForPPR, personalNodes];
+        }
+        // Two node algorithms
+        case "shortestPathBFS":
+        case "dijkstraPath":
+        case "bellmanFordPath":
+            return [graph, randomNode, randomNode2];
+        // Component-specific algorithms
+        case "getConnectedComponent":
+            return [graph, randomNode];
+        // Algorithms that need specific graph types
+        case "topologicalSort":
+        case "findStronglyConnectedComponents":
+        case "stronglyConnectedComponents":
+        case "weaklyConnectedComponents":
+        case "isStronglyConnected":
+        case "isWeaklyConnected": {
+            // Create a directed version of the graph for these algorithms
+            const directedGraph = createDirectedGraph(graph);
+            return [directedGraph];
+        }
+        // Bipartite algorithms need bipartite graphs
+        case "bipartitePartition":
+        case "greedyBipartiteMatching":
+        case "maximumBipartiteMatching": {
+            const bipartiteGraph = createBipartiteGraph(Math.floor(graph.nodeCount / 2));
+            return [bipartiteGraph];
+        }
+        // Community detection algorithms
+        case "labelPropagation":
+        case "leiden":
+        case "louvain":
+        case "girvanNewman":
+            return [graph, {}]; // Pass empty options
+        // Default: just the graph
+        default:
+            return [graph];
+    }
+}
+/**
+ * Create test graph appropriate for each algorithm category
+ * @param nodes - Number of nodes in the test graph
+ * @param edges - Target number of edges in the test graph
+ * @param category - The algorithm category to optimize the graph structure for
+ * @returns A new test graph with the specified structure
+ */
+function createTestGraph(nodes, edges, category) {
+    const graph = new Graph();
+    // Add nodes
+    for (let i = 0; i < nodes; i++) {
+        graph.addNode(i);
+    }
+    // Create different graph structures for different algorithm categories
+    switch (category) {
+        case "shortestPath":
+            // Sparse connected graph for shortest path algorithms
+            createConnectedGraph(graph, Math.min(edges, nodes * 3));
+            break;
+        case "centrality":
+            // Small-world graph good for centrality analysis
+            createSmallWorldGraph(graph, Math.floor(edges / nodes));
+            break;
+        case "community":
+            // Graph with community structure
+            createCommunityGraph(graph, edges);
+            break;
+        default:
+            // Random connected graph
+            createConnectedGraph(graph, edges);
+    }
+    return graph;
+}
+/**
+ * Create a connected random graph
+ * @param graph - The graph to add edges to
+ * @param targetEdges - Target number of edges to create
+ */
+function createConnectedGraph(graph, targetEdges) {
+    const nodes = graph.nodeCount;
+    // First create a spanning tree to ensure connectivity
+    for (let i = 1; i < nodes; i++) {
+        const parent = Math.floor(Math.random() * i);
+        graph.addEdge(parent, i);
+    }
+    // Add remaining edges randomly
+    let edgesAdded = nodes - 1;
+    while (edgesAdded < targetEdges) {
+        const source = Math.floor(Math.random() * nodes);
+        const target = Math.floor(Math.random() * nodes);
+        if (source !== target && !graph.hasEdge(source, target)) {
+            graph.addEdge(source, target);
+            edgesAdded++;
+        }
+    }
+}
+/**
+ * Create small-world graph (Watts-Strogatz model)
+ * @param graph - The graph to add edges to
+ * @param avgDegree - Target average degree for each node
+ */
+function createSmallWorldGraph(graph, avgDegree) {
+    const nodes = graph.nodeCount;
+    const k = Math.floor(avgDegree / 2);
+    // Ring lattice
+    for (let i = 0; i < nodes; i++) {
+        for (let j = 1; j <= k; j++) {
+            const target = (i + j) % nodes;
+            graph.addEdge(i, target);
+        }
+    }
+    // Rewire some edges
+    const rewireProb = 0.1;
+    for (let i = 0; i < nodes; i++) {
+        for (let j = 1; j <= k; j++) {
+            if (Math.random() < rewireProb) {
+                const oldTarget = (i + j) % nodes;
+                const newTarget = Math.floor(Math.random() * nodes);
+                if (newTarget !== i && !graph.hasEdge(i, newTarget)) {
+                    graph.removeEdge(i, oldTarget);
+                    graph.addEdge(i, newTarget);
+                }
+            }
+        }
+    }
+}
+/**
+ * Create graph with community structure
+ * @param graph - The graph to add edges to
+ * @param targetEdges - Target number of edges to create
+ */
+function createCommunityGraph(graph, targetEdges) {
+    const nodes = graph.nodeCount;
+    const communities = Math.min(5, Math.floor(nodes / 20)); // 5 communities max
+    const communitySize = Math.floor(nodes / communities);
+    let edgesAdded = 0;
+    // Create dense connections within communities
+    for (let c = 0; c < communities; c++) {
+        const start = c * communitySize;
+        const end = Math.min((c + 1) * communitySize, nodes);
+        for (let i = start; i < end && edgesAdded < targetEdges; i++) {
+            for (let j = i + 1; j < end && edgesAdded < targetEdges; j++) {
+                if (Math.random() < 0.8) {
+                    // High probability within community
+                    graph.addEdge(i, j);
+                    edgesAdded++;
+                }
+            }
+        }
+    }
+    // Add sparse connections between communities
+    while (edgesAdded < targetEdges) {
+        const source = Math.floor(Math.random() * nodes);
+        const target = Math.floor(Math.random() * nodes);
+        if (source !== target && !graph.hasEdge(source, target)) {
+            graph.addEdge(source, target);
+            edgesAdded++;
+        }
+    }
+}
+/**
+ * Create directed version of graph
+ * @param undirectedGraph - The undirected graph to convert
+ * @returns A new directed graph with the same nodes and edges
+ */
+function createDirectedGraph(undirectedGraph) {
+    const directedGraph = new Graph({ directed: true });
+    // Copy nodes
+    for (const node of undirectedGraph.nodes()) {
+        directedGraph.addNode(node.id);
+    }
+    // Copy edges as directed
+    for (const edge of undirectedGraph.edges()) {
+        directedGraph.addEdge(edge.source, edge.target);
+    }
+    return directedGraph;
+}
+/**
+ * Create bipartite graph
+ * @param nodesPerPartition - Number of nodes in each partition
+ * @returns A new bipartite graph with sparse connections between partitions
+ */
+function createBipartiteGraph(nodesPerPartition) {
+    const graph = new Graph();
+    // Add nodes (0 to n-1 in first partition, n to 2n-1 in second)
+    for (let i = 0; i < nodesPerPartition * 2; i++) {
+        graph.addNode(i);
+    }
+    // Add edges only between partitions
+    for (let i = 0; i < nodesPerPartition; i++) {
+        for (let j = nodesPerPartition; j < nodesPerPartition * 2; j++) {
+            if (Math.random() < 0.3) {
+                // Sparse bipartite graph
+                graph.addEdge(i, j);
+            }
+        }
+    }
+    return graph;
+}
+/**
+ * Get total algorithm count
+ * @returns The total number of algorithms across all categories
+ */
+function getTotalAlgorithmCount() {
+    return Object.values(ALGORITHM_CATEGORIES).reduce((total, category) => total + category.algorithms.length, 0);
+}
+/**
+ * Display detailed results for full benchmark
+ * @param results - Array of benchmark results to display
+ */
+function displayDetailedResults(results) {
+    console.log("\n📊 Detailed Results");
+    console.log("==================");
+    const categories = new Map();
+    for (const result of results) {
+        if (!categories.has(result.category)) {
+            categories.set(result.category, []);
+        }
+        categories.get(result.category)?.push(result);
+    }
+    for (const [category, categoryResults] of categories) {
+        console.log(`\n${category}:`);
+        console.log("-".repeat(category.length + 1));
+        const successful = categoryResults.filter((r) => r.success);
+        const failed = categoryResults.filter((r) => !r.success);
+        if (successful.length > 0) {
+            const avgTime = successful.reduce((sum, r) => sum + r.executionTime, 0) / successful.length;
+            console.log(`  Average time: ${avgTime.toFixed(2)}ms`);
+            const minTime = Math.min(...successful.map((r) => r.executionTime));
+            const maxTime = Math.max(...successful.map((r) => r.executionTime));
+            console.log(`  Range: ${minTime.toFixed(2)}ms - ${maxTime.toFixed(2)}ms`);
+        }
+        if (failed.length > 0) {
+            console.log(`  Failed algorithms: ${failed.map((r) => r.algorithm).join(", ")}`);
+        }
+    }
+}
+// Run benchmark if called directly
+if (typeof process !== "undefined" && import.meta.url === `file://${process.argv[1] ?? ""}`) {
+    const mode = process.argv.includes("--quick") ? "quick" : "full";
+    runAllAlgorithmsBenchmark(mode);
+}
+//# sourceMappingURL=benchmark-all-algorithms.js.map

package/dist/src/benchmark-all-algorithms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmark-all-algorithms.js","sourceRoot":"","sources":["../../src/benchmark-all-algorithms.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B;;;;;;GAMG;AAEH,OAAO,KAAK,UAAU,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAaxC,MAAM,oBAAoB,GAAG;IACzB,SAAS,EAAE;QACP,UAAU,EAAE;YACR,oBAAoB;YACpB,aAAa;YACb,iBAAiB;YACjB,6BAA6B;YAC7B,kBAAkB;YAClB,iCAAiC;YACjC,aAAa;YACb,iBAAiB;SACpB;QACD,MAAM,EAAE;YACJ,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;YAC5C,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE;SACjD;KACJ;IACD,YAAY,EAAE;QACV,UAAU,EAAE;YACR,aAAa;YACb,iBAAiB;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,UAAU;YACV,cAAc;YACd,0BAA0B;YAC1B,eAAe;YACf,mBAAmB;YACnB,mBAAmB;SACtB;QACD,MAAM,EAAE;YACJ,IAAI,EAAE,eAAe;YACrB,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,+BAA+B;YAC3E,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;SAC7C;KACJ;IACD,UAAU,EAAE;QACR,UAAU,EAAE;YACR,uBAAuB;YACvB,qBAAqB;YACrB,kBAAkB;YAClB,uBAAuB;YACvB,MAAM;YACN,gBAAgB;YAChB,UAAU;YACV,sBAAsB;SACzB;QACD,MAAM,EAAE;YACJ,IAAI,EAAE,YAAY;YAClB,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;YAC3C,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE;SAC/C;KACJ;IACD,UAAU,EAAE;QACR,UAAU,EAAE;YACR,qBAAqB;YACrB,wBAAwB;YACxB,6BAA6B;YAC7B,2BAA2B;YAC3B,aAAa;YACb,qBAAqB;YACrB,mBAAmB;YACnB,6BAA6B;YAC7B,2BAA2B;YAC3B,uBAAuB;SAC1B;QACD,MAAM,EAAE;YACJ,IAAI,EAAE,YAAY;YAClB,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE;YAC7C,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE;SACjD;KACJ;IACD,GAAG,EAAE;QACD,UAAU,EAAE,CAAC,YAAY,EAAE,SAAS,EAAE,qBAAqB,CAAC;QAC5D,MAAM,EAAE;YACJ,IAAI,EAAE,uBAAuB;YAC7B,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;YAC5C,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE;SAChD;KACJ;IACD,SAAS,EAAE;QACP,UAAU,EAAE,CAAC,cAAc,EAAE,kBAAkB,EAAE,QAAQ,EAAE,SAAS,CAAC;QACrE,MAAM,EAAE;YACJ,IAAI,EAAE,qBAAqB;YAC3B,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,4BAA4B;YACzE,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;SAC9C;KACJ;IACD,QAAQ,EAAE;QACN,UAAU,EAAE,CAAC,oBAAoB,EAAE,yBAAyB,EAAE,0BAA0B,CAAC;QACzF,MAAM,EAAE;YACJ,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;YAC3C,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;SAC9C;KACJ;CACK,CAAC;AAEX;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAyB,MAAM;IACrE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,kBAAkB;IAEvF,OAAO,CAAC,GAAG,CACP,MAAM,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,oBAAoB,MAAM,CAAC,sBAAsB,EAAE,CAAC,aAAa,CACtH,CAAC;IACF,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAClC,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IACxE,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC;IAEhE,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE,CAAC;QAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACvC,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAC;YACxD,MAAM;QACV,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,QAAQ,YAAY,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC,CAAC;QAC3D,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;QAE9D,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAEvE,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACvC,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,oCAAoC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC5E,MAAM;YACV,CAAC;YAED,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAChG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,WAAW,EAAE,CAAC;YAEd,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjB,WAAW,EAAE,CAAC;gBACd,OAAO,CAAC,GAAG,CAAC,OAAO,QAAQ,KAAK,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,GAAG,CAAC,OAAO,QAAQ,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;YAClF,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC;IAElD,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;IACvC,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,eAAe,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,OAAO,CAAC,GAAG,CAAC,sBAAsB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IACzD,OAAO,CAAC,GAAG,CACP,iBAAiB,MAAM,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CACrH,CAAC;IAEF,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QAClB,sBAAsB,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CACvB,QAAgB,EAChB,QAAgB,EAChB,KAAY,EACZ,IAAY,EACZ,IAAsB;IAEtB,MAAM,IAAI,GAAI,UAAsC,CAAC,QAAQ,CAAC,CAAC;IAE/D,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;QACtC,OAAO;YACH,SAAS,EAAE,QAAQ;YACnB,QAAQ;YACR,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,uCAAuC;YAC9C,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,KAAK,CAAC,eAAe;YAChC,IAAI;SACP,CAAC;IACN,CAAC;IAED,IAAI,CAAC;QACD,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAE/B,IAAwC,CAAC,GAAG,IAAI,CAAC,CAAC;YAEnD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,oCAAoC;QACpC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAE5D,OAAO;YACH,SAAS,EAAE,QAAQ;YACnB,QAAQ;YACR,aAAa,EAAE,UAAU;YACzB,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,KAAK,CAAC,eAAe;YAChC,IAAI;SACP,CAAC;IACN,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,OAAO;YACH,SAAS,EAAE,QAAQ;YACnB,QAAQ;YACR,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;YAC7D,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,KAAK,CAAC,eAAe;YAChC,IAAI;SACP,CAAC;IACN,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,QAAgB,EAAE,KAAY;IACpD,iDAAiD;IACjD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnE,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAEpE,sCAAsC;IACtC,QAAQ,QAAQ,EAAE,CAAC;QACf,2BAA2B;QAC3B,KAAK,oBAAoB,CAAC;QAC1B,KAAK,kBAAkB,CAAC;QACxB,KAAK,6BAA6B,CAAC;QACnC,KAAK,0BAA0B,CAAC;QAChC,KAAK,UAAU,CAAC;QAChB,KAAK,aAAa;YACd,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAE/B,0CAA0C;QAC1C,KAAK,UAAU,CAAC,CAAC,CAAC;YACd,MAAM,aAAa,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,aAAa,CAAC,CAAC;QAC3B,CAAC;QAED,KAAK,sBAAsB,CAAC,CAAC,CAAC;YAC1B,MAAM,cAAc,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,qCAAqC;YACzE,OAAO,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;QAC3C,CAAC;QAED,sBAAsB;QACtB,KAAK,iBAAiB,CAAC;QACvB,KAAK,cAAc,CAAC;QACpB,KAAK,iBAAiB;YAClB,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;QAE5C,gCAAgC;QAChC,KAAK,uBAAuB;YACxB,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAE/B,4CAA4C;QAC5C,KAAK,iBAAiB,CAAC;QACvB,KAAK,iCAAiC,CAAC;QACvC,KAAK,6BAA6B,CAAC;QACnC,KAAK,2BAA2B,CAAC;QACjC,KAAK,qBAAqB,CAAC;QAC3B,KAAK,mBAAmB,CAAC,CAAC,CAAC;YACvB,8DAA8D;YAC9D,MAAM,aAAa,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,aAAa,CAAC,CAAC;QAC3B,CAAC;QAED,6CAA6C;QAC7C,KAAK,oBAAoB,CAAC;QAC1B,KAAK,yBAAyB,CAAC;QAC/B,KAAK,0BAA0B,CAAC,CAAC,CAAC;YAC9B,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7E,OAAO,CAAC,cAAc,CAAC,CAAC;QAC5B,CAAC;QAED,iCAAiC;QACjC,KAAK,kBAAkB,CAAC;QACxB,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,cAAc;YACf,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,qBAAqB;QAE7C,0BAA0B;QAC1B;YACI,OAAO,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAa,EAAE,KAAa,EAAE,QAAgB;IACnE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;IAE1B,YAAY;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,uEAAuE;IACvE,QAAQ,QAAQ,EAAE,CAAC;QACf,KAAK,cAAc;YACf,sDAAsD;YACtD,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM;QAEV,KAAK,YAAY;YACb,iDAAiD;YACjD,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;YACxD,MAAM;QAEV,KAAK,WAAW;YACZ,iCAAiC;YACjC,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnC,MAAM;QAEV;YACI,yBAAyB;YACzB,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,KAAY,EAAE,WAAmB;IAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;IAE9B,sDAAsD;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7C,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,+BAA+B;IAC/B,IAAI,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;IAC3B,OAAO,UAAU,GAAG,WAAW,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;QAEjD,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC9B,UAAU,EAAE,CAAC;QACjB,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,KAAY,EAAE,SAAiB;IAC1D,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAEpC,eAAe;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,oBAAoB;IACpB,MAAM,UAAU,GAAG,GAAG,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;gBAC7B,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;gBAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;oBAClD,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAChC,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,KAAY,EAAE,WAAmB;IAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;IAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB;IAC7E,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,CAAC;IAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,8CAA8C;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,CAAC,GAAG,aAAa,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,CAAC;QAErD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3D,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;oBACtB,oCAAoC;oBACpC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpB,UAAU,EAAE,CAAC;gBACjB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,OAAO,UAAU,GAAG,WAAW,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;QAEjD,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC9B,UAAU,EAAE,CAAC;QACjB,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,eAAsB;IAC/C,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IAEpD,aAAa;IACb,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC;QACzC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,yBAAyB;IACzB,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC;QACzC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,aAAa,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,iBAAyB;IACnD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;IAE1B,+DAA+D;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,oCAAoC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,iBAAiB,EAAE,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;gBACtB,yBAAyB;gBACzB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB;IAC3B,OAAO,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAClH,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,OAA0B;IACtD,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IAElC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;IAExD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,KAAK,MAAM,CAAC,QAAQ,EAAE,eAAe,CAAC,IAAI,UAAU,EAAE,CAAC;QACnD,OAAO,CAAC,GAAG,CAAC,KAAK,QAAQ,GAAG,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAE7C,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAEzD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;YAC5F,OAAO,CAAC,GAAG,CAAC,mBAAmB,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YACpE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YACpE,OAAO,CAAC,GAAG,CAAC,YAAY,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,wBAAwB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC;IACL,CAAC;AACL,CAAC;AAED,mCAAmC;AACnC,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1F,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACjE,yBAAyB,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC"}

package/dist/src/clustering/hierarchical.d.ts

@@ -5,6 +5,7 @@
  * or division (top-down). Useful for understanding multi-scale
  * structure in graphs.
  */
+import type { Graph } from "../core/graph.js";
 export interface ClusterNode<T> {
     id: string;
     members: Set<T>;
@@ -21,28 +22,35 @@ export interface HierarchicalClusteringResult<T> {
 }
 export type LinkageMethod = "single" | "complete" | "average" | "ward";
 /**
- * Agglomerative hierarchical clustering
- * Builds clusters bottom-up by merging closest pairs
- *
- * @param graph - Undirected graph
- * @param linkage - Linkage method for cluster distance
- * @returns Hierarchical clustering result
- *
- * Time Complexity: O(n³) naive, O(n² log n) with heap
- * Space Complexity: O(n²)
- */
-export declare function hierarchicalClustering<T>(graph: Map<T, Set<T>>, linkage?: LinkageMethod): HierarchicalClusteringResult<T>;
-/**
- * Cut dendrogram at specified height to get clusters
+ * Cut dendrogram at specific height to get clusters
+ * @param root - Root node of the dendrogram
+ * @param height - Height at which to cut the dendrogram
+ * @returns Array of sets representing clusters at the specified height
  */
 export declare function cutDendrogram<T>(root: ClusterNode<T>, height: number): Set<T>[];
 /**
- * Cut dendrogram to get k clusters
+ * Cut dendrogram to get exactly k clusters
+ * @param root - Root node of the dendrogram
+ * @param k - Target number of clusters
+ * @returns Array of sets representing exactly k clusters
  */
 export declare function cutDendrogramKClusters<T>(root: ClusterNode<T>, k: number): Set<T>[];
 /**
  * Compute modularity-based hierarchical clustering
  * Uses modularity gain to decide merges
+ * @param graph - The input graph to cluster
+ * @returns Hierarchical clustering result with dendrogram and cluster assignments
+ */
+export declare function modularityHierarchicalClustering(graph: Graph): HierarchicalClusteringResult<string>;
+/**
+ * Agglomerative hierarchical clustering
+ * Builds clusters bottom-up by merging closest pairs
+ * @param graph - Undirected graph - accepts Graph class or Map<T, Set<T>>
+ * @param linkage - Linkage method for cluster distance
+ * @returns Hierarchical clustering result
+ *
+ * Time Complexity: O(n³) naive, O(n² log n) with heap
+ * Space Complexity: O(n²)
  */
-export declare function modularityHierarchicalClustering<T>(graph: Map<T, Set<T>>): HierarchicalClusteringResult<T>;
+export declare function hierarchicalClustering(graph: Graph, linkage?: LinkageMethod): HierarchicalClusteringResult<string>;
 //# sourceMappingURL=hierarchical.d.ts.map

package/dist/src/clustering/hierarchical.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hierarchical.d.ts","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,WAAW,CAAC,CAAC;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAClC,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IAEf,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC;CACxC;AAED,MAAM,WAAW,4BAA4B,CAAC,CAAC;IAC3C,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IACrB,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,MAAM,CAAC;AA+EvE;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EACpC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EACrB,OAAO,GAAE,aAAwB,GAClC,4BAA4B,CAAC,CAAC,CAAC,CAqNjC;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC3B,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EACpB,MAAM,EAAE,MAAM,GACf,GAAG,CAAC,CAAC,CAAC,EAAE,CA8BV;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EACpC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EACpB,CAAC,EAAE,MAAM,GACV,GAAG,CAAC,CAAC,CAAC,EAAE,CA2BV;AAED;;;GAGG;AACH,wBAAgB,gCAAgC,CAAC,CAAC,EAC9C,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GACtB,4BAA4B,CAAC,CAAC,CAAC,CA6IjC"}
+{"version":3,"file":"hierarchical.d.ts","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAqC9C,MAAM,WAAW,WAAW,CAAC,CAAC;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAClC,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IAEf,KAAK,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC;CACxC;AAED,MAAM,WAAW,4BAA4B,CAAC,CAAC;IAC3C,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IACrB,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,MAAM,CAAC;AA0QvE;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CA0B/E;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CA2BnF;AAED;;;;;GAKG;AACH,wBAAgB,gCAAgC,CAAC,KAAK,EAAE,KAAK,GAAG,4BAA4B,CAAC,MAAM,CAAC,CAgInG;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAClC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,aAAwB,GAClC,4BAA4B,CAAC,MAAM,CAAC,CAItC"}