@thi.ng/adjacency 2.5.36 → 2.5.38

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (3) hide show
  1. package/CHANGELOG.md +1 -1
  2. package/mst.d.ts +12 -11
  3. package/package.json +13 -13
package/CHANGELOG.md CHANGED
@@ -1,6 +1,6 @@
1
1
  # Change Log
2
2
 
3
- - **Last updated**: 2024-03-07T20:40:47Z
3
+ - **Last updated**: 2024-03-13T14:04:31Z
4
4
  - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
5
5
 
6
6
  All notable changes to this project will be documented in this file.
package/mst.d.ts CHANGED
@@ -22,7 +22,7 @@ import type { Fn } from "@thi.ng/api";
22
22
  * - https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
23
23
  *
24
24
  * @example
25
- * ```ts
25
+ * ```ts tangle:../export/mst.ts
26
26
  * import { mst } from "@thi.ng/adjacency";
27
27
  * import { distSq } from "@thi.ng/vectors";
28
28
  *
@@ -32,16 +32,17 @@ import type { Fn } from "@thi.ng/api";
32
32
  * // connections (vertex ID pairs)
33
33
  * edges = [[0,1], [0,4], [1,2], [1,3], [2,3], [2,4]]
34
34
  *
35
- * mst(
36
- * edges,
37
- * // max vertex ID
38
- * 4,
39
- * // cost function (cartesian distance)
40
- * ([a, b]) => distSq(verts[a], verts[b]),
41
- * // edge vertex IDs
42
- * (e) => e
43
- * )
44
- *
35
+ * console.log(
36
+ * mst(
37
+ * edges,
38
+ * // max vertex ID
39
+ * 4,
40
+ * // cost function (cartesian distance)
41
+ * ([a, b]) => distSq(verts[a], verts[b]),
42
+ * // edge vertex IDs
43
+ * (e) => e
44
+ * )
45
+ * );
45
46
  * // [ [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 2, 4 ] ]
46
47
  * ```
47
48
  *
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@thi.ng/adjacency",
3
- "version": "2.5.36",
3
+ "version": "2.5.38",
4
4
  "description": "Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs",
5
5
  "type": "module",
6
6
  "module": "./index.js",
@@ -39,20 +39,20 @@
39
39
  "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
40
40
  },
41
41
  "dependencies": {
42
- "@thi.ng/api": "^8.9.28",
43
- "@thi.ng/arrays": "^2.8.6",
44
- "@thi.ng/bitfield": "^2.3.29",
45
- "@thi.ng/dcons": "^3.2.99",
46
- "@thi.ng/errors": "^2.4.20",
47
- "@thi.ng/sparse": "^0.3.104"
42
+ "@thi.ng/api": "^8.9.30",
43
+ "@thi.ng/arrays": "^2.8.8",
44
+ "@thi.ng/bitfield": "^2.3.31",
45
+ "@thi.ng/dcons": "^3.2.101",
46
+ "@thi.ng/errors": "^2.5.0",
47
+ "@thi.ng/sparse": "^0.3.106"
48
48
  },
49
49
  "devDependencies": {
50
- "@microsoft/api-extractor": "^7.40.1",
51
- "@thi.ng/vectors": "^7.10.16",
52
- "esbuild": "^0.20.0",
50
+ "@microsoft/api-extractor": "^7.42.3",
51
+ "@thi.ng/vectors": "^7.10.18",
52
+ "esbuild": "^0.20.1",
53
53
  "rimraf": "^5.0.5",
54
- "typedoc": "^0.25.7",
55
- "typescript": "^5.3.3"
54
+ "typedoc": "^0.25.12",
55
+ "typescript": "^5.4.2"
56
56
  },
57
57
  "keywords": [
58
58
  "adjacency",
@@ -126,5 +126,5 @@
126
126
  ],
127
127
  "year": 2018
128
128
  },
129
- "gitHead": "a421058a65ba76608d94129ac29451bfedaf201c\n"
129
+ "gitHead": "7f3fcbd6c0462b0ce45afa141fe163d1f297fd51\n"
130
130
  }