@thi.ng/adjacency 3.0.63 → 3.0.64

package/README.md

@@ -7,7 +7,7 @@
 [![Mastodon Follow](https://img.shields.io/mastodon/follow/109331703950160316?domain=https%3A%2F%2Fmastodon.thi.ng&style=social)](https://mastodon.thi.ng/@toxi)
 
 > [!NOTE]
-> This is one of 210 standalone projects, maintained as part
+> This is one of 211 standalone projects, maintained as part
 > of the [@thi.ng/umbrella](https://github.com/thi-ng/umbrella/) monorepo
 > and anti-framework.
 >

package/bfs.js

@@ -22,7 +22,7 @@ class BFS {
     marked.setAt(id);
     while (queue.length) {
       const v = queue.drop();
-      for (let n of graph.neighbors(v)) {
+      for (const n of graph.neighbors(v)) {
         const c = dist[v] + cost(v, n);
         if (c < dist[n] || !marked.at(n)) {
           edges[n] = v;

package/binary.js

@@ -13,7 +13,7 @@ class AdjacencyBitMatrix {
   *edges() {
     const directed = !this.undirected;
     for (let i = this.mat.m; i-- > 0; ) {
-      for (let n of this.neighbors(i)) {
+      for (const n of this.neighbors(i)) {
         if (directed || n > i) {
           yield [i, n];
         }

package/dfs.js

@@ -16,7 +16,7 @@ class DFS {
   search(id) {
     const { edges, marked } = this;
     marked.setAt(id);
-    for (let n of this.graph.neighbors(id)) {
+    for (const n of this.graph.neighbors(id)) {
       if (!marked.at(n)) {
         edges[n] = id;
         this.search(n);

package/floyd-warshall.js

@@ -14,7 +14,7 @@ class FloydWarshall {
     const numV = this.numV = graph.numVertices();
     const dist = this.dist = new Float32Array(numV * numV).fill(Infinity);
     const next = this.next = new Int32Array(numV * numV).fill(-1);
-    for (let [u, v] of graph.edges()) {
+    for (const [u, v] of graph.edges()) {
       const idx = u * numV + v;
       dist[idx] = cost(u, v);
       next[idx] = v;

package/list.js

@@ -24,7 +24,7 @@ class AdjacencyList {
     for (let i = 0, n = adjacency.length; i < n; i++) {
       const vertex = adjacency[i];
       if (!vertex) continue;
-      for (let j of vertex) yield [i, j];
+      for (const j of vertex) yield [i, j];
     }
   }
   addVertex(id) {
@@ -119,7 +119,7 @@ const adjListFromAdjacency = (src) => {
   for (let i = 0, n = src.length; i < n; i++) {
     const v = src[i];
     if (!v) continue;
-    for (let w of v) res.addEdge(i, w);
+    for (const w of v) res.addEdge(i, w);
   }
   return res;
 };

package/mst.js

@@ -3,7 +3,7 @@ import { DisjointSet } from "@thi.ng/disjoint-set";
 const mst = (edges, maxID, cost, verts) => {
   const graph = new DisjointSet(maxID + 1);
   const res = [];
-  for (let e of sortByCachedKey(edges, cost)) {
+  for (const e of sortByCachedKey(edges, cost)) {
     const v = verts(e);
     if (!graph.unified(v[0], v[1])) {
       graph.union(v[0], v[1]);

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@thi.ng/adjacency",
-	"version": "3.0.63",
+	"version": "3.0.64",
 	"description": "Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs",
 	"type": "module",
 	"module": "./index.js",
@@ -42,16 +42,16 @@
 		"tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
 	},
 	"dependencies": {
-		"@thi.ng/api": "^8.12.9",
-		"@thi.ng/arrays": "^2.14.2",
-		"@thi.ng/bitfield": "^2.4.21",
-		"@thi.ng/dcons": "^3.2.177",
-		"@thi.ng/disjoint-set": "^1.1.36",
-		"@thi.ng/errors": "^2.5.49",
-		"@thi.ng/sparse": "^1.1.24"
+		"@thi.ng/api": "^8.12.10",
+		"@thi.ng/arrays": "^2.14.3",
+		"@thi.ng/bitfield": "^2.4.22",
+		"@thi.ng/dcons": "^3.2.178",
+		"@thi.ng/disjoint-set": "^1.1.37",
+		"@thi.ng/errors": "^2.5.50",
+		"@thi.ng/sparse": "^1.1.25"
 	},
 	"devDependencies": {
-		"@thi.ng/vectors": "^8.6.14",
+		"@thi.ng/vectors": "^8.6.15",
 		"esbuild": "^0.27.0",
 		"typedoc": "^0.28.14",
 		"typescript": "^5.9.3"
@@ -125,5 +125,5 @@
 		],
 		"year": 2018
 	},
-	"gitHead": "fdca77cabf47dd23a9ab17a5ca13e3060075c12c\n"
+	"gitHead": "824bf9047b5a10f777c5c5b4aeecf0c750a22c75\n"
 }

package/utils.js

@@ -1,7 +1,7 @@
 const __toDot = (edges, undirected, ids) => {
   const [type, sep] = undirected ? ["graph", "--"] : ["digraph", "->"];
   const res = [`${type} g {`];
-  for (let e of edges) {
+  for (const e of edges) {
     res.push(
       ids ? `"${ids[e[0]]}"${sep}"${ids[e[1]]}";` : `"${e[0]}"${sep}"${e[1]}";`
     );
@@ -10,12 +10,12 @@ const __toDot = (edges, undirected, ids) => {
   return res.join("\n");
 };
 const __into = (graph, edges) => {
-  for (let e of edges) {
+  for (const e of edges) {
     graph.addEdge(e[0], e[1]);
   }
 };
 const __invert = (graph, edges) => {
-  for (let e of edges) {
+  for (const e of edges) {
     graph.addEdge(e[1], e[0]);
   }
   return graph;