data-structure-typed 2.6.1 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: MapGraph\<V, E, VO, EO\>
 
-Defined in: [data-structures/graph/map-graph.ts:96](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L96)
+Defined in: [data-structures/graph/map-graph.ts:95](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L95)
 
 Directed graph variant carrying geospatial coordinates.
 
@@ -119,7 +119,7 @@ Concrete edge class (MapEdge<E>).
 new MapGraph<V, E, VO, EO>(originCoord, bottomRight?): MapGraph<V, E, VO, EO>;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:108](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L108)
+Defined in: [data-structures/graph/map-graph.ts:107](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L107)
 
 Construct a MapGraph.
 
@@ -159,7 +159,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.
 
@@ -241,7 +241,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
 
@@ -267,7 +267,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
 
@@ -319,7 +319,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
 
@@ -341,7 +341,7 @@ Defined in: [data-structures/graph/abstract-graph.ts:189](https://github.com/zrw
 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
 
@@ -373,7 +373,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.
 
@@ -461,7 +461,7 @@ Time O(V * E), Space O(V + E)
 clear(): void;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:968](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L968)
+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.
 
@@ -485,7 +485,7 @@ Time O(V + E), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:162](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L162)
+Defined in: [data-structures/graph/map-graph.ts:159](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L159)
 
 Deep clone as the same concrete class.
 
@@ -515,7 +515,7 @@ createEdge(
    value?): EO;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:153](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L153)
+Defined in: [data-structures/graph/map-graph.ts:150](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L150)
 
 Create a map edge (directed) with optional weight/value.
 
@@ -571,7 +571,7 @@ createVertex(
    long?): VO;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L135)
+Defined in: [data-structures/graph/map-graph.ts:132](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L132)
 
 Create a map vertex with optional coordinates.
 
@@ -623,7 +623,7 @@ Time O(1), Space O(1)
 degreeOf(vertexOrKey): number;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:641](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L641)
+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.
 
@@ -657,7 +657,7 @@ Time O(1) avg, Space O(1)
 deleteEdge(edgeOrSrcVertexKey, destVertexKey?): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:387](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L387)
+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)`.
 
@@ -685,8 +685,6 @@ Removed edge or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -728,7 +726,7 @@ Time O(1) avg, Space O(1)
 deleteEdgeSrcToDest(srcOrKey, destOrKey): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:293](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L293)
+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.
 
@@ -768,12 +766,10 @@ Time O(1) avg, Space O(1)
 deleteVertex(vertexOrKey): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:468](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L468)
+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
@@ -813,7 +809,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).
 
@@ -865,12 +861,10 @@ Time O(V^2 + E), Space O(V + E)
 edgeSet(): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:860](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L860)
+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`[]
@@ -898,7 +892,7 @@ Get all edges
 edgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:671](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L671)
+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.
 
@@ -998,7 +992,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.
@@ -1039,7 +1033,7 @@ Time O(V + E), Space O(V + E)
 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.
 
@@ -1113,7 +1107,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.
 
@@ -1226,7 +1220,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.
 
@@ -1272,7 +1266,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).
 
@@ -1306,7 +1300,7 @@ Time exponential in worst-case, Space O(V + E)
 getDestinations(vertex): VO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:689](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L689)
+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.
 
@@ -1340,7 +1334,7 @@ Time O(deg_out), Space O(deg_out)
 getDFNMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1096](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1096)
+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()`.
 
@@ -1366,7 +1360,7 @@ Time O(V), Space O(V)
 getEdge(srcOrKey, destOrKey): EO | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:268](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L268)
+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.
 
@@ -1394,8 +1388,6 @@ Edge instance or `undefined`.
 
 Time O(1) avg, Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1420,7 +1412,7 @@ Time O(1) avg, Space O(1)
 getEndsOfEdge(edge): [VO, VO] | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:943](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L943)
+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.
 
@@ -1454,7 +1446,7 @@ Time O(1), Space O(1)
 getLowMap(): Map<VO, number>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1105](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1105)
+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()`.
 
@@ -1483,7 +1475,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.
 
@@ -1533,7 +1525,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.
 
@@ -1585,12 +1577,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:921](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L921)
+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
@@ -1627,7 +1617,7 @@ Get outgoing neighbors
 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.
 
@@ -1661,7 +1651,7 @@ Time O(L), Space O(1) where L is path length
 getSCCs(): Map<number, VO[]>;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1164](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1164)
+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()`.
 
@@ -1675,8 +1665,6 @@ Map from SCC id to vertices.
 
 Time O(#SCC + V), Space O(V)
 
- *
-
 #### Example
 
 ```ts
@@ -1704,7 +1692,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.
 
@@ -1772,7 +1760,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.
 
@@ -1846,7 +1834,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.
 
@@ -1880,7 +1868,7 @@ Time O(1) avg, Space O(1)
 incomingEdgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:565](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L565)
+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.
 
@@ -1902,8 +1890,6 @@ Array of incoming edges.
 
 Time O(deg_in), Space O(deg_in)
 
- *
-
 #### Example
 
 ```ts
@@ -1929,7 +1915,7 @@ Time O(deg_in), Space O(deg_in)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:960](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L960)
+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.
 
@@ -1953,7 +1939,7 @@ Time O(1), Space O(1)
 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.
 
@@ -2013,7 +1999,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.
 
@@ -2053,7 +2039,7 @@ Time O(n), Space O(n)
 outgoingEdgesOf(vertexOrKey): EO[];
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:627](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L627)
+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.
 
@@ -2075,8 +2061,6 @@ Array of outgoing edges.
 
 Time O(deg_out), Space O(deg_out)
 
- *
-
 #### Example
 
 ```ts
@@ -2102,7 +2086,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.
 
@@ -2178,7 +2162,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.
 
@@ -2215,7 +2199,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.
 
@@ -2301,7 +2285,7 @@ Time O(n), Space O(1)
 tarjan(): object;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1040](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1040)
+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.
 
@@ -2333,8 +2317,6 @@ SCCs: Map<number, VO[]>;
 
 Time O(V + E), Space O(V + E)
 
- *
-
 #### Example
 
 ```ts
@@ -2390,7 +2372,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.
 
@@ -2430,7 +2412,7 @@ DOT format string.
 topologicalSort(propertyName?): (VertexKey | VO)[] | undefined;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:774](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L774)
+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.
 
@@ -2452,8 +2434,6 @@ Array of keys/vertices, or `undefined` when cycle is found.
 
 Time O(V + E), Space O(V)
 
- *
-
 #### Example
 
 ```ts
@@ -2492,7 +2472,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.
 
@@ -2562,7 +2542,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.
 
@@ -2604,7 +2584,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`.
 
@@ -2651,7 +2631,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).
@@ -2672,7 +2652,7 @@ Override in subclasses (e.g., '--' for undirected, '->' for directed).
 protected _addEdge(edge): boolean;
 ```
 
-Defined in: [data-structures/graph/directed-graph.ts:1174](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/directed-graph.ts#L1174)
+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.
 
@@ -2706,7 +2686,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.
 
@@ -2740,7 +2720,7 @@ Time O(1) avg, Space O(1)
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L181)
+Defined in: [data-structures/graph/map-graph.ts:178](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L178)
 
 Re-create a same-species MapGraph instance from snapshot options.
 
@@ -2774,7 +2754,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.
 
@@ -2814,7 +2794,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.
 
@@ -2840,7 +2820,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.
 
@@ -2874,7 +2854,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.
 
@@ -2908,7 +2888,7 @@ Time O(1), Space O(1)
 protected _snapshotOptions(): Record<string, unknown>;
 ```
 
-Defined in: [data-structures/graph/map-graph.ts:171](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L171)
+Defined in: [data-structures/graph/map-graph.ts:168](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/map-graph.ts#L168)
 
 Include `originCoord` and `bottomRight` so `clone()/filter()` preserve geospatial settings.