@thi.ng/adjacency 2.5.50 → 2.5.52

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2024-04-23T07:02:17Z
+- **Last updated**: 2024-06-21T19:34:38Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

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 192 standalone projects, maintained as part
+> This is one of 193 standalone projects, maintained as part
 > of the [@thi.ng/umbrella](https://github.com/thi-ng/umbrella/) monorepo
 > and anti-framework.
 >

package/bfs.js

@@ -37,8 +37,7 @@ class BFS {
     return this.marked.at(id) !== 0;
   }
   pathTo(id) {
-    if (!this.marked.at(id))
-      return;
+    if (!this.marked.at(id)) return;
     const { dist, edges } = this;
     const path = new DCons();
     for (; dist[id] > 0; id = edges[id]) {

package/binary.js

@@ -73,11 +73,9 @@ class AdjacencyBitMatrix {
     const query = mat.row(id, true);
     const acc = [];
     for (let i = 0, m = mat.m; i < m; i++) {
-      if (i === id)
-        continue;
+      if (i === id) continue;
       const sim = query.similarity(mat.row(i, true));
-      if (sim >= threshold)
-        acc.push([i, sim]);
+      if (sim >= threshold) acc.push([i, sim]);
     }
     return acc.sort((a, b) => b[1] - a[1]);
   }

package/dfs.js

@@ -27,8 +27,7 @@ class DFS {
     return this.marked.at(id) !== 0;
   }
   pathTo(id) {
-    if (!this.marked.at(id))
-      return;
+    if (!this.marked.at(id)) return;
     const { edges, src } = this;
     const path = new DCons();
     for (; id !== src; id = edges[id]) {

package/floyd-warshall.js

@@ -61,8 +61,7 @@ class FloydWarshall {
   *path(a, b) {
     this.ensurePair(a, b);
     const { next, numV } = this;
-    if (next[a * numV + b] === -1)
-      return;
+    if (next[a * numV + b] === -1) return;
     yield a;
     while (a !== b) {
       a = next[a * numV + b];

package/list.js

@@ -16,18 +16,15 @@ class AdjacencyList {
   *vertices() {
     const { adjacency } = this;
     for (let i = 0, n = adjacency.length; i < n; i++) {
-      if (adjacency[i])
-        yield i;
+      if (adjacency[i]) yield i;
     }
   }
   *edges() {
     const { adjacency } = this;
     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];
+      if (!vertex) continue;
+      for (let j of vertex) yield [i, j];
     }
   }
   addVertex(id) {
@@ -36,8 +33,7 @@ class AdjacencyList {
   removeVertex(id) {
     const { adjacency, indegree } = this;
     const vertex = adjacency[id];
-    if (!vertex)
-      return false;
+    if (!vertex) return false;
     while (vertex.length) {
       indegree[vertex.pop()]--;
       this.numE--;
@@ -45,10 +41,8 @@ class AdjacencyList {
     delete adjacency[id];
     for (let i = 0, n = adjacency.length; i < n && indegree[id] > 0; i++) {
       const vertex2 = adjacency[i];
-      if (!vertex2)
-        continue;
-      while (vertex2.includes(id))
-        this.removeEdge(i, id);
+      if (!vertex2) continue;
+      while (vertex2.includes(id)) this.removeEdge(i, id);
     }
     this.numV--;
     return true;
@@ -85,10 +79,8 @@ class AdjacencyList {
     let degree = 0;
     const vertex = this.adjacency[id];
     if (vertex) {
-      if (type !== "in")
-        degree += vertex.length;
-      if (type !== "out")
-        degree += this.indegree[id];
+      if (type !== "in") degree += vertex.length;
+      if (type !== "out") degree += this.indegree[id];
     }
     return degree;
   }
@@ -115,8 +107,7 @@ class AdjacencyList {
   }
   ensureVertexData(id) {
     const vertex = this.adjacency[id];
-    if (vertex)
-      return vertex;
+    if (vertex) return vertex;
     this.numV++;
     this.indegree[id] = 0;
     return this.adjacency[id] = [];
@@ -127,10 +118,8 @@ const adjListFromAdjacency = (src) => {
   const res = new AdjacencyList();
   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);
+    if (!v) continue;
+    for (let w of v) res.addEdge(i, w);
   }
   return res;
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/adjacency",
-  "version": "2.5.50",
+  "version": "2.5.52",
   "description": "Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs",
   "type": "module",
   "module": "./index.js",
@@ -10,7 +10,7 @@
     "type": "git",
     "url": "https://github.com/thi-ng/umbrella.git"
   },
-  "homepage": "https://github.com/thi-ng/umbrella/tree/develop/packages/adjacency#readme",
+  "homepage": "https://thi.ng/adjacency",
   "funding": [
     {
       "type": "github",
@@ -39,19 +39,19 @@
     "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.11.1",
-    "@thi.ng/arrays": "^2.9.5",
-    "@thi.ng/bitfield": "^2.3.40",
-    "@thi.ng/dcons": "^3.2.112",
-    "@thi.ng/errors": "^2.5.6",
-    "@thi.ng/sparse": "^0.3.117"
+    "@thi.ng/api": "^8.11.3",
+    "@thi.ng/arrays": "^2.9.7",
+    "@thi.ng/bitfield": "^2.3.42",
+    "@thi.ng/dcons": "^3.2.114",
+    "@thi.ng/errors": "^2.5.8",
+    "@thi.ng/sparse": "^0.3.119"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.43.0",
-    "@thi.ng/vectors": "^7.10.30",
-    "esbuild": "^0.20.2",
-    "typedoc": "^0.25.12",
-    "typescript": "^5.4.3"
+    "@microsoft/api-extractor": "^7.47.0",
+    "@thi.ng/vectors": "^7.11.0",
+    "esbuild": "^0.21.5",
+    "typedoc": "^0.25.13",
+    "typescript": "^5.5.2"
   },
   "keywords": [
     "adjacency",
@@ -125,5 +125,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "aed3421c21044c005fbcb7cc37965ccf85a870d2\n"
+  "gitHead": "154c95cf9d6bab32174498ec3b5b5d87e42be7f9\n"
 }

package/sparse.js

@@ -52,10 +52,8 @@ class AdjacencyMatrix extends CSR {
   degree(id, type = "out") {
     let degree = 0;
     ensureIndex2(id, id, this.m, this.n);
-    if (this.undirected || type !== "in")
-      degree += this.nnzRow(id);
-    if (!this.undirected && type !== "out")
-      degree += this.nnzCol(id);
+    if (this.undirected || type !== "in") degree += this.nnzRow(id);
+    if (!this.undirected && type !== "out") degree += this.nnzCol(id);
     return degree;
   }
   neighbors(id) {

package/utils.d.ts

@@ -5,5 +5,5 @@ export declare const __toDot: (edges: Iterable<Pair<number, number>>, undirected
 /** @internal */
 export declare const __into: (graph: IGraph, edges: Iterable<Edge>) => void;
 /** @internal */
-export declare const __invert: <T extends IGraph<number>>(graph: T, edges: Iterable<Edge>) => T;
+export declare const __invert: <T extends IGraph>(graph: T, edges: Iterable<Edge>) => T;
 //# sourceMappingURL=utils.d.ts.map