@graphty/algorithms 2.1.2 → 2.2.0

package/dist/src/research/grsbm.js

@@ -1,4 +1,15 @@
-import { SeededRandom } from "../utils/math-utilities.js";
+/**
+ * GRSBM (Greedy Recursive Spectral Bisection with Modularity) over a legacy `Graph`. `grsbm`
+ * delegates to `indexed.grsbm` over an unweighted snapshot of the graph, counting edges as the old
+ * code did, and rebuilds the cluster tree, labels and explanations; the result equals the
+ * pre-migration implementation in `grsbm-legacy.ts` exactly. A graph with a self-loop keeps the old
+ * code: the port counts a self-loop twice in the degree, the old code once. Unlike the old code the
+ * port never replaces `Math.random`.
+ */
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { grsbm as indexedGrsbm } from "../indexed/grsbm.js";
+import { toTopologySnapshot } from "../indexed/to-snapshot.js";
+import { grsbm as legacyGrsbm, } from "./grsbm-legacy.js";
 /**
  * GRSBM - Greedy Recursive Spectral Bisection with Modularity
  *
@@ -12,405 +23,70 @@ import { SeededRandom } from "../utils/math-utilities.js";
  * @returns Hierarchical clustering result with explanations
  */
 export function grsbm(graph, config = {}) {
-    const { maxDepth = 10, minClusterSize = 2, // Reduced default to allow more splits
-    numEigenvectors = 2, tolerance = 1e-6, maxIterations = 100, seed = 42, } = config;
-    // Set random seed for reproducibility
-    const rng = SeededRandom.createGenerator(seed);
-    const originalRandom = Math.random;
-    Math.random = rng;
-    const nodes = Array.from(graph.nodes());
-    const nodeCount = nodes.length;
-    if (nodeCount === 0) {
-        throw new Error("Cannot cluster empty graph");
-    }
-    // Initialize root cluster with all nodes
-    const rootMembers = new Set(nodes.map((node) => node.id));
-    const initialModularity = calculateModularity(graph, new Map([...rootMembers].map((id) => [id, 0])));
-    const root = {
-        id: "root",
-        members: rootMembers,
-        modularity: initialModularity,
-        depth: 0,
-        spectralScore: 0,
-    };
-    const explanations = [];
-    const modularityScores = [initialModularity];
-    // Perform recursive bisection
-    const clusterQueue = [root];
-    let nextClusterId = 1;
-    while (clusterQueue.length > 0) {
-        const currentCluster = clusterQueue.shift();
-        if (!currentCluster) {
-            continue;
-        }
-        // Check stopping criteria
-        if (currentCluster.depth >= maxDepth || currentCluster.members.size < minClusterSize * 2) {
-            continue;
-        }
-        // Attempt spectral bisection
-        const bisectionResult = spectralBisection(graph, currentCluster, numEigenvectors, tolerance, maxIterations);
-        if (!bisectionResult) {
-            continue; // Could not split this cluster
-        }
-        const { leftMembers, rightMembers, spectralScore, keyNodes, spectralValues, reason } = bisectionResult;
-        // Create child clusters
-        const leftCluster = {
-            id: `cluster_${String(nextClusterId++)}`,
-            members: leftMembers,
-            modularity: 0, // Will be calculated below
-            depth: currentCluster.depth + 1,
-            spectralScore,
-        };
-        const rightCluster = {
-            id: `cluster_${String(nextClusterId++)}`,
-            members: rightMembers,
-            modularity: 0, // Will be calculated below
-            depth: currentCluster.depth + 1,
-            spectralScore,
+    const s = toTopologySnapshot(graph);
+    if (s.selfLoopCount > 0) {
+        return legacyGrsbm(graph, config);
+    }
+    // numEigenvectors was never read by the old code either.
+    const { maxDepth, minClusterSize, tolerance, maxIterations, seed } = config;
+    const r = indexedGrsbm(s, { maxDepth, minClusterSize, tolerance, maxIterations, seed, weighted: false });
+    const idOf = (i) => s.ids.idOf(i);
+    const name = (serial) => (serial === 0 ? "root" : `cluster_${String(serial)}`);
+    const build = (c) => {
+        const cluster = r.clusters[c];
+        const out = {
+            id: name(cluster.serial),
+            members: new Set(Array.from(cluster.members, idOf)),
+            modularity: cluster.modularity,
+            depth: cluster.depth,
+            spectralScore: cluster.spectralScore,
         };
-        // Calculate modularity improvement
-        const newAssignment = new Map();
-        for (const nodeId of leftMembers) {
-            newAssignment.set(nodeId, 0);
-        }
-        for (const nodeId of rightMembers) {
-            newAssignment.set(nodeId, 1);
-        }
-        const newModularity = calculateModularity(graph, newAssignment);
-        const modularityImprovement = newModularity - currentCluster.modularity;
-        // Only split if modularity improves or is neutral (allow small splits)
-        if (modularityImprovement >= -0.01) {
-            // Small tolerance for neutral splits
-            leftCluster.modularity = newModularity;
-            rightCluster.modularity = newModularity;
-            currentCluster.left = leftCluster;
-            currentCluster.right = rightCluster;
-            // Add explanation
-            explanations.push({
-                clusterId: currentCluster.id,
-                reason,
-                modularityImprovement,
-                keyNodes,
-                spectralValues,
-            });
-            modularityScores.push(newModularity);
-            // Add children to queue for further processing
-            clusterQueue.push(leftCluster, rightCluster);
+        if (cluster.left !== INVALID_INDEX) {
+            out.left = build(cluster.left);
+            out.right = build(cluster.right);
         }
-    }
-    // Extract flat clustering from leaf nodes
+        return out;
+    };
+    // The old labels number the leaves left to right, an emptied leaf included.
     const clusters = new Map();
-    let clusterId = 0;
-    function assignClusterIds(cluster) {
-        if (!cluster.left && !cluster.right) {
-            // Leaf node
-            for (const nodeId of cluster.members) {
-                clusters.set(nodeId, clusterId);
+    let leaves = 0;
+    const walk = (c) => {
+        const cluster = r.clusters[c];
+        if (cluster.left === INVALID_INDEX) {
+            for (const i of cluster.members) {
+                clusters.set(idOf(i), leaves);
             }
-            clusterId++;
+            leaves++;
         }
         else {
-            // Internal node - traverse children
-            if (cluster.left) {
-                assignClusterIds(cluster.left);
-            }
-            if (cluster.right) {
-                assignClusterIds(cluster.right);
-            }
+            walk(cluster.left);
+            walk(cluster.right);
         }
-    }
-    assignClusterIds(root);
-    // Restore original random function
-    Math.random = originalRandom;
-    return {
-        root,
-        clusters,
-        numClusters: clusterId,
-        modularityScores,
-        explanation: explanations,
     };
-}
-/**
- * Perform spectral bisection on a cluster
- * @param graph - The input graph
- * @param cluster - The cluster to bisect
- * @param _numEigenvectors - Number of eigenvectors to compute (reserved for future use)
- * @param tolerance - Convergence tolerance
- * @param maxIterations - Maximum number of iterations
- * @returns Bisection result with left/right members, scores, and explanation, or null if bisection failed
- */
-function spectralBisection(graph, cluster, _numEigenvectors, tolerance, maxIterations) {
-    const members = Array.from(cluster.members);
-    const n = members.length;
-    if (n < 4) {
-        return null; // Too small to split meaningfully
-    }
-    // Create subgraph Laplacian matrix
-    const laplacian = createLaplacianMatrix(graph, members);
-    // Compute the second smallest eigenvector (Fiedler vector)
-    const eigenvector = computeFiedlerVector(laplacian, tolerance, maxIterations);
-    if (!eigenvector) {
-        return null; // Could not compute eigenvector
-    }
-    // Find optimal split point
-    const sortedIndices = eigenvector.map((value, index) => ({ value, index })).sort((a, b) => a.value - b.value);
-    let bestSplitIndex = Math.floor(n / 2);
-    let bestModularity = -Infinity;
-    // Try different split points
-    for (let splitIndex = Math.floor(n * 0.2); splitIndex <= Math.floor(n * 0.8); splitIndex++) {
-        const leftIndices = sortedIndices.slice(0, splitIndex).map((item) => item.index);
-        const rightIndices = sortedIndices.slice(splitIndex).map((item) => item.index);
-        const assignment = new Map();
-        for (const idx of leftIndices) {
-            const nodeId = members[idx];
-            if (nodeId !== undefined) {
-                assignment.set(nodeId, 0);
-            }
-        }
-        for (const idx of rightIndices) {
-            const nodeId = members[idx];
-            if (nodeId !== undefined) {
-                assignment.set(nodeId, 1);
-            }
-        }
-        const modularity = calculateModularity(graph, assignment);
-        if (modularity > bestModularity) {
-            bestModularity = modularity;
-            bestSplitIndex = splitIndex;
-        }
-    }
-    // Create final split
-    const leftIndices = sortedIndices.slice(0, bestSplitIndex).map((item) => item.index);
-    const rightIndices = sortedIndices.slice(bestSplitIndex).map((item) => item.index);
-    const leftMembers = new Set();
-    const rightMembers = new Set();
-    for (const idx of leftIndices) {
-        const nodeId = members[idx];
-        if (nodeId !== undefined) {
-            leftMembers.add(nodeId);
-        }
-    }
-    for (const idx of rightIndices) {
-        const nodeId = members[idx];
-        if (nodeId !== undefined) {
-            rightMembers.add(nodeId);
-        }
-    }
-    // Identify key nodes (those with extreme spectral values)
-    const extremeThreshold = 0.1;
-    const sortedValues = [...eigenvector].sort((a, b) => Math.abs(b) - Math.abs(a));
-    const threshold = sortedValues[Math.floor(sortedValues.length * extremeThreshold)] ?? 0;
-    const keyNodes = [];
-    for (let i = 0; i < eigenvector.length; i++) {
-        const eigenValue = eigenvector[i];
-        if (eigenValue !== undefined && Math.abs(eigenValue) >= Math.abs(threshold)) {
-            const nodeId = members[i];
-            if (nodeId !== undefined) {
-                keyNodes.push(nodeId);
-            }
-        }
-    }
-    // Calculate spectral score (based on eigenvalue gap)
-    const firstValue = sortedValues[0] ?? 0;
-    const lastValue = sortedValues[sortedValues.length - 1] ?? 0;
-    const spectralScore = Math.abs(firstValue - lastValue);
-    // Generate explanation
-    const reason = `Spectral bisection based on Fiedler vector with modularity ${bestModularity.toFixed(3)}. Split creates clusters of sizes ${String(leftMembers.size)} and ${String(rightMembers.size)}.`;
+    walk(0);
+    const explanation = r.clusters.flatMap((cluster) => {
+        const { split } = cluster;
+        if (split === null) {
+            return [];
+        }
+        const left = r.clusters[cluster.left];
+        const right = r.clusters[cluster.right];
+        return [
+            {
+                clusterId: name(cluster.serial),
+                reason: `Spectral bisection based on Fiedler vector with modularity ${split.bisectionModularity.toFixed(3)}. Split creates clusters of sizes ${String(left.members.length)} and ${String(right.members.length)}.`,
+                modularityImprovement: split.improvement,
+                keyNodes: Array.from(split.keyNodes, idOf),
+                spectralValues: Array.from(split.spectralValues),
+            },
+        ];
+    });
     return {
-        leftMembers,
-        rightMembers,
-        spectralScore,
-        keyNodes: keyNodes.slice(0, 5), // Top 5 key nodes
-        spectralValues: eigenvector,
-        reason,
+        root: build(0),
+        clusters,
+        numClusters: leaves,
+        modularityScores: Array.from(r.modularityScores),
+        explanation,
     };
 }
-/**
- * Create Laplacian matrix for a subgraph
- * @param graph - The input graph
- * @param nodes - The nodes to include in the subgraph
- * @returns The Laplacian matrix as a 2D array
- */
-function createLaplacianMatrix(graph, nodes) {
-    const n = nodes.length;
-    const nodeIndex = new Map();
-    // Create node index mapping
-    for (let i = 0; i < n; i++) {
-        const node = nodes[i];
-        if (node !== undefined) {
-            nodeIndex.set(node, i);
-        }
-    }
-    // Initialize Laplacian matrix
-    const laplacian = Array.from({ length: n }, () => new Array(n).fill(0));
-    // Fill adjacency part and calculate degrees
-    const degrees = new Array(n).fill(0);
-    for (let i = 0; i < n; i++) {
-        const nodeId = nodes[i];
-        if (nodeId === undefined) {
-            continue;
-        }
-        for (const neighbor of graph.neighbors(nodeId)) {
-            const neighborIdx = nodeIndex.get(neighbor);
-            if (neighborIdx !== undefined && i < laplacian.length && i < degrees.length) {
-                const row = laplacian[i];
-                if (row) {
-                    row[neighborIdx] = -1;
-                    degrees[i] = (degrees[i] ?? 0) + 1;
-                }
-            }
-        }
-    }
-    // Set diagonal (degree) values
-    for (let i = 0; i < n; i++) {
-        const row = laplacian[i];
-        const degree = degrees[i];
-        if (row && degree !== undefined) {
-            row[i] = degree;
-        }
-    }
-    return laplacian;
-}
-/**
- * Compute the Fiedler vector (second smallest eigenvector) using power iteration
- * @param laplacian - The Laplacian matrix
- * @param tolerance - Convergence tolerance
- * @param maxIterations - Maximum number of iterations
- * @returns The Fiedler vector, or null if computation failed
- */
-function computeFiedlerVector(laplacian, tolerance, maxIterations) {
-    const n = laplacian.length;
-    if (n < 2) {
-        return null;
-    }
-    // Initialize random vector orthogonal to the all-ones vector
-    let vector = new Array(n).fill(0);
-    for (let i = 0; i < n; i++) {
-        vector[i] = Math.random() - 0.5;
-    }
-    // Make orthogonal to all-ones vector
-    const mean = vector.reduce((sum, val) => sum + val, 0) / n;
-    for (let i = 0; i < n; i++) {
-        const val = vector[i];
-        if (val !== undefined) {
-            vector[i] = val - mean;
-        }
-    }
-    // Normalize
-    const norm = Math.sqrt(vector.reduce((sum, val) => sum + val * val, 0));
-    if (norm > 0) {
-        for (let i = 0; i < n; i++) {
-            const val = vector[i];
-            if (val !== undefined) {
-                vector[i] = val / norm;
-            }
-        }
-    }
-    // Power iteration with deflation for second smallest eigenvalue
-    for (let iter = 0; iter < maxIterations; iter++) {
-        const newVector = new Array(n).fill(0);
-        // Matrix-vector multiplication: newVector = L * vector
-        for (let i = 0; i < n; i++) {
-            let sum = 0;
-            const row = laplacian[i];
-            if (row) {
-                for (let j = 0; j < n; j++) {
-                    const matrixVal = row[j];
-                    const vectorVal = vector[j];
-                    if (matrixVal !== undefined && vectorVal !== undefined) {
-                        sum += matrixVal * vectorVal;
-                    }
-                }
-            }
-            newVector[i] = sum;
-        }
-        // For smallest eigenvalue, we actually want inverse iteration
-        // This is simplified - in practice would solve (L - shift*I)x = vector
-        // For now, use power iteration on -L (approximately)
-        for (let i = 0; i < n; i++) {
-            const val = newVector[i];
-            if (val !== undefined) {
-                newVector[i] = -val;
-            }
-        }
-        // Orthogonalize against all-ones vector
-        const newMean = newVector.reduce((sum, val) => sum + val, 0) / n;
-        for (let i = 0; i < n; i++) {
-            const val = newVector[i];
-            if (val !== undefined) {
-                newVector[i] = val - newMean;
-            }
-        }
-        // Normalize
-        const newNorm = Math.sqrt(newVector.reduce((sum, val) => sum + val * val, 0));
-        if (newNorm < tolerance) {
-            break; // Converged to zero vector
-        }
-        for (let i = 0; i < n; i++) {
-            const val = newVector[i];
-            if (val !== undefined) {
-                newVector[i] = val / newNorm;
-            }
-        }
-        // Check convergence
-        let diff = 0;
-        for (let i = 0; i < n; i++) {
-            const newVal = newVector[i];
-            const oldVal = vector[i];
-            if (newVal !== undefined && oldVal !== undefined) {
-                diff += Math.abs(newVal - oldVal);
-            }
-        }
-        vector = newVector;
-        if (diff < tolerance) {
-            break;
-        }
-    }
-    return vector;
-}
-/**
- * Calculate modularity of a graph partitioning
- * @param graph - The input graph
- * @param assignment - Map from node ID to community ID
- * @returns The modularity score
- */
-function calculateModularity(graph, assignment) {
-    const totalEdges = graph.uniqueEdgeCount;
-    if (totalEdges === 0) {
-        return 0;
-    }
-    let modularity = 0;
-    const communities = new Map();
-    // Group nodes by community
-    for (const [nodeId, communityId] of assignment) {
-        if (!communities.has(communityId)) {
-            communities.set(communityId, new Set());
-        }
-        const community = communities.get(communityId);
-        if (community) {
-            community.add(nodeId);
-        }
-    }
-    // Calculate modularity for each community
-    for (const [, members] of communities) {
-        let internalEdges = 0;
-        let totalDegree = 0;
-        for (const nodeId of members) {
-            const nodeDegree = graph.degree(nodeId);
-            totalDegree += nodeDegree;
-            // Count internal edges
-            for (const neighbor of graph.neighbors(nodeId)) {
-                if (members.has(neighbor)) {
-                    internalEdges++;
-                }
-            }
-        }
-        // Each edge is counted twice in undirected graphs
-        internalEdges /= 2;
-        // Modularity contribution for this community
-        const expectedEdges = (totalDegree * totalDegree) / (4 * totalEdges);
-        modularity += (internalEdges - expectedEdges) / totalEdges;
-    }
-    return modularity;
-}
 //# sourceMappingURL=grsbm.js.map

package/dist/src/research/grsbm.js.map

@@ -1 +1 @@
-{"version":3,"file":"grsbm.js","sourceRoot":"","sources":["../../../src/research/grsbm.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAwE1D;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,KAAK,CAAC,KAAY,EAAE,SAAsB,EAAE;IACxD,MAAM,EACF,QAAQ,GAAG,EAAE,EACb,cAAc,GAAG,CAAC,EAAE,uCAAuC;IAC3D,eAAe,GAAG,CAAC,EACnB,SAAS,GAAG,IAAI,EAChB,aAAa,GAAG,GAAG,EACnB,IAAI,GAAG,EAAE,GACZ,GAAG,MAAM,CAAC;IAEX,sCAAsC;IACtC,MAAM,GAAG,GAAG,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IAElB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAE/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAClD,CAAC;IAED,yCAAyC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErG,MAAM,IAAI,GAAiB;QACvB,EAAE,EAAE,MAAM;QACV,OAAO,EAAE,WAAW;QACpB,UAAU,EAAE,iBAAiB;QAC7B,KAAK,EAAE,CAAC;QACR,aAAa,EAAE,CAAC;KACnB,CAAC;IAEF,MAAM,YAAY,GAAyB,EAAE,CAAC;IAC9C,MAAM,gBAAgB,GAAa,CAAC,iBAAiB,CAAC,CAAC;IAEvD,8BAA8B;IAC9B,MAAM,YAAY,GAAmB,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,cAAc,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC;QAC5C,IAAI,CAAC,cAAc,EAAE,CAAC;YAClB,SAAS;QACb,CAAC;QAED,0BAA0B;QAC1B,IAAI,cAAc,CAAC,KAAK,IAAI,QAAQ,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC;YACvF,SAAS;QACb,CAAC;QAED,6BAA6B;QAC7B,MAAM,eAAe,GAAG,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;QAE5G,IAAI,CAAC,eAAe,EAAE,CAAC;YACnB,SAAS,CAAC,+BAA+B;QAC7C,CAAC;QAED,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,eAAe,CAAC;QAEvG,wBAAwB;QACxB,MAAM,WAAW,GAAiB;YAC9B,EAAE,EAAE,WAAW,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE;YACxC,OAAO,EAAE,WAAW;YACpB,UAAU,EAAE,CAAC,EAAE,2BAA2B;YAC1C,KAAK,EAAE,cAAc,CAAC,KAAK,GAAG,CAAC;YAC/B,aAAa;SAChB,CAAC;QAEF,MAAM,YAAY,GAAiB;YAC/B,EAAE,EAAE,WAAW,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE;YACxC,OAAO,EAAE,YAAY;YACrB,UAAU,EAAE,CAAC,EAAE,2BAA2B;YAC1C,KAAK,EAAE,cAAc,CAAC,KAAK,GAAG,CAAC;YAC/B,aAAa;SAChB,CAAC;QAEF,mCAAmC;QACnC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YAC/B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,aAAa,GAAG,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAChE,MAAM,qBAAqB,GAAG,aAAa,GAAG,cAAc,CAAC,UAAU,CAAC;QAExE,uEAAuE;QACvE,IAAI,qBAAqB,IAAI,CAAC,IAAI,EAAE,CAAC;YACjC,qCAAqC;YACrC,WAAW,CAAC,UAAU,GAAG,aAAa,CAAC;YACvC,YAAY,CAAC,UAAU,GAAG,aAAa,CAAC;YAExC,cAAc,CAAC,IAAI,GAAG,WAAW,CAAC;YAClC,cAAc,CAAC,KAAK,GAAG,YAAY,CAAC;YAEpC,kBAAkB;YAClB,YAAY,CAAC,IAAI,CAAC;gBACd,SAAS,EAAE,cAAc,CAAC,EAAE;gBAC5B,MAAM;gBACN,qBAAqB;gBACrB,QAAQ;gBACR,cAAc;aACjB,CAAC,CAAC;YAEH,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAErC,+CAA+C;YAC/C,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QACjD,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,SAAS,gBAAgB,CAAC,OAAqB;QAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,YAAY;YACZ,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACpC,CAAC;YACD,SAAS,EAAE,CAAC;QAChB,CAAC;aAAM,CAAC;YACJ,oCAAoC;YACpC,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;gBACf,gBAAgB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnC,CAAC;YAED,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACpC,CAAC;QACL,CAAC;IACL,CAAC;IAED,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAEvB,mCAAmC;IACnC,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC;IAE7B,OAAO;QACH,IAAI;QACJ,QAAQ;QACR,WAAW,EAAE,SAAS;QACtB,gBAAgB;QAChB,WAAW,EAAE,YAAY;KAC5B,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,iBAAiB,CACtB,KAAY,EACZ,OAAqB,EACrB,gBAAwB,EACxB,SAAiB,EACjB,aAAqB;IASrB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IAEzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,IAAI,CAAC,CAAC,kCAAkC;IACnD,CAAC;IAED,mCAAmC;IACnC,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAExD,2DAA2D;IAC3D,MAAM,WAAW,GAAG,oBAAoB,CAAC,SAAS,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAE9E,IAAI,CAAC,WAAW,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,CAAC,gCAAgC;IACjD,CAAC;IAED,2BAA2B;IAC3B,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE9G,IAAI,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,cAAc,GAAG,CAAC,QAAQ,CAAC;IAE/B,6BAA6B;IAC7B,KAAK,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;QACzF,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjF,MAAM,YAAY,GAAG,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE/E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;QAED,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAE1D,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;YAC9B,cAAc,GAAG,UAAU,CAAC;YAC5B,cAAc,GAAG,UAAU,CAAC;QAChC,CAAC;IACL,CAAC;IAED,qBAAqB;IACrB,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrF,MAAM,YAAY,GAAG,aAAa,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEnF,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,0DAA0D;IAC1D,MAAM,gBAAgB,GAAG,GAAG,CAAC;IAC7B,MAAM,YAAY,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC;IAExF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,UAAU,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;IACL,CAAC;IAED,qDAAqD;IACrD,MAAM,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;IAEvD,uBAAuB;IACvB,MAAM,MAAM,GAAG,8DAA8D,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,qCAAqC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;IAExM,OAAO;QACH,WAAW;QACX,YAAY;QACZ,aAAa;QACb,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB;QAClD,cAAc,EAAE,WAAW;QAC3B,MAAM;KACT,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,KAAY,EAAE,KAAe;IACxD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE5C,4BAA4B;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAED,8BAA8B;IAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhF,4CAA4C;IAC5C,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,SAAS;QACb,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC1E,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,GAAG,EAAE,CAAC;oBACN,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACvC,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACpB,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,SAAqB,EAAE,SAAiB,EAAE,aAAqB;IACzF,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,6DAA6D;IAC7D,IAAI,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;IACpC,CAAC;IAED,qCAAqC;IACrC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;QAC3B,CAAC;IACL,CAAC;IAED,YAAY;IACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACxF,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;YAC3B,CAAC;QACL,CAAC;IACL,CAAC;IAED,gEAAgE;IAChE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9C,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE/C,uDAAuD;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,EAAE,CAAC;gBACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzB,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBACzB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;wBACrD,GAAG,IAAI,SAAS,GAAG,SAAS,CAAC;oBACjC,CAAC;gBACL,CAAC;YACL,CAAC;YAED,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACvB,CAAC;QAED,8DAA8D;QAC9D,uEAAuE;QACvE,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YACxB,CAAC;QACL,CAAC;QAED,wCAAwC;QACxC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,OAAO,CAAC;YACjC,CAAC;QACL,CAAC;QAED,YAAY;QACZ,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;YACtB,MAAM,CAAC,2BAA2B;QACtC,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,OAAO,CAAC;YACjC,CAAC;QACL,CAAC;QAED,oBAAoB;QACpB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC/C,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;QAED,MAAM,GAAG,SAAS,CAAC;QAEnB,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;YACnB,MAAM;QACV,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,KAAY,EAAE,UAA+B;IACtE,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,CAAC;IACzC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACb,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEnD,2BAA2B;IAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,UAAU,EAAE,CAAC;QAC7C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAChC,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC/C,IAAI,SAAS,EAAE,CAAC;YACZ,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACxC,WAAW,IAAI,UAAU,CAAC;YAE1B,uBAAuB;YACvB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxB,aAAa,EAAE,CAAC;gBACpB,CAAC;YACL,CAAC;QACL,CAAC;QAED,kDAAkD;QAClD,aAAa,IAAI,CAAC,CAAC;QAEnB,6CAA6C;QAC7C,MAAM,aAAa,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACrE,UAAU,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,UAAU,CAAC;IAC/D,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC"}
+{"version":3,"file":"grsbm.js","sourceRoot":"","sources":["../../../src/research/grsbm.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAGtD,OAAO,EAAE,KAAK,IAAI,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/D,OAAO,EAEH,KAAK,IAAI,WAAW,GAIvB,MAAM,mBAAmB,CAAC;AAI3B;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,KAAK,CAAC,KAAY,EAAE,SAAsB,EAAE;IACxD,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,CAAC,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;QACtB,OAAO,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,yDAAyD;IACzD,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;IAC5E,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACzG,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAE/F,MAAM,KAAK,GAAG,CAAC,CAAS,EAAgB,EAAE;QACtC,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAiB;YACtB,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YACxB,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACnD,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,aAAa,EAAE,OAAO,CAAC,aAAa;SACvC,CAAC;QACF,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACjC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC,CAAC;IAEF,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,IAAI,GAAG,CAAC,CAAS,EAAQ,EAAE;QAC7B,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;gBAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAClC,CAAC;YACD,MAAM,EAAE,CAAC;QACb,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;IACL,CAAC,CAAC;IACF,IAAI,CAAC,CAAC,CAAC,CAAC;IAER,MAAM,WAAW,GAAyB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QACrE,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;QAC1B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACjB,OAAO,EAAE,CAAC;QACd,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO;YACH;gBACI,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;gBAC/B,MAAM,EAAE,8DAA8D,KAAK,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,qCAAqC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG;gBACjN,qBAAqB,EAAE,KAAK,CAAC,WAAW;gBACxC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC;gBAC1C,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC;aACnD;SACJ,CAAC;IACN,CAAC,CAAC,CAAC;IAEH,OAAO;QACH,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QACd,QAAQ;QACR,WAAW,EAAE,MAAM;QACnB,gBAAgB,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC;QAChD,WAAW;KACd,CAAC;AACN,CAAC"}

package/dist/src/research/sync-legacy.d.ts

@@ -0,0 +1,48 @@
+import type { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+/**
+ * Configuration options for the SynC (Synergistic Deep Graph Clustering) algorithm
+ */
+export interface SynCConfig {
+    /** Number of clusters to find */
+    numClusters: number;
+    /** Maximum number of iterations for convergence */
+    maxIterations?: number;
+    /** Convergence tolerance */
+    tolerance?: number;
+    /** Random seed for reproducibility */
+    seed?: number;
+    /** Learning rate for optimization */
+    learningRate?: number;
+    /** Regularization parameter */
+    lambda?: number;
+}
+/**
+ * Result of the SynC clustering algorithm
+ */
+export interface SynCResult {
+    /** Cluster assignments for each node */
+    clusters: Map<NodeId, number>;
+    /** Final loss value */
+    loss: number;
+    /** Number of iterations performed */
+    iterations: number;
+    /** Node embeddings learned by the algorithm */
+    embeddings: Map<NodeId, number[]>;
+    /** Whether the algorithm converged */
+    converged: boolean;
+}
+/**
+ * Synergistic Deep Graph Clustering (SynC) Algorithm
+ *
+ * This algorithm combines representation learning with structure augmentation
+ * for improved clustering performance on graphs. It jointly optimizes node
+ * embeddings and cluster assignments while preserving graph structure.
+ *
+ * Based on: "Synergistic Deep Graph Clustering" (arXiv:2406.15797, June 2024)
+ * @param graph - Input graph to cluster
+ * @param config - Configuration options
+ * @returns Clustering result with assignments and embeddings
+ */
+export declare function syncClustering(graph: Graph, config: SynCConfig): SynCResult;
+//# sourceMappingURL=sync-legacy.d.ts.map

package/dist/src/research/sync-legacy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync-legacy.d.ts","sourceRoot":"","sources":["../../../src/research/sync-legacy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4BAA4B;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qCAAqC;IACrC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,+BAA+B;IAC/B,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,wCAAwC;IACxC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,uBAAuB;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAClC,sCAAsC;IACtC,SAAS,EAAE,OAAO,CAAC;CACtB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,GAAG,UAAU,CA8H3E"}