data-structure-typed 2.6.0 → 2.6.2

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/main/src/data-structures/graph/undirected-graph.ts#L138)
+Defined in: [data-structures/graph/undirected-graph.ts:137](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L137)
 
 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/main/src/data-structures/graph/undirected-graph.ts#L152)
+Defined in: [data-structures/graph/undirected-graph.ts:151](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L151)
 
 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/main/src/data-structures/graph/abstract-graph.ts#L89)
+Defined in: [data-structures/graph/abstract-graph.ts:85](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L85)
 
 Total number of 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/main/src/data-structures/graph/abstract-graph.ts#L254)
+Defined in: [data-structures/graph/abstract-graph.ts:258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L258)
 
 ##### 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/main/src/data-structures/graph/abstract-graph.ts#L256)
+Defined in: [data-structures/graph/abstract-graph.ts:260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L260)
 
 ##### 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/main/src/data-structures/graph/abstract-graph.ts#L189)
+Defined in: [data-structures/graph/abstract-graph.ts:193](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L193)
 
 ##### 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/main/src/data-structures/graph/abstract-graph.ts#L191)
+Defined in: [data-structures/graph/abstract-graph.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L195)
 
 ##### 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/main/src/data-structures/graph/abstract-graph.ts#L705)
+Defined in: [data-structures/graph/abstract-graph.ts:677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L677)
 
 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:702](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L702)
+Defined in: [data-structures/graph/undirected-graph.ts:512](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L512)
 
 Remove all vertices and edges.
 
@@ -543,7 +543,7 @@ IGraph.clear
 clone(): this;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:522](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L522)
 
 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/main/src/data-structures/graph/undirected-graph.ts#L219)
+Defined in: [data-structures/graph/undirected-graph.ts:223](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L223)
 
 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/main/src/data-structures/graph/undirected-graph.ts#L206)
+Defined in: [data-structures/graph/undirected-graph.ts:210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L210)
 
 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:500](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L500)
+Defined in: [data-structures/graph/undirected-graph.ts:385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L385)
 
 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:388](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L388)
+Defined in: [data-structures/graph/undirected-graph.ts:312](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L312)
 
 Delete an edge by instance or by a pair of keys.
 
@@ -751,8 +751,6 @@ Removed edge or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -802,7 +800,7 @@ IGraph.deleteEdge
 deleteEdgeBetween(v1, v2): EO | undefined;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L260)
 
 Delete a single undirected edge between two vertices.
 
@@ -838,7 +836,7 @@ Time O(1) avg, Space O(1)
 deleteVertex(vertexOrKey): boolean;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:346](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L346)
 
 Delete a vertex and remove it from all neighbor lists.
 
@@ -860,8 +858,6 @@ Vertex or key.
 
 Time O(deg), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -896,7 +892,7 @@ dijkstraWithoutHeap(
 genPaths?): DijkstraResult<VO>;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L478)
 
 Dijkstra without heap (array-based selection).
 
@@ -948,7 +944,7 @@ Time O(V^2 + E), Space O(V + E)
 edgeSet(): EO[];
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:421](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L421)
 
 Unique set of undirected edges across endpoints.
 
@@ -962,8 +958,6 @@ Array of edges.
 
 Time O(E), Space O(E)
 
- *
-
 #### Example
 
 ```ts
@@ -993,7 +987,7 @@ IGraph.edgeSet
 edgesOf(vertexOrKey): EO[];
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:400](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L400)
 
 Incident undirected edges of a vertex.
 
@@ -1099,7 +1093,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/main/src/data-structures/graph/abstract-graph.ts#L897)
+Defined in: [data-structures/graph/abstract-graph.ts:847](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L847)
 
 Induced-subgraph filter: keep vertices where `predicate(key, value)` is true,
 and only keep edges whose endpoints both survive.
@@ -1146,7 +1140,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/main/src/data-structures/graph/abstract-graph.ts#L913)
+Defined in: [data-structures/graph/abstract-graph.ts:863](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L863)
 
 Preserve the old behavior: return filtered entries as an array.
 
@@ -1220,7 +1214,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/main/src/data-structures/graph/abstract-graph.ts#L798)
+Defined in: [data-structures/graph/abstract-graph.ts:760](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L760)
 
 Floyd–Warshall all-pairs shortest paths.
 
@@ -1333,7 +1327,7 @@ getAllPathsBetween(
    limit?): VO[][];
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:316](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L316)
 
 Enumerate simple paths up to a limit.
 
@@ -1379,7 +1373,7 @@ Time O(paths) worst-case exponential, Space O(V + paths)
 getBiconnectedComponents(): EO[][];
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:597](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L597)
 
 Find biconnected components using edge-stack Tarjan variant.
 A biconnected component is a maximal biconnected subgraph.
@@ -1402,7 +1396,7 @@ Time O(V + E), Space O(V + E)
 getBridges(): EO[];
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:703](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L703)
 
 Get bridges discovered by `tarjan()`.
 
@@ -1416,8 +1410,6 @@ Array of edges that are bridges.
 
 Time O(B), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1440,7 +1432,7 @@ Time O(B), Space O(1)
 getCutVertices(): VO[];
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:723](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L723)
 
 Get articulation points discovered by `tarjan()`.
 
@@ -1454,8 +1446,6 @@ Array of cut vertices.
 
 Time O(C), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1479,7 +1469,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/main/src/data-structures/graph/abstract-graph.ts#L838)
+Defined in: [data-structures/graph/abstract-graph.ts:796](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L796)
 
 Enumerate simple cycles (may be expensive).
 
@@ -1513,7 +1503,7 @@ Time exponential in worst-case, Space O(V + E)
 getDFNMap(): Map<VO, number>;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:732](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L732)
 
 DFN index map computed by `tarjan()`.
 
@@ -1535,7 +1525,7 @@ Time O(V), Space O(V)
 getEdge(v1, v2): EO | undefined;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:241](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L241)
 
 Get an undirected edge between two vertices, if present.
 
@@ -1563,8 +1553,6 @@ Edge instance or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1594,7 +1582,7 @@ IGraph.getEdge
 getEndsOfEdge(edge): [VO, VO] | undefined;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L487)
 
 Resolve an edge's two endpoints to vertex instances.
 
@@ -1634,7 +1622,7 @@ IGraph.getEndsOfEdge
 getLowMap(): Map<VO, number>;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:741](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L741)
 
 LOW link map computed by `tarjan()`.
 
@@ -1659,7 +1647,7 @@ getMinCostBetween(
    isWeight?): number | undefined;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:364](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L364)
 
 Minimum hops/weight between two vertices.
 
@@ -1709,7 +1697,7 @@ getMinPathBetween(
    isDFS?): VO[] | undefined;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:414](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L414)
 
 Minimum path (as vertex sequence) between two vertices.
 
@@ -1761,12 +1749,10 @@ 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:656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L656)
+Defined in: [data-structures/graph/undirected-graph.ts:466](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L466)
 
 UndirectedGraph connectivity and neighbors
 
- *
-
 #### Parameters
 
 ##### vertexOrKey
@@ -1831,7 +1817,7 @@ IGraph.getNeighbors
 getPathSumWeight(path): number;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:348](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L348)
 
 Sum the weights along a vertex path.
 
@@ -1865,7 +1851,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/main/src/data-structures/graph/abstract-graph.ts#L175)
+Defined in: [data-structures/graph/abstract-graph.ts:179](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L179)
 
 Get vertex instance by key.
 
@@ -1939,7 +1925,7 @@ Time O(n) generic, Space O(1)
 hasCycle(): boolean;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L667)
 
 Detect whether the graph contains a cycle.
 Uses DFS with parent tracking.
@@ -1954,8 +1940,6 @@ Uses DFS with parent tracking.
 
 Time O(V + E), Space O(V)
 
- *
-
 #### Example
 
 ```ts
@@ -1979,7 +1963,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/main/src/data-structures/graph/abstract-graph.ts#L249)
+Defined in: [data-structures/graph/abstract-graph.ts:253](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L253)
 
 Whether an edge exists between two vertices.
 
@@ -2053,7 +2037,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/main/src/data-structures/graph/abstract-graph.ts#L185)
+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)
 
 Whether a vertex exists.
 
@@ -2093,7 +2077,7 @@ IGraph.hasVertex
 isEmpty(): boolean;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:504](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L504)
 
 Whether the graph has no vertices and no edges.
 
@@ -2123,7 +2107,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/main/src/data-structures/graph/abstract-graph.ts#L215)
+Defined in: [data-structures/graph/abstract-graph.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L219)
 
 Type guard: check if a value is a valid vertex key.
 
@@ -2183,7 +2167,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/main/src/data-structures/graph/abstract-graph.ts#L928)
+Defined in: [data-structures/graph/abstract-graph.ts:878](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L878)
 
 Map entries using an implementation-specific strategy.
 
@@ -2223,7 +2207,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/main/src/data-structures/graph/abstract-graph.ts#L1183)
+Defined in: [data-structures/graph/abstract-graph.ts:984](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L984)
 
 Print the graph to console.
 
@@ -2299,7 +2283,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/main/src/data-structures/graph/abstract-graph.ts#L234)
+Defined in: [data-structures/graph/abstract-graph.ts:238](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L238)
 
 Delete multiple vertices.
 
@@ -2336,7 +2320,7 @@ setEdgeWeight(
    weight): boolean;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L298)
 
 Set the weight of an existing edge.
 
@@ -2422,7 +2406,7 @@ Time O(n), Space O(1)
 tarjan(): object;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:541](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L541)
 
 Tarjan-based bridge and articulation point detection.
 
@@ -2460,8 +2444,6 @@ lowMap: Map<VO, number>;
 
 Time O(V + E), Space O(V + E)
 
- *
-
 #### Example
 
 ```ts
@@ -2510,7 +2492,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/main/src/data-structures/graph/abstract-graph.ts#L1143)
+Defined in: [data-structures/graph/abstract-graph.ts:952](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L952)
 
 Generate DOT language representation for Graphviz.
 
@@ -2550,7 +2532,7 @@ DOT format string.
 toVisual(options?): string;
 ```
 
-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)
+Defined in: [data-structures/graph/abstract-graph.ts:920](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L920)
 
 Generate a text-based visual representation of the graph.
 
@@ -2620,7 +2602,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/main/src/data-structures/graph/undirected-graph.ts#L191)
+Defined in: [data-structures/graph/undirected-graph.ts:192](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L192)
 
 Construct an undirected graph from `[key, value]` entries.
 
@@ -2658,7 +2640,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/main/src/data-structures/graph/undirected-graph.ts#L174)
+Defined in: [data-structures/graph/undirected-graph.ts:172](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L172)
 
 Construct an undirected graph from keys with value initializer `v => v`.
 
@@ -2701,7 +2683,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/main/src/data-structures/graph/abstract-graph.ts#L1087)
+Defined in: [data-structures/graph/abstract-graph.ts:93](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L93)
 
 The edge connector string used in visual output.
 Override in subclasses (e.g., '--' for undirected, '->' for directed).
@@ -2722,7 +2704,7 @@ Override in subclasses (e.g., '--' for undirected, '->' for directed).
 protected _addEdge(edge): boolean;
 ```
 
-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)
+Defined in: [data-structures/graph/undirected-graph.ts:751](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L751)
 
 Internal hook to attach an undirected edge into adjacency maps.
 
@@ -2756,7 +2738,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/main/src/data-structures/graph/abstract-graph.ts#L1054)
+Defined in: [data-structures/graph/abstract-graph.ts:1089](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1089)
 
 Insert a pre-built vertex into the graph.
 
@@ -2790,7 +2772,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/main/src/data-structures/graph/abstract-graph.ts#L987)
+Defined in: [data-structures/graph/abstract-graph.ts:1022](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1022)
 
 Create an empty graph instance of the same concrete species.
 
@@ -2824,7 +2806,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/main/src/data-structures/graph/abstract-graph.ts#L1009)
+Defined in: [data-structures/graph/abstract-graph.ts:1044](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1044)
 
 Create a same-species graph populated with entries; preserves edges among kept vertices.
 
@@ -2864,7 +2846,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/main/src/data-structures/graph/abstract-graph.ts#L958)
+Defined in: [data-structures/graph/abstract-graph.ts:993](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L993)
 
 Internal iterator over `[key, value]` entries in insertion order.
 
@@ -2890,7 +2872,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/main/src/data-structures/graph/abstract-graph.ts#L1068)
+Defined in: [data-structures/graph/abstract-graph.ts:1103](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1103)
 
 Resolve a vertex key or instance to the concrete vertex instance.
 
@@ -2924,7 +2906,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/main/src/data-structures/graph/abstract-graph.ts#L1079)
+Defined in: [data-structures/graph/abstract-graph.ts:1114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1114)
 
 Resolve a vertex key from a key or vertex instance.
 
@@ -2958,7 +2940,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/main/src/data-structures/graph/abstract-graph.ts#L973)
+Defined in: [data-structures/graph/abstract-graph.ts:1008](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/abstract-graph.ts#L1008)
 
 Capture configuration needed to reproduce the current graph.