@graphty/algorithms 1.1.0 → 1.3.1

package/dist/src/clustering/hierarchical.js

@@ -5,6 +5,33 @@
  * or division (top-down). Useful for understanding multi-scale
  * structure in graphs.
  */
+/**
+ * Convert Graph to adjacency set representation for clustering
+ */
+function graphToAdjacencySet(graph) {
+    const adjacency = new Map();
+    // Initialize all nodes
+    for (const node of graph.nodes()) {
+        adjacency.set(String(node.id), new Set());
+    }
+    // Add edges
+    for (const edge of graph.edges()) {
+        const source = String(edge.source);
+        const target = String(edge.target);
+        const sourceSet = adjacency.get(source);
+        if (sourceSet) {
+            sourceSet.add(target);
+        }
+        // For undirected graphs, add reverse edge
+        if (!graph.isDirected) {
+            const targetSet = adjacency.get(target);
+            if (targetSet) {
+                targetSet.add(source);
+            }
+        }
+    }
+    return adjacency;
+}
 /**
  * Compute distance between two nodes based on graph structure
  */
@@ -23,10 +50,7 @@ function computeGraphDistance(graph, distances) {
             if (neighbors) {
                 for (const neighbor of neighbors) {
                     if (!dist.has(neighbor)) {
-                        const nodeDistance = dist.get(node);
-                        if (nodeDistance !== undefined) {
-                            dist.set(neighbor, nodeDistance + 1);
-                        }
+                        dist.set(neighbor, (dist.get(node) ?? 0) + 1);
                         queue.push(neighbor);
                     }
                 }
@@ -36,46 +60,47 @@ function computeGraphDistance(graph, distances) {
     }
 }
 /**
- * Compute distance between clusters based on linkage method
+ * Compute distance between two clusters based on linkage method
  */
-function clusterDistance(cluster1, cluster2, distances, method) {
-    if (cluster1.size === 0 || cluster2.size === 0) {
-        return Infinity;
-    }
+function clusterDistance(cluster1, cluster2, distances, linkage) {
     const allDistances = [];
-    for (const node1 of cluster1) {
-        for (const node2 of cluster2) {
-            const dist = distances.get(node1)?.get(node2) ?? Infinity;
-            allDistances.push(dist);
+    for (const node1 of cluster1.members) {
+        const node1Distances = distances.get(node1);
+        if (!node1Distances) {
+            continue;
         }
+        for (const node2 of cluster2.members) {
+            const dist = node1Distances.get(node2);
+            if (dist !== undefined) {
+                allDistances.push(dist);
+            }
+        }
+    }
+    if (allDistances.length === 0) {
+        return Infinity;
     }
-    switch (method) {
+    switch (linkage) {
         case "single":
             return Math.min(...allDistances);
         case "complete":
             return Math.max(...allDistances);
         case "average":
             return allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
-        case "ward":
-            // Ward's method minimizes within-cluster variance
-            // For simplicity, we use average here
-            return allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
+        case "ward": {
+            // Simplified Ward's method - minimize within-cluster variance
+            const size1 = cluster1.members.size;
+            const size2 = cluster2.members.size;
+            const avgDist = allDistances.reduce((a, b) => a + b, 0) / allDistances.length;
+            return avgDist * ((size1 * size2) / (size1 + size2));
+        }
         default:
             return Math.min(...allDistances);
     }
 }
 /**
- * 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²)
+ * Internal implementation of agglomerative hierarchical clustering
  */
-export function hierarchicalClustering(graph, linkage = "single") {
+function hierarchicalClusteringImpl(graph, linkage = "single") {
     const nodes = Array.from(graph.keys());
     const n = nodes.length;
     if (n === 0) {
@@ -101,152 +126,113 @@ export function hierarchicalClustering(graph, linkage = "single") {
     const clusterDistances = new Map();
     // Initialize cluster distances
     for (let i = 0; i < clusters.length; i++) {
-        const clusterI = clusters[i];
-        if (!clusterI) {
+        const cluster1 = clusters[i];
+        if (!cluster1) {
             continue;
         }
-        clusterDistances.set(clusterI.id, new Map());
+        const distMap = new Map();
         for (let j = i + 1; j < clusters.length; j++) {
-            const clusterJ = clusters[j];
-            if (!clusterJ) {
+            const cluster2 = clusters[j];
+            if (!cluster2) {
                 continue;
             }
-            const dist = clusterDistance(clusterI.members, clusterJ.members, distances, linkage);
-            const clusterIDistances = clusterDistances.get(clusterI.id);
-            if (clusterIDistances) {
-                clusterIDistances.set(clusterJ.id, dist);
-            }
+            const dist = clusterDistance(cluster1, cluster2, distances, linkage);
+            distMap.set(cluster2.id, dist);
         }
+        clusterDistances.set(cluster1.id, distMap);
     }
+    // Active clusters
+    const activeClusters = new Set(clusters);
     // Merge clusters until only one remains
-    while (clusters.length > 1) {
+    while (activeClusters.size > 1) {
         // Find closest pair of clusters
         let minDist = Infinity;
-        let merge1 = 0;
-        let merge2 = 0;
-        for (let i = 0; i < clusters.length; i++) {
-            for (let j = i + 1; j < clusters.length; j++) {
-                const clusterI = clusters[i];
-                const clusterJ = clusters[j];
-                if (!clusterI || !clusterJ) {
+        let mergeCluster1 = null;
+        let mergeCluster2 = null;
+        for (const cluster1 of activeClusters) {
+            const distMap = clusterDistances.get(cluster1.id);
+            if (!distMap) {
+                continue;
+            }
+            for (const cluster2 of activeClusters) {
+                if (cluster1.id >= cluster2.id) {
                     continue;
                 }
-                const dist = clusterDistances.get(clusterI.id)?.get(clusterJ.id) ??
-                    clusterDistances.get(clusterJ.id)?.get(clusterI.id) ??
+                const dist = distMap.get(cluster2.id) ??
+                    clusterDistances.get(cluster2.id)?.get(cluster1.id) ??
                     Infinity;
                 if (dist < minDist) {
                     minDist = dist;
-                    merge1 = i;
-                    merge2 = j;
+                    mergeCluster1 = cluster1;
+                    mergeCluster2 = cluster2;
                 }
             }
         }
-        // Check if we found a valid merge
-        if (minDist === Infinity || merge1 === merge2) {
-            // No more clusters can be merged (disconnected components)
+        if (!mergeCluster1 || !mergeCluster2 || minDist === Infinity) {
+            // No valid merge found - create forest
+            const trees = Array.from(activeClusters);
+            const forestRoot = {
+                id: `forest-${String(clusterCount++)}`,
+                members: new Set(nodes),
+                distance: Infinity,
+                height: Math.max(...trees.map((t) => t.height)) + 1,
+                trees,
+            };
+            dendrogram.push(forestRoot);
+            activeClusters.clear();
+            activeClusters.add(forestRoot);
             break;
         }
         // Create new cluster
-        const cluster1 = clusters[merge1];
-        const cluster2 = clusters[merge2];
-        if (!cluster1 || !cluster2) {
-            continue;
-        }
         const newCluster = {
             id: `cluster-${String(clusterCount++)}`,
-            members: new Set([...cluster1.members, ...cluster2.members]),
-            left: cluster1,
-            right: cluster2,
+            members: new Set([...mergeCluster1.members, ...mergeCluster2.members]),
+            left: mergeCluster1,
+            right: mergeCluster2,
             distance: minDist,
-            height: Math.max(cluster1.height, cluster2.height) + 1,
+            height: Math.max(mergeCluster1.height, mergeCluster2.height) + 1,
         };
         dendrogram.push(newCluster);
-        // Update cluster distances for new cluster
-        clusterDistances.set(newCluster.id, new Map());
-        for (let i = 0; i < clusters.length; i++) {
-            if (i !== merge1 && i !== merge2) {
-                const clusterI = clusters[i];
-                if (!clusterI) {
-                    continue;
-                }
-                const newDist = clusterDistance(newCluster.members, clusterI.members, distances, linkage);
-                const newClusterDistances = clusterDistances.get(newCluster.id);
-                if (newClusterDistances) {
-                    newClusterDistances.set(clusterI.id, newDist);
-                }
+        // Update distances to new cluster
+        const newDistMap = new Map();
+        for (const cluster of activeClusters) {
+            if (cluster.id === mergeCluster1.id || cluster.id === mergeCluster2.id) {
+                continue;
+            }
+            const dist = clusterDistance(newCluster, cluster, distances, linkage);
+            newDistMap.set(cluster.id, dist);
+            // Update reverse direction
+            const clusterDistMap = clusterDistances.get(cluster.id);
+            if (clusterDistMap) {
+                clusterDistMap.set(newCluster.id, dist);
             }
         }
-        // Remove old clusters and their distances
-        clusterDistances.delete(cluster1.id);
-        clusterDistances.delete(cluster2.id);
-        for (const [, dists] of clusterDistances) {
-            dists.delete(cluster1.id);
-            dists.delete(cluster2.id);
+        clusterDistances.set(newCluster.id, newDistMap);
+        // Remove merged clusters
+        activeClusters.delete(mergeCluster1);
+        activeClusters.delete(mergeCluster2);
+        clusterDistances.delete(mergeCluster1.id);
+        clusterDistances.delete(mergeCluster2.id);
+        // Clean up references
+        for (const distMap of clusterDistances.values()) {
+            distMap.delete(mergeCluster1.id);
+            distMap.delete(mergeCluster2.id);
         }
-        // Remove merged clusters and add new one
-        clusters.splice(Math.max(merge1, merge2), 1);
-        clusters.splice(Math.min(merge1, merge2), 1);
-        clusters.push(newCluster);
+        activeClusters.add(newCluster);
     }
-    // Generate clusters at different levels
+    // Root is the last remaining cluster
+    const root = activeClusters.size > 0 ? Array.from(activeClusters)[0] : dendrogram[dendrogram.length - 1];
+    // Generate clusters at different heights
     const clustersByLevel = new Map();
-    function extractClustersAtHeight(node, height, clusters) {
-        if (node.height <= height || !node.left || !node.right) {
-            clusters.push(node.members);
-        }
-        else {
-            extractClustersAtHeight(node.left, height, clusters);
-            extractClustersAtHeight(node.right, height, clusters);
-        }
-    }
-    // Handle the case where we have multiple disconnected components
-    let root;
-    if (clusters.length === 0) {
+    if (!root) {
         return {
             root: { id: "empty", members: new Set(), distance: 0, height: 0 },
             dendrogram: [],
             clusters: new Map(),
         };
     }
-    else if (clusters.length === 1 && clusters[0]) {
-        root = clusters[0];
-    }
-    else {
-        // Create a root that combines all remaining clusters (forest)
-        const allMembers = new Set();
-        let maxHeight = 0;
-        for (const cluster of clusters) {
-            for (const member of cluster.members) {
-                allMembers.add(member);
-            }
-            maxHeight = Math.max(maxHeight, cluster.height);
-        }
-        root = {
-            id: "root-forest",
-            members: allMembers,
-            distance: Infinity,
-            height: maxHeight + 1,
-            // Store references to the individual trees
-            trees: [...clusters],
-        };
-        dendrogram.push(root);
-    }
     for (let h = 0; h <= root.height; h++) {
-        const clustersAtHeight = [];
-        if (clusters.length > 1 && h === root.height) {
-            // At forest root height, return single cluster with all members
-            clustersAtHeight.push(root.members);
-        }
-        else if (clusters.length > 1 && h < root.height) {
-            // For forest, extract from each tree separately
-            for (const tree of clusters) {
-                extractClustersAtHeight(tree, h, clustersAtHeight);
-            }
-        }
-        else {
-            extractClustersAtHeight(root, h, clustersAtHeight);
-        }
-        clustersByLevel.set(h, clustersAtHeight);
+        clustersByLevel.set(h, cutDendrogram(root, h));
     }
     return {
         root,
@@ -255,39 +241,36 @@ export function hierarchicalClustering(graph, linkage = "single") {
     };
 }
 /**
- * Cut dendrogram at specified height to get clusters
+ * Cut dendrogram at specific height to get clusters
  */
 export function cutDendrogram(root, height) {
     const clusters = [];
     function traverse(node) {
-        // Handle forest root specially
-        if (node.trees) {
-            if (node.height <= height) {
-                // If we're at or below the requested height, return the whole forest as one cluster
-                clusters.push(node.members);
-            }
-            else {
-                // Otherwise, traverse each tree in the forest
+        if (node.height <= height || (!node.left && !node.right)) {
+            clusters.push(node.members);
+        }
+        else {
+            if (node.trees) {
+                // Handle forest nodes
                 for (const tree of node.trees) {
                     traverse(tree);
                 }
             }
-            return;
-        }
-        // Normal binary tree traversal
-        if (node.height <= height || !node.left || !node.right) {
-            clusters.push(node.members);
-        }
-        else {
-            traverse(node.left);
-            traverse(node.right);
+            else {
+                if (node.left) {
+                    traverse(node.left);
+                }
+                if (node.right) {
+                    traverse(node.right);
+                }
+            }
         }
     }
     traverse(root);
     return clusters;
 }
 /**
- * Cut dendrogram to get k clusters
+ * Cut dendrogram to get exactly k clusters
  */
 export function cutDendrogramKClusters(root, k) {
     if (k <= 0) {
@@ -296,7 +279,7 @@ export function cutDendrogramKClusters(root, k) {
     if (k === 1) {
         return [root.members];
     }
-    // Find the height that gives us k clusters
+    // Binary search for the right height
     let low = 0;
     let high = root.height;
     while (low < high) {
@@ -319,7 +302,8 @@ export function cutDendrogramKClusters(root, k) {
  * Uses modularity gain to decide merges
  */
 export function modularityHierarchicalClustering(graph) {
-    const nodes = Array.from(graph.keys());
+    const adjacencySet = graphToAdjacencySet(graph);
+    const nodes = Array.from(adjacencySet.keys());
     const n = nodes.length;
     if (n === 0) {
         return {
@@ -328,12 +312,15 @@ export function modularityHierarchicalClustering(graph) {
             clusters: new Map(),
         };
     }
-    // Calculate total edges
-    let m = 0;
-    for (const neighbors of graph.values()) {
-        m += neighbors.size;
+    // Compute degrees
+    const degrees = new Map();
+    let totalEdges = 0;
+    for (const [node, neighbors] of adjacencySet) {
+        degrees.set(node, neighbors.size);
+        totalEdges += neighbors.size;
     }
-    m = m / 2; // Each edge counted twice
+    // For undirected graphs
+    totalEdges = totalEdges / 2;
     // Initialize clusters
     const clusters = nodes.map((node, i) => ({
         id: `leaf-${String(i)}`,
@@ -343,83 +330,66 @@ export function modularityHierarchicalClustering(graph) {
     }));
     const dendrogram = [...clusters];
     let clusterCount = n;
-    // Track community assignments
-    const communityMap = new Map();
-    nodes.forEach((node, i) => communityMap.set(node, i));
-    // Compute modularity gain for merging communities
-    function modularityGain(comm1, comm2) {
-        let edgesBetween = 0;
-        let degree1 = 0;
-        let degree2 = 0;
-        for (const node1 of comm1) {
-            const neighbors = graph.get(node1);
-            if (!neighbors) {
-                continue;
-            }
-            degree1 += neighbors.size;
-            for (const neighbor of neighbors) {
-                if (comm2.has(neighbor)) {
-                    edgesBetween++;
-                }
-            }
-        }
-        for (const node2 of comm2) {
-            const node2Neighbors = graph.get(node2);
-            if (node2Neighbors) {
-                degree2 += node2Neighbors.size;
-            }
-        }
-        // Modularity gain formula
-        const gain = (edgesBetween / m) - ((degree1 * degree2) / (4 * m * m));
-        return gain;
-    }
-    // Merge clusters based on modularity
-    while (clusters.length > 1) {
+    // Active clusters
+    const activeClusters = new Set(clusters);
+    // Community assignments
+    const communities = new Map();
+    nodes.forEach((node, i) => communities.set(node, i));
+    // Merge clusters based on modularity gain
+    while (activeClusters.size > 1) {
         let maxGain = -Infinity;
-        let merge1 = 0;
-        let merge2 = 0;
-        for (let i = 0; i < clusters.length; i++) {
-            for (let j = i + 1; j < clusters.length; j++) {
-                const clusterI = clusters[i];
-                const clusterJ = clusters[j];
-                if (!clusterI || !clusterJ) {
+        let mergeCluster1 = null;
+        let mergeCluster2 = null;
+        for (const cluster1 of activeClusters) {
+            for (const cluster2 of activeClusters) {
+                if (cluster1.id >= cluster2.id) {
                     continue;
                 }
-                const gain = modularityGain(clusterI.members, clusterJ.members);
+                // Calculate modularity gain
+                let edgesBetween = 0;
+                let degreeProduct = 0;
+                for (const node1 of cluster1.members) {
+                    const neighbors = adjacencySet.get(node1);
+                    const degree1 = degrees.get(node1) ?? 0;
+                    for (const node2 of cluster2.members) {
+                        if (neighbors?.has(node2)) {
+                            edgesBetween++;
+                        }
+                        const degree2 = degrees.get(node2) ?? 0;
+                        degreeProduct += degree1 * degree2;
+                    }
+                }
+                const gain = (edgesBetween / totalEdges) -
+                    (degreeProduct / (4 * totalEdges * totalEdges));
                 if (gain > maxGain) {
                     maxGain = gain;
-                    merge1 = i;
-                    merge2 = j;
+                    mergeCluster1 = cluster1;
+                    mergeCluster2 = cluster2;
                 }
             }
         }
-        // Create new cluster
-        const cluster1 = clusters[merge1];
-        const cluster2 = clusters[merge2];
-        if (!cluster1 || !cluster2) {
-            continue;
+        if (!mergeCluster1 || !mergeCluster2) {
+            break;
         }
+        // Create new cluster
         const newCluster = {
             id: `cluster-${String(clusterCount++)}`,
-            members: new Set([...cluster1.members, ...cluster2.members]),
-            left: cluster1,
-            right: cluster2,
+            members: new Set([...mergeCluster1.members, ...mergeCluster2.members]),
+            left: mergeCluster1,
+            right: mergeCluster2,
             distance: -maxGain, // Use negative gain as distance
-            height: Math.max(cluster1.height, cluster2.height) + 1,
+            height: Math.max(mergeCluster1.height, mergeCluster2.height) + 1,
         };
         dendrogram.push(newCluster);
-        // Update community assignments
-        for (const node of newCluster.members) {
-            communityMap.set(node, clusterCount - 1);
-        }
-        // Remove merged clusters
-        clusters.splice(Math.max(merge1, merge2), 1);
-        clusters.splice(Math.min(merge1, merge2), 1);
-        clusters.push(newCluster);
+        // Remove old and add new
+        activeClusters.delete(mergeCluster1);
+        activeClusters.delete(mergeCluster2);
+        activeClusters.add(newCluster);
     }
-    // Generate clusters at different levels
+    // Root is the last remaining cluster
+    const root = Array.from(activeClusters)[0] ?? dendrogram[dendrogram.length - 1];
+    // Generate clusters at different heights
     const clustersByLevel = new Map();
-    const root = clusters[0];
     if (!root) {
         return {
             root: { id: "empty", members: new Set(), distance: 0, height: 0 },
@@ -436,4 +406,20 @@ export function modularityHierarchicalClustering(graph) {
         clusters: clustersByLevel,
     };
 }
+/**
+ * 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 function hierarchicalClustering(graph, linkage = "single") {
+    // Convert Graph to adjacency set representation
+    const adjacencySet = graphToAdjacencySet(graph);
+    return hierarchicalClusteringImpl(adjacencySet, linkage);
+}
 //# sourceMappingURL=hierarchical.js.map

package/dist/src/clustering/hierarchical.js.map

@@ -1 +1 @@
-{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqBH;;GAEG;AACH,SAAS,oBAAoB,CACzB,KAAqB,EACrB,SAAiC;IAEjC,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;QAClC,MAAM,KAAK,GAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACR,SAAS;YACb,CAAC;YAED,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElC,IAAI,SAAS,EAAE,CAAC;gBACZ,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACtB,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACpC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;wBACzC,CAAC;wBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACpB,QAAgB,EAChB,QAAgB,EAChB,SAAiC,EACjC,MAAqB;IAErB,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC;YAC1D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,QAAQ,MAAM,EAAE,CAAC;QACb,KAAK,QAAQ;YACT,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,KAAK,SAAS;YACV,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzE,KAAK,MAAM;YACP,kDAAkD;YAClD,sCAAsC;YACtC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzE;YACI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;IAC1C,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAClC,KAAqB,EACrB,UAAyB,QAAQ;IAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAEvC,qDAAqD;IACrD,MAAM,QAAQ,GAAqB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvD,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAqB,CAAC,GAAI,QAAQ,CAAC,CAAC;IACpD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,mCAAmC;IACnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEhE,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,SAAS;QACb,CAAC;QAED,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACZ,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,eAAe,CACxB,QAAQ,CAAC,OAAO,EAChB,QAAQ,CAAC,OAAO,EAChB,SAAS,EACT,OAAO,CACV,CAAC;YACF,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC5D,IAAI,iBAAiB,EAAE,CAAC;gBACpB,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC;IAED,wCAAwC;IACxC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,gCAAgC;QAC5B,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5D,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACnD,QAAQ,CAAC;gBAEb,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM,GAAG,CAAC,CAAC;oBACX,MAAM,GAAG,CAAC,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QAED,kCAAkC;QAClC,IAAI,OAAO,KAAK,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC5C,2DAA2D;YAC3D,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QAED,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,QAAQ,CAAC,OAAO,EAAE,GAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC9D,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC;SACzD,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,2CAA2C;QAC3C,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACZ,SAAS;gBACb,CAAC;gBAED,MAAM,OAAO,GAAG,eAAe,CAC3B,UAAU,CAAC,OAAO,EAClB,QAAQ,CAAC,OAAO,EAChB,SAAS,EACT,OAAO,CACV,CAAC;gBACF,MAAM,mBAAmB,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChE,IAAI,mBAAmB,EAAE,CAAC;oBACtB,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAClD,CAAC;YACL,CAAC;QACL,CAAC;QAED,0CAA0C;QAC1C,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;YACvC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC1B,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,yCAAyC;QACzC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,wCAAwC;IACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEpD,SAAS,uBAAuB,CAAC,IAAoB,EAAE,MAAc,EAAE,QAAkB;QACrF,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,uBAAuB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACrD,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,iEAAiE;IACjE,IAAI,IAAoB,CAAC;IACzB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;SAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;SAAM,CAAC;QACJ,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAK,CAAC;QAChC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;YACD,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,GAAG;YACH,EAAE,EAAE,aAAa;YACjB,OAAO,EAAE,UAAU;YACnB,QAAQ,EAAE,QAAQ;YAClB,MAAM,EAAE,SAAS,GAAG,CAAC;YACrB,2CAA2C;YAC3C,KAAK,EAAE,CAAC,GAAI,QAAQ,CAAC;SACxB,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3C,gEAAgE;YAChE,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,gDAAgD;YAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,uBAAuB,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACvD,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,uBAAuB,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACvD,CAAC;QAED,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CACzB,IAAoB,EACpB,MAAc;IAEd,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,SAAS,QAAQ,CAAC,IAAoB;QAClC,+BAA+B;QAC/B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACxB,oFAAoF;gBACpF,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACJ,8CAA8C;gBAC9C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACL,CAAC;YAED,OAAO;QACX,CAAC;QAED,+BAA+B;QAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAClC,IAAoB,EACpB,CAAS;IAET,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,2CAA2C;IAC3C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IAEvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC;QACpB,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC;QACf,CAAC;aAAM,CAAC;YACJ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACL,CAAC;IAED,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gCAAgC,CAC5C,KAAqB;IAErB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,wBAAwB;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC;IACxB,CAAC;IACD,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,0BAA0B;IAErC,sBAAsB;IACtB,MAAM,QAAQ,GAAqB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvD,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAqB,CAAC,GAAI,QAAQ,CAAC,CAAC;IACpD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,8BAA8B;IAC9B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAEtD,kDAAkD;IAClD,SAAS,cAAc,CAAC,KAAa,EAAE,KAAa;QAChD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACb,SAAS;YACb,CAAC;YAED,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC;YAE1B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACtB,YAAY,EAAE,CAAC;gBACnB,CAAC;YACL,CAAC;QACL,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,cAAc,EAAE,CAAC;gBACjB,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC;YACnC,CAAC;QACL,CAAC;QAED,0BAA0B;QAC1B,MAAM,IAAI,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,qCAAqC;IACrC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAEhE,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM,GAAG,CAAC,CAAC;oBACX,MAAM,GAAG,CAAC,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzB,SAAS;QACb,CAAC;QAED,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,QAAQ,CAAC,OAAO,EAAE,GAAI,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC9D,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,CAAC,OAAO,EAAE,gCAAgC;YACpD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC;SACzD,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACpC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,yBAAyB;QACzB,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,wCAAwC;IACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEzB,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC"}
+{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/clustering/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH;;GAEG;AACH,SAAS,mBAAmB,CAAC,KAAY;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEjD,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,YAAY;IACZ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,SAAS,EAAE,CAAC;YACZ,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;QAED,0CAA0C;QAC1C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,SAAS,EAAE,CAAC;gBACZ,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAqBD;;GAEG;AACH,SAAS,oBAAoB,CACzB,KAAqB,EACrB,SAAiC;IAEjC,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;QAClC,MAAM,KAAK,GAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACR,SAAS;YACb,CAAC;YAED,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElC,IAAI,SAAS,EAAE,CAAC;gBACZ,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACtB,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACpB,QAAwB,EACxB,QAAwB,EACxB,SAAiC,EACjC,OAAsB;IAEtB,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnC,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,EAAE,CAAC;YAClB,SAAS;QACb,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACrB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,QAAQ,OAAO,EAAE,CAAC;QACd,KAAK,QAAQ;YACT,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,KAAK,UAAU;YACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;QACtC,KAAK,SAAS;YACV,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzE,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,8DAA8D;YAC9D,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;YACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;YACpC,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9E,OAAO,OAAO,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QACzD,CAAC;QACD;YACI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,YAAY,CAAC,CAAC;IAC1C,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAC/B,KAAqB,EACrB,UAAyB,QAAQ;IAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAEvC,qDAAqD;IACrD,MAAM,QAAQ,GAAqB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvD,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAqB,CAAC,GAAI,QAAQ,CAAC,CAAC;IACpD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,mCAAmC;IACnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEhE,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,SAAS;QACb,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACZ,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,kBAAkB;IAClB,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEzC,wCAAwC;IACxC,OAAO,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,gCAAgC;QAChC,IAAI,OAAO,GAAG,QAAQ,CAAC;QACvB,IAAI,aAAa,GAA0B,IAAI,CAAC;QAChD,IAAI,aAAa,GAA0B,IAAI,CAAC;QAEhD,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,SAAS;YACb,CAAC;YAED,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAC7B,SAAS;gBACb,CAAC;gBAED,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACnD,QAAQ,CAAC;gBAEb,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,aAAa,GAAG,QAAQ,CAAC;oBACzB,aAAa,GAAG,QAAQ,CAAC;gBAC7B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3D,uCAAuC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACzC,MAAM,UAAU,GAAmB;gBAC/B,EAAE,EAAE,UAAU,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;gBACtC,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC;gBACvB,QAAQ,EAAE,QAAQ;gBAClB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;gBACpD,KAAK;aACR,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,cAAc,CAAC,KAAK,EAAE,CAAC;YACvB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC/B,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,UAAU,GAAmB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,aAAa,CAAC,OAAO,EAAE,GAAI,aAAa,CAAC,OAAO,CAAC,CAAC;YACxE,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,aAAa;YACpB,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC;SACnE,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,kCAAkC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACnC,IAAI,OAAO,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,EAAE,CAAC;gBACrE,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACtE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAEjC,2BAA2B;YAC3B,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxD,IAAI,cAAc,EAAE,CAAC;gBACjB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC5C,CAAC;QACL,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAEhD,yBAAyB;QACzB,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC1C,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAE1C,sBAAsB;QACtB,KAAK,MAAM,OAAO,IAAI,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YACjC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACnC,CAAC;IAED,qCAAqC;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEzG,yCAAyC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEpD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CACzB,IAAoB,EACpB,MAAc;IAEd,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,SAAS,QAAQ,CAAC,IAAoB;QAClC,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,sBAAsB;gBACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACZ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,CAAC;gBAED,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAClC,IAAoB,EACpB,CAAS;IAET,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,qCAAqC;IACrC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IAEvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,QAAQ,CAAC;QACpB,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC;QACf,CAAC;aAAM,CAAC;YACJ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACL,CAAC;IAED,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gCAAgC,CAC5C,KAAY;IAEZ,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,kBAAkB;IAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,YAAY,EAAE,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAClC,UAAU,IAAI,SAAS,CAAC,IAAI,CAAC;IACjC,CAAC;IAED,wBAAwB;IACxB,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;IAE5B,sBAAsB;IACtB,MAAM,QAAQ,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5D,EAAE,EAAE,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE;QACvB,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,QAAQ,EAAE,CAAC;QACX,MAAM,EAAE,CAAC;KACZ,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAA0B,CAAC,GAAI,QAAQ,CAAC,CAAC;IACzD,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,kBAAkB;IAClB,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEzC,wBAAwB;IACxB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAErD,0CAA0C;IAC1C,OAAO,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QACxB,IAAI,aAAa,GAA+B,IAAI,CAAC;QACrD,IAAI,aAAa,GAA+B,IAAI,CAAC;QAErD,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACpC,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAC7B,SAAS;gBACb,CAAC;gBAED,4BAA4B;gBAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,IAAI,aAAa,GAAG,CAAC,CAAC;gBAEtB,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAExC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;wBACnC,IAAI,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BACxB,YAAY,EAAE,CAAC;wBACnB,CAAC;wBAED,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBACxC,aAAa,IAAI,OAAO,GAAG,OAAO,CAAC;oBACvC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC;oBACpC,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC;gBAEpD,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACjB,OAAO,GAAG,IAAI,CAAC;oBACf,aAAa,GAAG,QAAQ,CAAC;oBACzB,aAAa,GAAG,QAAQ,CAAC;gBAC7B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;YACnC,MAAM;QACV,CAAC;QAED,qBAAqB;QACrB,MAAM,UAAU,GAAwB;YACpC,EAAE,EAAE,WAAW,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAI,aAAa,CAAC,OAAO,EAAE,GAAI,aAAa,CAAC,OAAO,CAAC,CAAC;YACxE,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,aAAa;YACpB,QAAQ,EAAE,CAAC,OAAO,EAAE,gCAAgC;YACpD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC;SACnE,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE5B,yBAAyB;QACzB,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACrC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACnC,CAAC;IAED,qCAAqC;IACrC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEhF,yCAAyC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEzD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO;YACH,IAAI,EAAE,EAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC;YAC/D,UAAU,EAAE,EAAE;YACd,QAAQ,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;IACN,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,OAAO;QACH,IAAI;QACJ,UAAU;QACV,QAAQ,EAAE,eAAe;KAC5B,CAAC;AACN,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,sBAAsB,CAClC,KAAY,EACZ,UAAyB,QAAQ;IAEjC,gDAAgD;IAChD,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAChD,OAAO,0BAA0B,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC"}

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

@@ -1,5 +1,7 @@
-export * from "./hierarchical.js";
-export * from "./k-core.js";
+export type { ClusterNode, HierarchicalClusteringResult, LinkageMethod } from "./hierarchical.js";
+export { hierarchicalClustering } from "./hierarchical.js";
+export type { KCoreResult } from "./k-core.js";
+export { getKCore, kCoreDecomposition } from "./k-core.js";
 export type { MCLOptions, MCLResult } from "./mcl.js";
 export { calculateMCLModularity, markovClustering } from "./mcl.js";
 export type { SpectralClusteringOptions, SpectralClusteringResult } from "./spectral.js";