@thi.ng/adjacency 2.1.5 → 2.1.6

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2021-12-13T10:25:59Z
+- **Last updated**: 2022-03-11T12:13:49Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/README.md

@@ -102,4 +102,4 @@ If this project contributes to an academic publication, please cite it as:
 
 ## License
 
-© 2018 - 2021 Karsten Schmidt // Apache Software License 2.0
+© 2018 - 2022 Karsten Schmidt // Apache Software License 2.0

package/api.d.ts

@@ -18,24 +18,24 @@ export interface IGraph<T = number> {
      * is undirected, a symmetric edge might be created automatically. Returns
      * true, if the edge was created.
      *
-     * @param from
-     * @param to
+     * @param from -
+     * @param to -
      */
     addEdge(from: T, to: T): boolean;
     /**
      * Attempts to remove an edge for given vertex pair. Returns true, if
      * successful.
      *
-     * @param from
-     * @param to
+     * @param from -
+     * @param to -
      */
     removeEdge(from: T, to: T): boolean;
     /**
      * Returns true if an edge exists for the given vertex pair. For undirected
      * graphs, the vertex order is irrelevant.
      *
-     * @param from
-     * @param to
+     * @param from -
+     * @param to -
      */
     hasEdge(from: T, to: T): boolean;
     /**
@@ -44,8 +44,8 @@ export interface IGraph<T = number> {
      * undirected graphs the `type` has no relevance and essentially is always
      * `"inout"`.
      *
-     * @param id
-     * @param type
+     * @param id -
+     * @param type -
      */
     degree(id: T, type?: DegreeType): number;
     /**
@@ -53,7 +53,7 @@ export interface IGraph<T = number> {
      * edges starting *from* given vertex (or, in undirected graphs, the other
      * vertices of edges which the given vertex is part of).
      *
-     * @param id
+     * @param id -
      */
     neighbors(id: T): Iterable<number>;
     /**

package/bfs.d.ts

@@ -27,10 +27,10 @@ export declare class BFS {
  * - https://en.wikipedia.org/wiki/Breadth-first_search
  * - https://algs4.cs.princeton.edu/40graphs/
  *
- * @param graph
- * @param src
- * @param dest
- * @param cost
+ * @param graph -
+ * @param src -
+ * @param dest -
+ * @param cost -
  */
 export declare const bfs: (graph: IGraph, src: number, dest: number, cost?: CostFn<number> | undefined) => Iterable<number> | undefined;
 //# sourceMappingURL=bfs.d.ts.map

package/bfs.js

@@ -60,9 +60,9 @@ export class BFS {
  * - https://en.wikipedia.org/wiki/Breadth-first_search
  * - https://algs4.cs.princeton.edu/40graphs/
  *
- * @param graph
- * @param src
- * @param dest
- * @param cost
+ * @param graph -
+ * @param src -
+ * @param dest -
+ * @param cost -
  */
 export const bfs = (graph, src, dest, cost) => new BFS(graph, src, cost).pathTo(dest);

package/dfs.d.ts

@@ -15,9 +15,9 @@ export declare class DFS {
  * If successful, returns path as iterable or undefined if no path connects the
  * given vertices.
  *
- * @param graph
- * @param src
- * @param dest
+ * @param graph -
+ * @param src -
+ * @param dest -
  */
 export declare const dfs: (graph: IGraph, src: number, dest: number) => Iterable<number> | undefined;
 //# sourceMappingURL=dfs.d.ts.map

package/dfs.js

@@ -39,8 +39,8 @@ export class DFS {
  * If successful, returns path as iterable or undefined if no path connects the
  * given vertices.
  *
- * @param graph
- * @param src
- * @param dest
+ * @param graph -
+ * @param src -
+ * @param dest -
  */
 export const dfs = (graph, src, dest) => new DFS(graph, src).pathTo(dest);

package/disjoint-set.d.ts

@@ -54,7 +54,7 @@ export declare class DisjointSet {
 /**
  * Creates a new {@link DisjointSet} with capacity `n`.
  *
- * @param n
+ * @param n -
  */
 export declare const defDisjointSet: (n: number) => DisjointSet;
 //# sourceMappingURL=disjoint-set.d.ts.map

package/disjoint-set.js

@@ -93,6 +93,6 @@ export class DisjointSet {
 /**
  * Creates a new {@link DisjointSet} with capacity `n`.
  *
- * @param n
+ * @param n -
  */
 export const defDisjointSet = (n) => new DisjointSet(n);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/adjacency",
-  "version": "2.1.5",
+  "version": "2.1.6",
   "description": "Sparse & bitwise adjacency matrices and related functions for directed & undirected graphs",
   "type": "module",
   "module": "./index.js",
@@ -34,21 +34,21 @@
     "test": "testament test"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.3.3",
-    "@thi.ng/arrays": "^2.1.3",
-    "@thi.ng/bitfield": "^2.1.4",
-    "@thi.ng/dcons": "^3.1.4",
-    "@thi.ng/errors": "^2.1.3",
-    "@thi.ng/sparse": "^0.3.4"
+    "@thi.ng/api": "^8.3.4",
+    "@thi.ng/arrays": "^2.2.0",
+    "@thi.ng/bitfield": "^2.1.5",
+    "@thi.ng/dcons": "^3.2.0",
+    "@thi.ng/errors": "^2.1.4",
+    "@thi.ng/sparse": "^0.3.5"
   },
   "devDependencies": {
-    "@microsoft/api-extractor": "^7.19.2",
-    "@thi.ng/testament": "^0.2.3",
-    "@thi.ng/vectors": "^7.4.3",
+    "@microsoft/api-extractor": "^7.19.4",
+    "@thi.ng/testament": "^0.2.4",
+    "@thi.ng/vectors": "^7.5.0",
     "rimraf": "^3.0.2",
     "tools": "^0.0.1",
-    "typedoc": "^0.22.10",
-    "typescript": "^4.5.3"
+    "typedoc": "^0.22.13",
+    "typescript": "^4.6.2"
   },
   "keywords": [
     "adjacency",
@@ -119,5 +119,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "1ba92c6b9509e74e509b4c0b875fc380a97bbbc1\n"
+  "gitHead": "0fc692a3225c068aacafdc4cb6140cf603c67ad8\n"
 }