@thi.ng/adjacency 2.2.19 → 2.2.20

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2022-12-16T12:52:25Z
+- **Last updated**: 2022-12-20T16:33:11Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/binary.d.ts

@@ -30,10 +30,11 @@ export declare class AdjacencyBitMatrix implements IGraph<number> {
     toDot(ids?: string[]): string;
 }
 /**
- * Creates adjacency matrix backed by a {@link @thi.ng/bitfield#BitMatrix}
+ * Creates adjacency matrix backed by a
+ * [`BitMatrix`](https://docs.thi.ng/umbrella/bitfield/classes/BitMatrix.html)
  * with capacity `n` (max vertices), optionally initialized with given edge
- * pairs. Each edge is `[src-node dest-node]`. If `undirected` is true
- * (default: false), creates symmetrical adjacencies.
+ * pairs. Each edge is `[src-node dest-node]`. If `undirected` is true (default:
+ * false), creates symmetrical adjacencies.
  *
  * @param n - max vertices
  * @param edges - edge pairs

package/binary.js

@@ -90,10 +90,11 @@ export class AdjacencyBitMatrix {
     }
 }
 /**
- * Creates adjacency matrix backed by a {@link @thi.ng/bitfield#BitMatrix}
+ * Creates adjacency matrix backed by a
+ * [`BitMatrix`](https://docs.thi.ng/umbrella/bitfield/classes/BitMatrix.html)
  * with capacity `n` (max vertices), optionally initialized with given edge
- * pairs. Each edge is `[src-node dest-node]`. If `undirected` is true
- * (default: false), creates symmetrical adjacencies.
+ * pairs. Each edge is `[src-node dest-node]`. If `undirected` is true (default:
+ * false), creates symmetrical adjacencies.
  *
  * @param n - max vertices
  * @param edges - edge pairs

package/disjoint-set.d.ts

@@ -1,10 +1,10 @@
 /**
- * Typed array based Disjoint Set implementation with quick union and
- * path compression, after Sedgewick & Wayne.
+ * Typed array based Disjoint Set implementation with quick union and path
+ * compression, after Sedgewick & Wayne.
  *
  * @remarks
- * - {@link https://en.wikipedia.org/wiki/Disjoint-set_data_structure}
- * - {@link https://algs4.cs.princeton.edu/lectures/15UnionFind-2x2.pdf}
+ * - https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+ * - https://algs4.cs.princeton.edu/lectures/15UnionFind-2x2.pdf
  */
 export declare class DisjointSet {
     roots: Uint32Array;

package/disjoint-set.js

@@ -1,11 +1,11 @@
 import { fillRange } from "@thi.ng/arrays/fill-range";
 /**
- * Typed array based Disjoint Set implementation with quick union and
- * path compression, after Sedgewick & Wayne.
+ * Typed array based Disjoint Set implementation with quick union and path
+ * compression, after Sedgewick & Wayne.
  *
  * @remarks
- * - {@link https://en.wikipedia.org/wiki/Disjoint-set_data_structure}
- * - {@link https://algs4.cs.princeton.edu/lectures/15UnionFind-2x2.pdf}
+ * - https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+ * - https://algs4.cs.princeton.edu/lectures/15UnionFind-2x2.pdf
  */
 export class DisjointSet {
     /**

package/mst.d.ts

@@ -15,9 +15,11 @@ import type { Fn } from "@thi.ng/api";
  * criteria. The result edges will be in ascending order, based on the supplied
  * cost function. The cost function is called once for each edge and return
  * values will be cached prior to sorting (see
- * {@link @thi.ng/arrays#sortByCachedKey} for details).
+ * [`sortByCachedKey()`](https://docs.thi.ng/umbrella/arrays/functions/sortByCachedKey.html)
+ * for details).
  *
- * Reference: {@link https://en.wikipedia.org/wiki/Kruskal%27s_algorithm}
+ * References:
+ * - https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
  *
  * @example
  * ```ts

package/mst.js

@@ -16,9 +16,11 @@ import { DisjointSet } from "./disjoint-set.js";
  * criteria. The result edges will be in ascending order, based on the supplied
  * cost function. The cost function is called once for each edge and return
  * values will be cached prior to sorting (see
- * {@link @thi.ng/arrays#sortByCachedKey} for details).
+ * [`sortByCachedKey()`](https://docs.thi.ng/umbrella/arrays/functions/sortByCachedKey.html)
+ * for details).
  *
- * Reference: {@link https://en.wikipedia.org/wiki/Kruskal%27s_algorithm}
+ * References:
+ * - https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
  *
  * @example
  * ```ts

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/adjacency",
-  "version": "2.2.19",
+  "version": "2.2.20",
   "description": "Sparse & bitwise adjacency matrices and related functions for directed & undirected graphs",
   "type": "module",
   "module": "./index.js",
@@ -34,17 +34,17 @@
     "test": "testament test"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.6.0",
-    "@thi.ng/arrays": "^2.4.5",
-    "@thi.ng/bitfield": "^2.2.15",
-    "@thi.ng/dcons": "^3.2.26",
+    "@thi.ng/api": "^8.6.1",
+    "@thi.ng/arrays": "^2.4.6",
+    "@thi.ng/bitfield": "^2.2.16",
+    "@thi.ng/dcons": "^3.2.27",
     "@thi.ng/errors": "^2.2.6",
-    "@thi.ng/sparse": "^0.3.31"
+    "@thi.ng/sparse": "^0.3.32"
   },
   "devDependencies": {
     "@microsoft/api-extractor": "^7.33.7",
     "@thi.ng/testament": "^0.3.7",
-    "@thi.ng/vectors": "^7.5.27",
+    "@thi.ng/vectors": "^7.5.28",
     "rimraf": "^3.0.2",
     "tools": "^0.0.1",
     "typedoc": "^0.23.22",
@@ -119,5 +119,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "f445a9cc8022bcdebbf6ff91fd66ced016d72f01\n"
+  "gitHead": "7b2af448da8a63fb21704a79cc4cdf1f3d7d7a64\n"
 }

package/sparse.d.ts

@@ -13,7 +13,8 @@ export declare class AdjacencyMatrix extends CSR implements IGraph<number> {
     neighbors(id: number): number[];
     invert(): AdjacencyMatrix;
     /**
-     * Returns a diagonal sparse matrix {@link @thi.ng/sparse#CSR} containing
+     * Returns a diagonal sparse matrix
+     * [`CSR`](https://docs.thi.ng/umbrella/sparse/classes/CSR.html) containing
      * information about the degree of each vertex, i.e. the number of edges
      * attached to each vertex.
      *
@@ -24,12 +25,13 @@ export declare class AdjacencyMatrix extends CSR implements IGraph<number> {
      */
     degreeMat(deg?: DegreeType): CSR;
     /**
-     * Returns this graph's Laplacian matrix: `L = D - A` Where `D` is
-     * the degree matrix and `A` this adjacency matrix.
+     * Returns this graph's Laplacian matrix: `L = D - A` Where `D` is the
+     * degree matrix and `A` this adjacency matrix.
      *
      * @remarks
-     * - {@link https://en.wikipedia.org/wiki/Laplacian_matrix}
-     * - {@link https://en.wikipedia.org/wiki/Discrete_Laplace_operator}
+     * References:
+     * - https://en.wikipedia.org/wiki/Laplacian_matrix
+     * - https://en.wikipedia.org/wiki/Discrete_Laplace_operator
      *
      * @param deg - degree type for {@link AdjacencyMatrix.degreeMat}
      */
@@ -50,10 +52,11 @@ export declare class AdjacencyMatrix extends CSR implements IGraph<number> {
     toDot(ids?: string[]): string;
 }
 /**
- * Creates an adjacency matrix backed by a sparse {@link @thi.ng/sparse#CSR}
- * matrix, optionally initialize with given edge pairs. Each edge is a `[src,
- * dest]` tuple. If `undirected` is true (default: false), creates symmetrical
- * edges (i.e. undirected graph).
+ * Creates an adjacency matrix backed by a sparse
+ * [`CSR`](https://docs.thi.ng/umbrella/sparse/classes/CSR.html) matrix,
+ * optionally initialize with given edge pairs. Each edge is a `[src, dest]`
+ * tuple. If `undirected` is true (default: false), creates symmetrical edges
+ * (i.e. undirected graph).
  *
  * @param n - max number of vertices
  * @param edges - edge pairs

package/sparse.js

@@ -61,7 +61,8 @@ export class AdjacencyMatrix extends CSR {
         return __invert(defAdjMatrix(this.m, undefined, this.undirected), this.edges());
     }
     /**
-     * Returns a diagonal sparse matrix {@link @thi.ng/sparse#CSR} containing
+     * Returns a diagonal sparse matrix
+     * [`CSR`](https://docs.thi.ng/umbrella/sparse/classes/CSR.html) containing
      * information about the degree of each vertex, i.e. the number of edges
      * attached to each vertex.
      *
@@ -93,12 +94,13 @@ export class AdjacencyMatrix extends CSR {
         return res;
     }
     /**
-     * Returns this graph's Laplacian matrix: `L = D - A` Where `D` is
-     * the degree matrix and `A` this adjacency matrix.
+     * Returns this graph's Laplacian matrix: `L = D - A` Where `D` is the
+     * degree matrix and `A` this adjacency matrix.
      *
      * @remarks
-     * - {@link https://en.wikipedia.org/wiki/Laplacian_matrix}
-     * - {@link https://en.wikipedia.org/wiki/Discrete_Laplace_operator}
+     * References:
+     * - https://en.wikipedia.org/wiki/Laplacian_matrix
+     * - https://en.wikipedia.org/wiki/Discrete_Laplace_operator
      *
      * @param deg - degree type for {@link AdjacencyMatrix.degreeMat}
      */
@@ -144,10 +146,11 @@ export class AdjacencyMatrix extends CSR {
     }
 }
 /**
- * Creates an adjacency matrix backed by a sparse {@link @thi.ng/sparse#CSR}
- * matrix, optionally initialize with given edge pairs. Each edge is a `[src,
- * dest]` tuple. If `undirected` is true (default: false), creates symmetrical
- * edges (i.e. undirected graph).
+ * Creates an adjacency matrix backed by a sparse
+ * [`CSR`](https://docs.thi.ng/umbrella/sparse/classes/CSR.html) matrix,
+ * optionally initialize with given edge pairs. Each edge is a `[src, dest]`
+ * tuple. If `undirected` is true (default: false), creates symmetrical edges
+ * (i.e. undirected graph).
  *
  * @param n - max number of vertices
  * @param edges - edge pairs