data-structure-typed 2.6.0 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: DirectedGraph\<V, E, VO, EO\>
 
-Defined in: [data-structures/graph/directed-graph.ts:118](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L118)
+Defined in: [data-structures/graph/directed-graph.ts:117](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L117)
 
 Directed graph implementation.
 
@@ -147,7 +147,7 @@ Concrete edge class (extends AbstractEdge<E>).
 new DirectedGraph<V, E, VO, EO>(options?): DirectedGraph<V, E, VO, EO>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:132](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L132)
+Defined in: [data-structures/graph/directed-graph.ts:131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L131)
 
 Construct a directed graph with runtime defaults.
 
@@ -181,7 +181,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.
 
@@ -263,7 +263,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
 
@@ -289,7 +289,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
 
@@ -341,7 +341,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
 
@@ -369,7 +369,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
 
@@ -407,7 +407,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.
 
@@ -495,7 +495,7 @@ Time O(V * E), Space O(V + E)
 clear(): void;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:944](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L944)
+Defined in: [data-structures/graph/directed-graph.ts:634](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L634)
 
 Remove all vertices and edges.
 
@@ -525,7 +525,7 @@ IGraph.clear
 clone(): this;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:955](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L955)
+Defined in: [data-structures/graph/directed-graph.ts:645](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L645)
 
 Deep clone as the same concrete class.
 
@@ -561,7 +561,7 @@ createEdge(
    value?): EO;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L210)
+Defined in: [data-structures/graph/directed-graph.ts:214](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L214)
 
 Create a directed edge instance. Does not insert into the graph.
 
@@ -619,7 +619,7 @@ IGraph.createEdge
 createVertex(key, value?): VO;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:197](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L197)
+Defined in: [data-structures/graph/directed-graph.ts:201](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L201)
 
 Create a directed vertex instance. Does not insert into the graph.
 
@@ -665,7 +665,7 @@ IGraph.createVertex
 degreeOf(vertexOrKey): number;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:626](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L626)
+Defined in: [data-structures/graph/directed-graph.ts:434](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L434)
 
 Degree (in + out) of a vertex.
 
@@ -705,7 +705,7 @@ IGraph.degreeOf
 deleteEdge(edgeOrSrcVertexKey, destVertexKey?): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:381](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L381)
+Defined in: [data-structures/graph/directed-graph.ts:305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L305)
 
 Delete an edge by instance or by `(srcKey, destKey)`.
 
@@ -733,8 +733,6 @@ Removed edge or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -782,7 +780,7 @@ IGraph.deleteEdge
 deleteEdgeSrcToDest(srcOrKey, destOrKey): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L290)
+Defined in: [data-structures/graph/directed-graph.ts:255](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L255)
 
 Delete edge `src -> dest` if present.
 
@@ -818,12 +816,10 @@ Time O(1) avg, Space O(1)
 deleteVertex(vertexOrKey): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:459](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L459)
+Defined in: [data-structures/graph/directed-graph.ts:344](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L344)
 
 Remove a vertex
 
- *
-
 #### Parameters
 
 ##### vertexOrKey
@@ -869,7 +865,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).
 
@@ -921,12 +917,10 @@ Time O(V^2 + E), Space O(V + E)
 edgeSet(): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:839](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L839)
+Defined in: [data-structures/graph/directed-graph.ts:567](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L567)
 
 Get all edges
 
- *
-
 #### Returns
 
 `EO`[]
@@ -960,7 +954,7 @@ IGraph.edgeSet
 edgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L656)
+Defined in: [data-structures/graph/directed-graph.ts:464](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L464)
 
 All incident edges of a vertex.
 
@@ -1066,7 +1060,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.
@@ -1113,7 +1107,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.
 
@@ -1187,7 +1181,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.
 
@@ -1300,7 +1294,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.
 
@@ -1346,7 +1340,7 @@ Time O(paths) worst-case exponential, Space O(V + paths)
 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).
 
@@ -1380,7 +1374,7 @@ Time exponential in worst-case, Space O(V + E)
 getDestinations(vertex): VO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:674](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L674)
+Defined in: [data-structures/graph/directed-graph.ts:482](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L482)
 
 Direct children reachable by one outgoing edge.
 
@@ -1410,7 +1404,7 @@ Time O(deg_out), Space O(deg_out)
 getDFNMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1069](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1069)
+Defined in: [data-structures/graph/directed-graph.ts:713](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L713)
 
 DFN index map computed by `tarjan()`.
 
@@ -1432,7 +1426,7 @@ Time O(V), Space O(V)
 getEdge(srcOrKey, destOrKey): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:265](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L265)
+Defined in: [data-structures/graph/directed-graph.ts:233](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L233)
 
 Get the unique edge from `src` to `dest`, if present.
 
@@ -1460,8 +1454,6 @@ Edge instance or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1492,7 +1484,7 @@ IGraph.getEdge
 getEndsOfEdge(edge): [VO, VO] | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:919](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L919)
+Defined in: [data-structures/graph/directed-graph.ts:609](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L609)
 
 Resolve an edge's `[src, dest]` endpoints to vertex instances.
 
@@ -1532,7 +1524,7 @@ IGraph.getEndsOfEdge
 getLowMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1078](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1078)
+Defined in: [data-structures/graph/directed-graph.ts:722](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L722)
 
 LOW link map computed by `tarjan()`.
 
@@ -1557,7 +1549,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.
 
@@ -1607,7 +1599,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.
 
@@ -1659,12 +1651,10 @@ Time O((V + E) log V) weighted / O(V + E) unweighted, Space O(V + E)
 getNeighbors(vertexOrKey): VO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L897)
+Defined in: [data-structures/graph/directed-graph.ts:588](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L588)
 
 Get outgoing neighbors
 
- *
-
 #### Parameters
 
 ##### vertexOrKey
@@ -1707,7 +1697,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.
 
@@ -1741,7 +1731,7 @@ Time O(L), Space O(1) where L is path length
 getSCCs(): Map<number, VO[]>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1134](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1134)
+Defined in: [data-structures/graph/directed-graph.ts:742](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L742)
 
 Strongly connected components computed by `tarjan()`.
 
@@ -1755,8 +1745,6 @@ Map from SCC id to vertices.
 
 Time O(#SCC + V), Space O(V)
 
- *
-
 #### Example
 
 ```ts
@@ -1780,7 +1768,7 @@ Time O(#SCC + V), Space O(V)
 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.
 
@@ -1854,7 +1842,7 @@ Time O(n) generic, Space O(1)
 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.
 
@@ -1928,7 +1916,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.
 
@@ -1968,7 +1956,7 @@ IGraph.hasVertex
 incomingEdgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:553](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L553)
+Defined in: [data-structures/graph/directed-graph.ts:397](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L397)
 
 Incoming edges of a vertex.
 
@@ -1990,8 +1978,6 @@ Array of incoming edges.
 
 Time O(deg_in), Space O(deg_in)
 
- *
-
 #### Example
 
 ```ts
@@ -2013,7 +1999,7 @@ Time O(deg_in), Space O(deg_in)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:936](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L936)
+Defined in: [data-structures/graph/directed-graph.ts:626](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L626)
 
 Whether the graph has no vertices and no edges.
 
@@ -2043,7 +2029,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.
 
@@ -2103,7 +2089,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.
 
@@ -2143,7 +2129,7 @@ Time O(n), Space O(n)
 outgoingEdgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:612](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L612)
+Defined in: [data-structures/graph/directed-graph.ts:420](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L420)
 
 Outgoing edges of a vertex.
 
@@ -2165,8 +2151,6 @@ Array of outgoing edges.
 
 Time O(deg_out), Space O(deg_out)
 
- *
-
 #### Example
 
 ```ts
@@ -2188,7 +2172,7 @@ Time O(deg_out), Space O(deg_out)
 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.
 
@@ -2264,7 +2248,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.
 
@@ -2301,7 +2285,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.
 
@@ -2387,7 +2371,7 @@ Time O(n), Space O(1)
 tarjan(): object;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1013](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1013)
+Defined in: [data-structures/graph/directed-graph.ts:667](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L667)
 
 Tarjan's algorithm for strongly connected components.
 
@@ -2419,8 +2403,6 @@ SCCs: Map<number, VO[]>;
 
 Time O(V + E), Space O(V + E)
 
- *
-
 #### Example
 
 ```ts
@@ -2472,7 +2454,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.
 
@@ -2512,7 +2494,7 @@ DOT format string.
 topologicalSort(propertyName?): (VertexKey | VO)[] | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:756](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L756)
+Defined in: [data-structures/graph/directed-graph.ts:525](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L525)
 
 Topological sort if DAG; returns `undefined` if a cycle exists.
 
@@ -2534,8 +2516,6 @@ Array of keys/vertices, or `undefined` when cycle is found.
 
 Time O(V + E), Space O(V)
 
- *
-
 #### Example
 
 ```ts
@@ -2570,7 +2550,7 @@ Time O(V + E), Space O(V)
 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.
 
@@ -2640,7 +2620,7 @@ Time O(n), Space O(1)
 static fromEntries<V>(entries): DirectedGraph<V, undefined, DirectedVertex<V>, DirectedEdge<undefined>>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:182](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L182)
+Defined in: [data-structures/graph/directed-graph.ts:183](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L183)
 
 Construct a directed graph from `[key, value]` entries.
 
@@ -2678,7 +2658,7 @@ Time O(V), Space O(V)
 static fromKeys<K>(keys): DirectedGraph<K, undefined, DirectedVertex<K>, DirectedEdge<undefined>>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:167](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L167)
+Defined in: [data-structures/graph/directed-graph.ts:166](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L166)
 
 Construct a directed graph from keys with value initializer `v => v`.
 
@@ -2721,7 +2701,7 @@ Time O(V), Space O(V)
 get protected _edgeConnector(): string;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:136](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L136)
+Defined in: [data-structures/graph/directed-graph.ts:155](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L155)
 
 The edge connector string used in visual output.
 Override in subclasses (e.g., '--' for undirected, '->' for directed).
@@ -2742,7 +2722,7 @@ Override in subclasses (e.g., '--' for undirected, '->' for directed).
 protected _addEdge(edge): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1144](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1144)
+Defined in: [data-structures/graph/directed-graph.ts:752](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L752)
 
 Internal hook to attach a directed edge into adjacency maps.
 
@@ -2776,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/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.
 
@@ -2810,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/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.
 
@@ -2844,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/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.
 
@@ -2884,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/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.
 
@@ -2910,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/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.
 
@@ -2944,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/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.
 
@@ -2978,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/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.