@thi.ng/adjacency 2.5.5 → 2.5.8

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2023-10-30T14:31:56Z
+- **Last updated**: 2023-11-09T10:28:18Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/README.md

@@ -74,7 +74,7 @@ For Node.js REPL:
 const adjacency = await import("@thi.ng/adjacency");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 2.57 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 2.74 KB
 
 ## Dependencies
 

package/bfs.js

@@ -13,6 +13,10 @@ import { DCons } from "@thi.ng/dcons/dcons";
  * - https://algs4.cs.princeton.edu/40graphs/
  */
 export class BFS {
+    graph;
+    marked;
+    edges;
+    dist;
     constructor(graph, src, cost = () => 1) {
         this.graph = graph;
         const numV = graph.numVertices();

package/binary.js

@@ -7,6 +7,9 @@ import { __into, __invert, __toDot } from "./utils.js";
  * storing 16384 directed edges in just 2KB of memory (128 * 128 / 8 = 2048).
  */
 export class AdjacencyBitMatrix {
+    mat;
+    undirected;
+    numE;
     constructor(n, edges, undirected = false) {
         this.mat = new BitMatrix(n);
         this.undirected = undirected;

package/dfs.js

@@ -1,6 +1,10 @@
 import { BitField } from "@thi.ng/bitfield/bitfield";
 import { DCons } from "@thi.ng/dcons/dcons";
 export class DFS {
+    graph;
+    marked;
+    edges;
+    src;
     constructor(graph, src) {
         this.graph = graph;
         this.src = src;

package/disjoint-set.js

@@ -8,6 +8,9 @@ import { fillRange } from "@thi.ng/arrays/fill-range";
  * - https://algs4.cs.princeton.edu/lectures/15UnionFind-2x2.pdf
  */
 export class DisjointSet {
+    roots;
+    ranks;
+    count;
     /**
      * Creates new instance with `n` initial singular subsets.
      *

package/floyd-warshall.js

@@ -20,6 +20,9 @@ import { outOfBounds } from "@thi.ng/errors/out-of-bounds";
  * - https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
  */
 export class FloydWarshall {
+    dist;
+    next;
+    numV;
     /**
      * Instantiates and pre-computes all shortest paths in given `graph`. See
      * class comments for details.

package/list.js

@@ -1,10 +1,10 @@
 import { __into, __invert, __toDot } from "./utils.js";
 export class AdjacencyList {
+    adjacency = [];
+    indegree = [];
+    numE = 0;
+    numV = 0;
     constructor(edges) {
-        this.adjacency = [];
-        this.indegree = [];
-        this.numE = 0;
-        this.numV = 0;
         edges && __into(this, edges);
     }
     numEdges() {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/adjacency",
-  "version": "2.5.5",
+  "version": "2.5.8",
   "description": "Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs",
   "type": "module",
   "module": "./index.js",
@@ -31,26 +31,25 @@
     "clean": "rimraf --glob '*.js' '*.d.ts' '*.map' doc",
     "doc": "typedoc --excludePrivate --excludeInternal --out doc src/index.ts",
     "doc:ae": "mkdir -p .ae/doc .ae/temp && api-extractor run --local --verbose",
-    "doc:readme": "yarn doc:stats && tools:readme",
-    "doc:stats": "tools:module-stats",
+    "doc:readme": "bun ../../tools/src/module-stats.ts && bun ../../tools/src/readme.ts",
     "pub": "yarn npm publish --access public",
-    "test": "testament test"
+    "test": "bun test"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.9.6",
-    "@thi.ng/arrays": "^2.7.1",
-    "@thi.ng/bitfield": "^2.3.3",
-    "@thi.ng/dcons": "^3.2.69",
-    "@thi.ng/errors": "^2.4.0",
-    "@thi.ng/sparse": "^0.3.74"
+    "@thi.ng/api": "^8.9.8",
+    "@thi.ng/arrays": "^2.7.4",
+    "@thi.ng/bitfield": "^2.3.6",
+    "@thi.ng/dcons": "^3.2.72",
+    "@thi.ng/errors": "^2.4.2",
+    "@thi.ng/sparse": "^0.3.77"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.38.0",
-    "@thi.ng/testament": "^0.3.24",
-    "@thi.ng/vectors": "^7.8.1",
+    "@microsoft/api-extractor": "^7.38.2",
+    "@thi.ng/testament": "^0.4.1",
+    "@thi.ng/vectors": "^7.8.4",
     "rimraf": "^5.0.5",
     "tools": "^0.0.1",
-    "typedoc": "^0.25.2",
+    "typedoc": "^0.25.3",
     "typescript": "^5.2.2"
   },
   "keywords": [
@@ -125,5 +124,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "bfa16829786146bd24df3cdbd44649a45a603e44\n"
+  "gitHead": "669a3151e4302480244fe3e60eff5e732ea5b7a7\n"
 }

package/sparse.js

@@ -2,6 +2,7 @@ import { ensureIndex2 } from "@thi.ng/errors/out-of-bounds";
 import { CSR } from "@thi.ng/sparse/csr";
 import { __into, __invert, __toDot } from "./utils.js";
 export class AdjacencyMatrix extends CSR {
+    undirected;
     constructor(n, data, rows, cols, undirected = false) {
         super(n, n, data, rows, cols);
         this.undirected = undirected;