@thi.ng/adjacency 3.0.26 → 3.0.27
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.
- package/CHANGELOG.md +1 -1
- package/bfs.d.ts +2 -0
- package/floyd-warshall.d.ts +2 -1
- package/mst.d.ts +2 -1
- package/package.json +12 -12
- package/sparse.d.ts +1 -0
- package/sparse.js +1 -0
package/CHANGELOG.md
CHANGED
package/bfs.d.ts
CHANGED
|
@@ -10,6 +10,7 @@ import type { CostFn, IGraph } from "./api.js";
|
|
|
10
10
|
* Also see {@link bfs} for ad hoc queries.
|
|
11
11
|
*
|
|
12
12
|
* Reference:
|
|
13
|
+
*
|
|
13
14
|
* - https://en.wikipedia.org/wiki/Breadth-first_search
|
|
14
15
|
* - https://algs4.cs.princeton.edu/40graphs/
|
|
15
16
|
*/
|
|
@@ -37,6 +38,7 @@ export declare class BFS {
|
|
|
37
38
|
* topological distance.
|
|
38
39
|
*
|
|
39
40
|
* Reference:
|
|
41
|
+
*
|
|
40
42
|
* - https://en.wikipedia.org/wiki/Breadth-first_search
|
|
41
43
|
* - https://algs4.cs.princeton.edu/40graphs/
|
|
42
44
|
*
|
package/floyd-warshall.d.ts
CHANGED
|
@@ -17,7 +17,8 @@ import type { CostFn, IGraph } from "./api.js";
|
|
|
17
17
|
* i.e. ~8MB for a graph with 1000 nodes. If possible, use {@link BFS} to
|
|
18
18
|
* perform individual shortest-path queries (rather than this global approach).
|
|
19
19
|
*
|
|
20
|
-
*
|
|
20
|
+
* References:
|
|
21
|
+
*
|
|
21
22
|
* - https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
|
|
22
23
|
*/
|
|
23
24
|
export declare class FloydWarshall {
|
package/mst.d.ts
CHANGED
|
@@ -15,10 +15,11 @@ import type { Fn } from "@thi.ng/api";
|
|
|
15
15
|
* criteria. The result edges will be in ascending order, based on the supplied
|
|
16
16
|
* cost function. The cost function is called once for each edge and return
|
|
17
17
|
* values will be cached prior to sorting (see
|
|
18
|
-
* [`sortByCachedKey
|
|
18
|
+
* [`sortByCachedKey`](https://docs.thi.ng/umbrella/arrays/functions/sortByCachedKey.html)
|
|
19
19
|
* for details).
|
|
20
20
|
*
|
|
21
21
|
* References:
|
|
22
|
+
*
|
|
22
23
|
* - https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
|
|
23
24
|
*
|
|
24
25
|
* @example
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@thi.ng/adjacency",
|
|
3
|
-
"version": "3.0.
|
|
3
|
+
"version": "3.0.27",
|
|
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",
|
|
@@ -42,18 +42,18 @@
|
|
|
42
42
|
"tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
|
|
43
43
|
},
|
|
44
44
|
"dependencies": {
|
|
45
|
-
"@thi.ng/api": "^8.11.
|
|
46
|
-
"@thi.ng/arrays": "^2.10.
|
|
47
|
-
"@thi.ng/bitfield": "^2.3.
|
|
48
|
-
"@thi.ng/dcons": "^3.2.
|
|
49
|
-
"@thi.ng/disjoint-set": "^1.1.
|
|
50
|
-
"@thi.ng/errors": "^2.5.
|
|
51
|
-
"@thi.ng/sparse": "^1.0.
|
|
45
|
+
"@thi.ng/api": "^8.11.20",
|
|
46
|
+
"@thi.ng/arrays": "^2.10.15",
|
|
47
|
+
"@thi.ng/bitfield": "^2.3.65",
|
|
48
|
+
"@thi.ng/dcons": "^3.2.142",
|
|
49
|
+
"@thi.ng/disjoint-set": "^1.1.13",
|
|
50
|
+
"@thi.ng/errors": "^2.5.26",
|
|
51
|
+
"@thi.ng/sparse": "^1.0.7"
|
|
52
52
|
},
|
|
53
53
|
"devDependencies": {
|
|
54
|
-
"@thi.ng/vectors": "^7.12.
|
|
55
|
-
"esbuild": "^0.
|
|
56
|
-
"typedoc": "^0.27.
|
|
54
|
+
"@thi.ng/vectors": "^7.12.20",
|
|
55
|
+
"esbuild": "^0.25.0",
|
|
56
|
+
"typedoc": "^0.27.7",
|
|
57
57
|
"typescript": "^5.7.3"
|
|
58
58
|
},
|
|
59
59
|
"keywords": [
|
|
@@ -125,5 +125,5 @@
|
|
|
125
125
|
],
|
|
126
126
|
"year": 2018
|
|
127
127
|
},
|
|
128
|
-
"gitHead": "
|
|
128
|
+
"gitHead": "9a0b33253fef092aaf301decf6ecd54317874d4c\n"
|
|
129
129
|
}
|
package/sparse.d.ts
CHANGED