@graphty/algorithms 1.1.0 → 1.2.0

package/dist/src/research/grsbm.js

@@ -0,0 +1,411 @@
+/**
+ * GRSBM - Greedy Recursive Spectral Bisection with Modularity
+ *
+ * This algorithm performs hierarchical community detection using spectral
+ * bisection guided by modularity optimization. It provides explainable
+ * community structure by tracking the reasoning behind each split.
+ *
+ * Based on: "Explainable Community Detection via Hierarchical Spectral Clustering" (2024)
+ *
+ * @param graph - Input graph to cluster
+ * @param config - Configuration options
+ * @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
+    Math.random = seedRandom(seed);
+    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,
+        };
+        // 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);
+        }
+    }
+    // Extract flat clustering from leaf nodes
+    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);
+            }
+            clusterId++;
+        }
+        else {
+            // Internal node - traverse children
+            if (cluster.left) {
+                assignClusterIds(cluster.left);
+            }
+            if (cluster.right) {
+                assignClusterIds(cluster.right);
+            }
+        }
+    }
+    assignClusterIds(root);
+    return {
+        root,
+        clusters,
+        numClusters: clusterId,
+        modularityScores,
+        explanation: explanations,
+    };
+}
+/**
+ * Perform spectral bisection on a cluster
+ */
+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)}.`;
+    return {
+        leftMembers,
+        rightMembers,
+        spectralScore,
+        keyNodes: keyNodes.slice(0, 5), // Top 5 key nodes
+        spectralValues: eigenvector,
+        reason,
+    };
+}
+/**
+ * Create Laplacian matrix for a subgraph
+ */
+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
+ */
+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
+ */
+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;
+}
+/**
+ * Simple seeded random number generator for reproducibility
+ */
+function seedRandom(seed) {
+    const m = 0x80000000; // 2**31
+    const a = 1103515245;
+    const c = 12345;
+    seed = seed % m;
+    return function () {
+        seed = ((a * seed) + c) % m;
+        return seed / (m - 1);
+    };
+}
+//# sourceMappingURL=grsbm.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"grsbm.js","sourceRoot":"","sources":["../../../src/research/grsbm.ts"],"names":[],"mappings":"AAyEA;;;;;;;;;;;;GAYG;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,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAE/B,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,GAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtG,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;YAChC,cAAc,CAAC,OAAO,CAAC,IAAI,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC;YACnD,SAAS;QACb,CAAC;QAED,6BAA6B;QAC7B,MAAM,eAAe,GAAG,iBAAiB,CACrC,KAAK,EACL,cAAc,EACd,eAAe,EACf,SAAS,EACT,aAAa,CAChB,CAAC;QAEF,IAAI,CAAC,eAAe,EAAE,CAAC;YACnB,SAAS,CAAC,+BAA+B;QAC7C,CAAC;QAED,MAAM,EAAC,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAC,GAAG,eAAe,CAAC;QAErG,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,CAAC,qCAAqC;YACvE,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,OAAO;QACH,IAAI;QACJ,QAAQ;QACR,WAAW,EAAE,SAAS;QACtB,gBAAgB;QAChB,WAAW,EAAE,YAAY;KAC5B,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CACtB,KAAY,EACZ,OAAqB,EACrB,eAAuB,EACvB,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;SAC5B,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,KAAK,EAAC,CAAC,CAAC;SACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvC,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,GAAI,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;IACjF,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;;GAEG;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,EAAC,MAAM,EAAE,CAAC,EAAC,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9E,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;;GAEG;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,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1F,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,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,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;;GAEG;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;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,IAAY;IAC5B,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,QAAQ;IAC9B,MAAM,CAAC,GAAG,UAAU,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC;IAEhB,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;IAEhB,OAAO;QACH,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC;AACN,CAAC"}

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

@@ -0,0 +1,12 @@
+/**
+ * Priority 4 Research Algorithms (2023-2025)
+ *
+ * This module contains cutting-edge graph algorithms based on recent research
+ * from 2023-2025, focusing on deep learning integration, scalable algorithms,
+ * and explainable community detection.
+ */
+export { syncClustering, type SynCConfig, type SynCResult } from "./sync.js";
+export { teraHAC, type TeraHACConfig, type TeraHACResult } from "./terahac.js";
+export { type ClusterNode as TeraHACClusterNode } from "./terahac.js";
+export { type ClusterExplanation, grsbm, type GRSBMCluster, type GRSBMConfig, type GRSBMResult } from "./grsbm.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/research/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/research/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAC,cAAc,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU,EAAC,MAAM,WAAW,CAAC;AAG3E,OAAO,EAAC,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,aAAa,EAAC,MAAM,cAAc,CAAC;AAC7E,OAAO,EAAC,KAAK,WAAW,IAAI,kBAAkB,EAAC,MAAM,cAAc,CAAC;AAGpE,OAAO,EAAC,KAAK,kBAAkB,EAAE,KAAK,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAC,MAAM,YAAY,CAAC"}

package/dist/src/research/index.js

@@ -0,0 +1,14 @@
+/**
+ * Priority 4 Research Algorithms (2023-2025)
+ *
+ * This module contains cutting-edge graph algorithms based on recent research
+ * from 2023-2025, focusing on deep learning integration, scalable algorithms,
+ * and explainable community detection.
+ */
+// Synergistic Deep Graph Clustering
+export { syncClustering } from "./sync.js";
+// TeraHAC - Hierarchical Agglomerative Clustering
+export { teraHAC } from "./terahac.js";
+// GRSBM - Greedy Recursive Spectral Bisection with Modularity
+export { grsbm } from "./grsbm.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/research/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,oCAAoC;AACpC,OAAO,EAAC,cAAc,EAAmC,MAAM,WAAW,CAAC;AAE3E,kDAAkD;AAClD,OAAO,EAAC,OAAO,EAAyC,MAAM,cAAc,CAAC;AAG7E,8DAA8D;AAC9D,OAAO,EAA0B,KAAK,EAAwD,MAAM,YAAY,CAAC"}

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

@@ -0,0 +1,49 @@
+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.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sync.d.ts","sourceRoot":"","sources":["../../../src/research/sync.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AAC5C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAE9C;;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;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,GAAG,UAAU,CAkI3E"}