data-structure-typed 2.5.2 → 2.6.0

package/docs-site-docusaurus/docs/api/classes/UndirectedGraph.md

@@ -6,7 +6,7 @@
 
 # Class: UndirectedGraph\<V, E, VO, EO\>
 
-Defined in: [data-structures/graph/undirected-graph.ts:138](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L138)
+Defined in: [data-structures/graph/undirected-graph.ts:138](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L138)
 
 Undirected graph implementation.
 
@@ -165,7 +165,7 @@ Concrete edge class (extends AbstractEdge<E>).
 new UndirectedGraph<V, E, VO, EO>(options?): UndirectedGraph<V, E, VO, EO>;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:152](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L152)
+Defined in: [data-structures/graph/undirected-graph.ts:152](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L152)
 
 Construct an undirected graph with runtime defaults.
 
@@ -199,7 +199,7 @@ Time O(1), Space O(1)
 get size(): number;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:89](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L89)
+Defined in: [data-structures/graph/abstract-graph.ts:89](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L89)
 
 Total number of entries.
 
@@ -225,7 +225,7 @@ Entry count.
 iterator: IterableIterator<[VertexKey, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L22)
+Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L22)
 
 Default iterator yielding `[key, value]` entries.
 
@@ -281,7 +281,7 @@ Time O(1) avg, Space O(1)
 addEdge(edge): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:254](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L254)
+Defined in: [data-structures/graph/abstract-graph.ts:254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L254)
 
 ##### Parameters
 
@@ -307,7 +307,7 @@ addEdge(
    value?): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:256](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L256)
+Defined in: [data-structures/graph/abstract-graph.ts:256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L256)
 
 ##### Parameters
 
@@ -359,7 +359,7 @@ Time O(1) avg, Space O(1)
 addVertex(vertex): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:189](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L189)
+Defined in: [data-structures/graph/abstract-graph.ts:189](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L189)
 
 ##### Parameters
 
@@ -387,7 +387,7 @@ IGraph.addVertex
 addVertex(key, value?): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:191](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L191)
+Defined in: [data-structures/graph/abstract-graph.ts:191](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L191)
 
 ##### Parameters
 
@@ -425,7 +425,7 @@ bellmanFord(
    genPath?): object;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:705](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L705)
+Defined in: [data-structures/graph/abstract-graph.ts:705](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L705)
 
 Bellman-Ford single-source shortest paths with option to scan negative cycles.
 
@@ -513,7 +513,7 @@ Time O(V * E), Space O(V + E)
 clear(): void;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:682](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L682)
+Defined in: [data-structures/graph/undirected-graph.ts:702](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L702)
 
 Remove all vertices and edges.
 
@@ -543,7 +543,7 @@ IGraph.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:692](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L692)
+Defined in: [data-structures/graph/undirected-graph.ts:712](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L712)
 
 Deep clone as the same concrete class.
 
@@ -579,7 +579,7 @@ createEdge(
    value?): EO;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:219](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L219)
+Defined in: [data-structures/graph/undirected-graph.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L219)
 
 Create an undirected edge instance. Does not insert into the graph.
 
@@ -637,7 +637,7 @@ IGraph.createEdge
 createVertex(key, value?): VO;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:206](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L206)
+Defined in: [data-structures/graph/undirected-graph.ts:206](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L206)
 
 Create an undirected vertex instance. Does not insert into the graph.
 
@@ -683,7 +683,7 @@ IGraph.createVertex
 degreeOf(vertexOrKey): number;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:488](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L488)
+Defined in: [data-structures/graph/undirected-graph.ts:500](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L500)
 
 Degree of a vertex (# of incident undirected edges).
 
@@ -723,7 +723,7 @@ IGraph.degreeOf
 deleteEdge(edgeOrOneSideVertexKey, otherSideVertexKey?): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:380](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L380)
+Defined in: [data-structures/graph/undirected-graph.ts:388](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L388)
 
 Delete an edge by instance or by a pair of keys.
 
@@ -802,7 +802,7 @@ IGraph.deleteEdge
 deleteEdgeBetween(v1, v2): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:291](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L291)
+Defined in: [data-structures/graph/undirected-graph.ts:295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L295)
 
 Delete a single undirected edge between two vertices.
 
@@ -838,7 +838,7 @@ Time O(1) avg, Space O(1)
 deleteVertex(vertexOrKey): boolean;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:447](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L447)
+Defined in: [data-structures/graph/undirected-graph.ts:459](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L459)
 
 Delete a vertex and remove it from all neighbor lists.
 
@@ -896,7 +896,7 @@ dijkstraWithoutHeap(
 genPaths?): DijkstraResult<VO>;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:484](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L484)
+Defined in: [data-structures/graph/abstract-graph.ts:484](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L484)
 
 Dijkstra without heap (array-based selection).
 
@@ -948,7 +948,7 @@ Time O(V^2 + E), Space O(V + E)
 edgeSet(): EO[];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:556](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L556)
+Defined in: [data-structures/graph/undirected-graph.ts:572](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L572)
 
 Unique set of undirected edges across endpoints.
 
@@ -993,7 +993,7 @@ IGraph.edgeSet
 edgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:503](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L503)
+Defined in: [data-structures/graph/undirected-graph.ts:515](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L515)
 
 Incident undirected edges of a vertex.
 
@@ -1033,7 +1033,7 @@ IGraph.edgesOf
 entries(): IterableIterator<[VertexKey, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L31)
+Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L31)
 
 Iterate over `[key, value]` pairs (may yield `undefined` values).
 
@@ -1059,7 +1059,7 @@ Time O(n), Space O(1)
 every(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L66)
+Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L66)
 
 Test whether all entries satisfy the predicate.
 
@@ -1099,7 +1099,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:897](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L897)
+Defined in: [data-structures/graph/abstract-graph.ts:897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L897)
 
 Induced-subgraph filter: keep vertices where `predicate(key, value)` is true,
 and only keep edges whose endpoints both survive.
@@ -1146,7 +1146,7 @@ IGraph.filter
 filterEntries(predicate, thisArg?): [VertexKey, V | undefined][];
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:913](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L913)
+Defined in: [data-structures/graph/abstract-graph.ts:913](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L913)
 
 Preserve the old behavior: return filtered entries as an array.
 
@@ -1180,7 +1180,7 @@ Time O(V), Space O(V)
 find(callbackfn, thisArg?): [VertexKey, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L114)
+Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L114)
 
 Find the first entry that matches a predicate.
 
@@ -1220,7 +1220,7 @@ Time O(n), Space O(1)
 floydWarshall(): object;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:798](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L798)
+Defined in: [data-structures/graph/abstract-graph.ts:798](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L798)
 
 Floyd–Warshall all-pairs shortest paths.
 
@@ -1258,7 +1258,7 @@ Time O(V^3), Space O(V^2)
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L99)
+Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L99)
 
 Visit each entry, left-to-right.
 
@@ -1296,7 +1296,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:156](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L156)
+Defined in: [data-structures/base/iterable-entry-base.ts:156](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L156)
 
 Get the value under a key.
 
@@ -1333,7 +1333,7 @@ getAllPathsBetween(
    limit?): VO[][];
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:309](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L309)
+Defined in: [data-structures/graph/abstract-graph.ts:309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L309)
 
 Enumerate simple paths up to a limit.
 
@@ -1379,7 +1379,7 @@ Time O(paths) worst-case exponential, Space O(V + paths)
 getBiconnectedComponents(): EO[][];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:808](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L808)
+Defined in: [data-structures/graph/undirected-graph.ts:832](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L832)
 
 Find biconnected components using edge-stack Tarjan variant.
 A biconnected component is a maximal biconnected subgraph.
@@ -1402,7 +1402,7 @@ Time O(V + E), Space O(V + E)
 getBridges(): EO[];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:987](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L987)
+Defined in: [data-structures/graph/undirected-graph.ts:1019](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1019)
 
 Get bridges discovered by `tarjan()`.
 
@@ -1440,7 +1440,7 @@ Time O(B), Space O(1)
 getCutVertices(): VO[];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:1039](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L1039)
+Defined in: [data-structures/graph/undirected-graph.ts:1075](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1075)
 
 Get articulation points discovered by `tarjan()`.
 
@@ -1479,7 +1479,7 @@ Time O(C), Space O(1)
 getCycles(isInclude2Cycle?): VertexKey[][];
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:838](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L838)
+Defined in: [data-structures/graph/abstract-graph.ts:838](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L838)
 
 Enumerate simple cycles (may be expensive).
 
@@ -1513,7 +1513,7 @@ Time exponential in worst-case, Space O(V + E)
 getDFNMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:1048](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L1048)
+Defined in: [data-structures/graph/undirected-graph.ts:1084](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1084)
 
 DFN index map computed by `tarjan()`.
 
@@ -1535,7 +1535,7 @@ Time O(V), Space O(V)
 getEdge(v1, v2): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:269](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L269)
+Defined in: [data-structures/graph/undirected-graph.ts:273](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L273)
 
 Get an undirected edge between two vertices, if present.
 
@@ -1594,7 +1594,7 @@ IGraph.getEdge
 getEndsOfEdge(edge): [VO, VO] | undefined;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:657](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L657)
+Defined in: [data-structures/graph/undirected-graph.ts:677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L677)
 
 Resolve an edge's two endpoints to vertex instances.
 
@@ -1634,7 +1634,7 @@ IGraph.getEndsOfEdge
 getLowMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:1057](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L1057)
+Defined in: [data-structures/graph/undirected-graph.ts:1093](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1093)
 
 LOW link map computed by `tarjan()`.
 
@@ -1659,7 +1659,7 @@ getMinCostBetween(
    isWeight?): number | undefined;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:362](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L362)
+Defined in: [data-structures/graph/abstract-graph.ts:362](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L362)
 
 Minimum hops/weight between two vertices.
 
@@ -1709,7 +1709,7 @@ getMinPathBetween(
    isDFS?): VO[] | undefined;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:415](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L415)
+Defined in: [data-structures/graph/abstract-graph.ts:415](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L415)
 
 Minimum path (as vertex sequence) between two vertices.
 
@@ -1761,7 +1761,7 @@ Time O((V + E) log V) weighted / O(V + E) unweighted, Space O(V + E)
 getNeighbors(vertexOrKey): VO[];
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:636](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L636)
+Defined in: [data-structures/graph/undirected-graph.ts:656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L656)
 
 UndirectedGraph connectivity and neighbors
 
@@ -1831,7 +1831,7 @@ IGraph.getNeighbors
 getPathSumWeight(path): number;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:346](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L346)
+Defined in: [data-structures/graph/abstract-graph.ts:346](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L346)
 
 Sum the weights along a vertex path.
 
@@ -1865,7 +1865,7 @@ Time O(L), Space O(1) where L is path length
 getVertex(vertexKey): VO | undefined;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:175](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L175)
+Defined in: [data-structures/graph/abstract-graph.ts:175](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L175)
 
 Get vertex instance by key.
 
@@ -1905,7 +1905,7 @@ IGraph.getVertex
 has(key): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L129)
+Defined in: [data-structures/base/iterable-entry-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L129)
 
 Whether the given key exists.
 
@@ -1939,7 +1939,7 @@ Time O(n) generic, Space O(1)
 hasCycle(): boolean;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:917](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L917)
+Defined in: [data-structures/graph/undirected-graph.ts:945](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L945)
 
 Detect whether the graph contains a cycle.
 Uses DFS with parent tracking.
@@ -1979,7 +1979,7 @@ Time O(V + E), Space O(V)
 hasEdge(v1, v2): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:249](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L249)
+Defined in: [data-structures/graph/abstract-graph.ts:249](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L249)
 
 Whether an edge exists between two vertices.
 
@@ -2019,7 +2019,7 @@ Time O(1) avg, Space O(1)
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L143)
+Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L143)
 
 Whether there exists an entry with the given value.
 
@@ -2053,7 +2053,7 @@ Time O(n), Space O(1)
 hasVertex(vertexOrKey): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:185](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L185)
+Defined in: [data-structures/graph/abstract-graph.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L185)
 
 Whether a vertex exists.
 
@@ -2093,7 +2093,7 @@ IGraph.hasVertex
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:674](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L674)
+Defined in: [data-structures/graph/undirected-graph.ts:694](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L694)
 
 Whether the graph has no vertices and no edges.
 
@@ -2123,7 +2123,7 @@ IGraph.isEmpty
 isVertexKey(potentialKey): potentialKey is VertexKey;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:215](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L215)
+Defined in: [data-structures/graph/abstract-graph.ts:215](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L215)
 
 Type guard: check if a value is a valid vertex key.
 
@@ -2157,7 +2157,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<VertexKey>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L42)
+Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L42)
 
 Iterate over keys only.
 
@@ -2183,7 +2183,7 @@ Time O(n), Space O(1)
 map<T>(callback, thisArg?): T[];
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:928](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L928)
+Defined in: [data-structures/graph/abstract-graph.ts:928](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L928)
 
 Map entries using an implementation-specific strategy.
 
@@ -2223,7 +2223,7 @@ Time O(n), Space O(n)
 print(options?): void;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1183](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1183)
+Defined in: [data-structures/graph/abstract-graph.ts:1183](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1183)
 
 Print the graph to console.
 
@@ -2253,7 +2253,7 @@ Display settings passed to `toVisual`.
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L171)
+Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L171)
 
 Reduce entries into a single accumulator.
 
@@ -2299,7 +2299,7 @@ Time O(n), Space O(1)
 removeManyVertices(vertexMap): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:234](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L234)
+Defined in: [data-structures/graph/abstract-graph.ts:234](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L234)
 
 Delete multiple vertices.
 
@@ -2336,7 +2336,7 @@ setEdgeWeight(
    weight): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:291](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L291)
+Defined in: [data-structures/graph/abstract-graph.ts:291](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L291)
 
 Set the weight of an existing edge.
 
@@ -2382,7 +2382,7 @@ Time O(1) avg, Space O(1)
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L83)
+Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L83)
 
 Test whether any entry satisfies the predicate.
 
@@ -2422,7 +2422,7 @@ Time O(n), Space O(1)
 tarjan(): object;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:743](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L743)
+Defined in: [data-structures/graph/undirected-graph.ts:767](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L767)
 
 Tarjan-based bridge and articulation point detection.
 
@@ -2484,7 +2484,7 @@ Time O(V + E), Space O(V + E)
 toArray(): [VertexKey, V | undefined][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L186)
+Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L186)
 
 Converts data structure to `[key, value]` pairs.
 
@@ -2510,7 +2510,7 @@ Time O(n), Space O(n)
 toDot(options?): string;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1143](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1143)
+Defined in: [data-structures/graph/abstract-graph.ts:1143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1143)
 
 Generate DOT language representation for Graphviz.
 
@@ -2550,7 +2550,7 @@ DOT format string.
 toVisual(options?): string;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1108](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1108)
+Defined in: [data-structures/graph/abstract-graph.ts:1108](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1108)
 
 Generate a text-based visual representation of the graph.
 
@@ -2594,7 +2594,7 @@ The visual string.
 values(): IterableIterator<V | undefined>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L53)
+Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L53)
 
 Iterate over values only.
 
@@ -2620,7 +2620,7 @@ Time O(n), Space O(1)
 static fromEntries<V>(entries): UndirectedGraph<V, undefined, UndirectedVertex<V>, UndirectedEdge<undefined>>;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:191](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L191)
+Defined in: [data-structures/graph/undirected-graph.ts:191](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L191)
 
 Construct an undirected graph from `[key, value]` entries.
 
@@ -2658,7 +2658,7 @@ Time O(V), Space O(V)
 static fromKeys<K>(keys): UndirectedGraph<K, undefined, UndirectedVertex<K>, UndirectedEdge<undefined>>;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:174](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L174)
+Defined in: [data-structures/graph/undirected-graph.ts:174](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L174)
 
 Construct an undirected graph from keys with value initializer `v => v`.
 
@@ -2701,7 +2701,7 @@ Time O(V), Space O(V)
 get protected _edgeConnector(): string;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1087](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1087)
+Defined in: [data-structures/graph/abstract-graph.ts:1087](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1087)
 
 The edge connector string used in visual output.
 Override in subclasses (e.g., '--' for undirected, '->' for directed).
@@ -2722,7 +2722,7 @@ Override in subclasses (e.g., '--' for undirected, '->' for directed).
 protected _addEdge(edge): boolean;
 ```
 
-Defined in: [data-structures/graph/undirected-graph.ts:1067](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/undirected-graph.ts#L1067)
+Defined in: [data-structures/graph/undirected-graph.ts:1103](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1103)
 
 Internal hook to attach an undirected edge into adjacency maps.
 
@@ -2756,7 +2756,7 @@ Time O(1) avg, Space O(1)
 protected _addVertex(newVertex): boolean;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1054](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1054)
+Defined in: [data-structures/graph/abstract-graph.ts:1054](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1054)
 
 Insert a pre-built vertex into the graph.
 
@@ -2790,7 +2790,7 @@ Time O(1) avg, Space O(1)
 protected _createInstance(_options?): this;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:987](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L987)
+Defined in: [data-structures/graph/abstract-graph.ts:987](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L987)
 
 Create an empty graph instance of the same concrete species.
 
@@ -2824,7 +2824,7 @@ Time O(1), Space O(1)
 protected _createLike(iter?, options?): this;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1009](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1009)
+Defined in: [data-structures/graph/abstract-graph.ts:1009](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1009)
 
 Create a same-species graph populated with entries; preserves edges among kept vertices.
 
@@ -2864,7 +2864,7 @@ Time O(V + E), Space O(V + E)
 protected _getIterator(): IterableIterator<[VertexKey, V | undefined]>;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:958](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L958)
+Defined in: [data-structures/graph/abstract-graph.ts:958](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L958)
 
 Internal iterator over `[key, value]` entries in insertion order.
 
@@ -2890,7 +2890,7 @@ Time O(V), Space O(1)
 protected _getVertex(vertexOrKey): VO | undefined;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1068](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1068)
+Defined in: [data-structures/graph/abstract-graph.ts:1068](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1068)
 
 Resolve a vertex key or instance to the concrete vertex instance.
 
@@ -2924,7 +2924,7 @@ Time O(1), Space O(1)
 protected _getVertexKey(vertexOrKey): VertexKey;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:1079](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L1079)
+Defined in: [data-structures/graph/abstract-graph.ts:1079](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1079)
 
 Resolve a vertex key from a key or vertex instance.
 
@@ -2958,7 +2958,7 @@ Time O(1), Space O(1)
 protected _snapshotOptions(): Record<string, unknown>;
 ```
 
-Defined in: [data-structures/graph/abstract-graph.ts:973](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/graph/abstract-graph.ts#L973)
+Defined in: [data-structures/graph/abstract-graph.ts:973](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L973)
 
 Capture configuration needed to reproduce the current graph.