@graphty/algorithms 1.4.2 → 1.5.0

package/README.md

@@ -1,10 +1,11 @@
 # @graphty/algorithms
 
-[![Build Status](https://github.com/graphty-org/algorithms/actions/workflows/test.yml/badge.svg)](https://github.com/graphty-org/algorithms/actions/workflows/test.yml)
-[![Coverage Status](https://coveralls.io/repos/github/graphty-org/algorithms/badge.svg)](https://coveralls.io/github/graphty-org/algorithms)
+[![CI](https://github.com/graphty-org/graphty-monorepo/actions/workflows/ci.yml/badge.svg)](https://github.com/graphty-org/graphty-monorepo/actions/workflows/ci.yml)
+[![Coverage Status](https://coveralls.io/repos/github/graphty-org/graphty-monorepo/badge.svg?branch=master)](https://coveralls.io/github/graphty-org/graphty-monorepo?branch=master)
 [![npm version](https://img.shields.io/npm/v/@graphty/algorithms.svg)](https://www.npmjs.com/package/@graphty/algorithms)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
-[![Examples](https://img.shields.io/badge/demo-github%20pages-blue)](https://graphty-org.github.io/algorithms/)
+[![Documentation](https://img.shields.io/badge/docs-vitepress-blue)](https://graphty.app/docs/algorithms/)
+[![Examples](https://img.shields.io/badge/demo-github%20pages-blue)](https://graphty.app/algorithms/)
 
 A comprehensive TypeScript graph algorithms library with 98 algorithms optimized for browser environments and visualization applications.
 
@@ -14,8 +15,8 @@ A comprehensive TypeScript graph algorithms library with 98 algorithms optimized
 - **Browser-optimized**: Designed to run efficiently in web browsers
 - **Modular**: Import only the algorithms you need
 - **Comprehensive**: 98 graph algorithms including traversal, shortest paths, centrality, clustering, flow, matching, link prediction, and more
-- **Interactive Examples**: [Live demos](https://graphty-org.github.io/algorithms/) with visualizations for all algorithms
-- **Performance Analysis**: [Detailed benchmarks](https://graphty-org.github.io/algorithms/benchmarks/) comparing algorithm performance
+- **Interactive Examples**: [Live demos](https://graphty.app/algorithms/) with visualizations for all algorithms
+- **Performance Analysis**: [Detailed benchmarks](https://graphty.app/algorithms/benchmarks/) comparing algorithm performance
 - **Well-tested**: Extensive test suite with high coverage
 - **Standards-compliant**: Follows conventional commits and semantic versioning
 
@@ -1027,12 +1028,12 @@ const result = grsbm(graph, {
 
 ## Interactive Examples
 
-Try out all algorithms with interactive visualizations: **[Live Demo →](https://graphty-org.github.io/algorithms/)**
+Try out all algorithms with interactive visualizations: **[Live Demo →](https://graphty.app/algorithms/)**
 
 The library includes comprehensive examples demonstrating each algorithm. You can:
 
-- **[Browse Interactive HTML Examples](https://graphty-org.github.io/algorithms/examples/)** - Visual demonstrations with step-by-step execution
-- **[View Performance Benchmarks](https://graphty-org.github.io/algorithms/benchmarks/)** - Comparative analysis of algorithm performance
+- **[Browse Interactive HTML Examples](https://graphty.app/algorithms/examples/)** - Visual demonstrations with step-by-step execution
+- **[View Performance Benchmarks](https://graphty.app/algorithms/benchmarks/)** - Comparative analysis of algorithm performance
 - **[Explore Code Examples](https://github.com/graphty-org/algorithms/tree/main/examples)** - Implementation examples for each algorithm
 
 ### Basic Algorithms
@@ -1344,7 +1345,7 @@ interface GRSBMResult {
     - GRSBM: O(m log n) where m is edges
 - **Memory Usage**: O(V + E) for graph storage
 - **Browser Optimization**: Algorithms use iterative approaches where possible to avoid stack overflow
-- **Performance Benchmarks**: View detailed performance comparisons at [https://graphty-org.github.io/algorithms/benchmarks/](https://graphty-org.github.io/algorithms/benchmarks/)
+- **Performance Benchmarks**: View detailed performance comparisons at [https://graphty.app/algorithms/benchmarks/](https://graphty.app/algorithms/benchmarks/)
 
 ## Development
 

package/dist/algorithms.js

@@ -3999,7 +3999,7 @@ class BidirectionalDijkstra {
     }
     return false;
   }
-  getMinDistance(frontier) {
+  _getMinDistance(frontier) {
     if (frontier.isEmpty()) {
       return Infinity;
     }
@@ -10504,7 +10504,7 @@ function initializeClusterCenters(embeddings, numClusters) {
   }
   return centers;
 }
-function updateEmbeddings(graph, embeddings, clusters, learningRate, lambda) {
+function updateEmbeddings(graph, embeddings, _clusters, learningRate, lambda) {
   const gradients = /* @__PURE__ */ new Map();
   for (const [nodeId, embedding] of embeddings) {
     gradients.set(nodeId, new Array(embedding.length).fill(0));
@@ -11062,7 +11062,7 @@ function grsbm(graph, config = {}) {
     explanation: explanations
   };
 }
-function spectralBisection(graph, cluster, numEigenvectors, tolerance, maxIterations) {
+function spectralBisection(graph, cluster, _numEigenvectors, tolerance, maxIterations) {
   const members = Array.from(cluster.members);
   const n = members.length;
   if (n < 4) {