data-structure-typed 2.6.0 → 2.6.1

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

@@ -330,7 +330,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 add(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L343)
+Defined in: [data-structures/trie/trie.ts:346](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L346)
 
 Insert one word into the trie.
 
@@ -381,7 +381,7 @@ Time O(L), Space O(L)
 addMany(words): boolean[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L413)
+Defined in: [data-structures/trie/trie.ts:419](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L419)
 
 Insert many words from an iterable.
 
@@ -424,7 +424,7 @@ Time O(ΣL), Space O(ΣL)
 clear(): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:588](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L588)
+Defined in: [data-structures/trie/trie.ts:603](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L603)
 
 Remove all words and reset to a fresh root.
 
@@ -461,7 +461,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1025](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1025)
+Defined in: [data-structures/trie/trie.ts:1055](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1055)
 
 Deep clone this trie by iterating and inserting all words.
 
@@ -499,7 +499,7 @@ Time O(ΣL), Space O(ΣL)
 delete(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L656)
+Defined in: [data-structures/trie/trie.ts:674](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L674)
 
 Delete one word if present.
 
@@ -546,6 +546,30 @@ Time O(L), Space O(1)
 
 ***
 
+### entries()
+
+```ts
+entries(): IterableIterator<[number, string]>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L208)
+
+Return an iterator of `[index, value]` pairs (Array-compatible).
+
+#### Returns
+
+`IterableIterator`\<\[`number`, `string`\]\>
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+
+#### Inherited from
+
+[`IterableElementBase`](IterableElementBase.md).[`entries`](IterableElementBase.md#entries)
+
+***
+
 ### every()
 
 ```ts
@@ -592,7 +616,7 @@ Time O(n) in the worst case; may exit early when the first failure is found. Spa
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1080](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1080)
+Defined in: [data-structures/trie/trie.ts:1113](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1113)
 
 Filter words into a new trie of the same class.
 
@@ -773,7 +797,7 @@ Time O(n), Space O(1).
 getHeight(): number;
 ```
 
-Defined in: [data-structures/trie/trie.ts:698](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L698)
+Defined in: [data-structures/trie/trie.ts:716](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L716)
 
 Compute the height (max depth) of the trie.
 
@@ -795,7 +819,7 @@ Time O(N), Space O(H)
 getLongestCommonPrefix(): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:871](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L871)
+Defined in: [data-structures/trie/trie.ts:895](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L895)
 
 Return the longest common prefix among all words.
 
@@ -831,7 +855,7 @@ getWords(
    isAllWhenEmptyPrefix?): string[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:942](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L942)
+Defined in: [data-structures/trie/trie.ts:969](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L969)
 
 Collect words under a prefix up to a maximum count.
 
@@ -890,7 +914,7 @@ Time O(K·L), Space O(K·L)
 has(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L478)
+Defined in: [data-structures/trie/trie.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L487)
 
 Check whether a word exists.
 
@@ -937,7 +961,7 @@ Time O(L), Space O(1)
 hasCommonPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L807)
+Defined in: [data-structures/trie/trie.ts:828](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L828)
 
 Check whether the trie’s longest common prefix equals input.
 
@@ -967,7 +991,7 @@ Time O(min(H,L)), Space O(1)
 hasPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:789](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L789)
+Defined in: [data-structures/trie/trie.ts:810](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L810)
 
 Check whether any word starts with input.
 
@@ -1010,7 +1034,7 @@ Time O(L), Space O(1)
 hasPurePrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:725](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L725)
+Defined in: [data-structures/trie/trie.ts:743](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L743)
 
 Check whether input is a proper prefix of at least one word.
 
@@ -1034,13 +1058,47 @@ Time O(L), Space O(1)
 
 ***
 
+### includes()
+
+```ts
+includes(element): boolean;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L200)
+
+Check whether a value exists (Array-compatible alias for `has`).
+
+#### Parameters
+
+##### element
+
+`string`
+
+Element to search for (uses `===`).
+
+#### Returns
+
+`boolean`
+
+`true` if found.
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+
+#### Inherited from
+
+[`IterableElementBase`](IterableElementBase.md).[`includes`](IterableElementBase.md#includes)
+
+***
+
 ### isEmpty()
 
 ```ts
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:537](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L537)
+Defined in: [data-structures/trie/trie.ts:549](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L549)
 
 Check whether the trie is empty.
 
@@ -1072,6 +1130,30 @@ Time O(1), Space O(1)
 
 ***
 
+### keys()
+
+```ts
+keys(): IterableIterator<number>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L219)
+
+Return an iterator of numeric indices (Array-compatible).
+
+#### Returns
+
+`IterableIterator`\<`number`\>
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+
+#### Inherited from
+
+[`IterableElementBase`](IterableElementBase.md).[`keys`](IterableElementBase.md#keys)
+
+***
+
 ### map()
 
 #### Call Signature
@@ -1083,7 +1165,7 @@ map<RM>(
 thisArg?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1136](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1136)
+Defined in: [data-structures/trie/trie.ts:1172](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1172)
 
 Transform words
 
@@ -1135,7 +1217,7 @@ map<EM, RM>(
 thisArg?): IterableElementBase<EM, RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1149](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1149)
+Defined in: [data-structures/trie/trie.ts:1185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1185)
 
 Map words into a new trie (possibly different record type).
 
@@ -1193,7 +1275,7 @@ IterableElementBase.map
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1176](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1176)
+Defined in: [data-structures/trie/trie.ts:1212](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1212)
 
 Map words into a new trie of the same element type.
 
@@ -1233,7 +1315,7 @@ Time O(ΣL), Space O(ΣL)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L269)
+Defined in: [data-structures/base/iterable-element-base.ts:301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L301)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1291,7 +1373,7 @@ Time O(n), Space O(1). Throws if called on an empty structure without `initialVa
 reduce(callbackfn): string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L194)
+Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1313,7 +1395,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.c
 reduce(callbackfn, initialValue): string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L195)
+Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Parameters
 
@@ -1339,7 +1421,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L196)
+Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L228)
 
 ##### Type Parameters
 
@@ -1413,7 +1495,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
 toArray(): string[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L246)
+Defined in: [data-structures/base/iterable-element-base.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
 
 Materializes the elements into a new array.
 
@@ -1439,7 +1521,7 @@ Time O(n), Space O(n).
 toVisual(): string[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L258)
+Defined in: [data-structures/base/iterable-element-base.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L290)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1549,7 +1631,7 @@ Total number of elements.
 protected _caseProcess(str): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1260)
+Defined in: [data-structures/trie/trie.ts:1296](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1296)
 
 (Protected) Normalize a string according to case sensitivity.
 
@@ -1579,7 +1661,7 @@ Time O(L), Space O(L)
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1193](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1193)
+Defined in: [data-structures/trie/trie.ts:1229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1229)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -1609,7 +1691,7 @@ Time O(1), Space O(1)
 protected _createLike<RM>(elements?, options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1214](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1214)
+Defined in: [data-structures/trie/trie.ts:1250](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1250)
 
 (Protected) Create a like-kind trie and seed it from an iterable.
 
@@ -1651,7 +1733,7 @@ Time O(ΣL), Space O(ΣL)
 protected _getIterator(): IterableIterator<string>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1240](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1240)
+Defined in: [data-structures/trie/trie.ts:1276](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1276)
 
 (Protected) Iterate all words in lexicographic order of edges.
 
@@ -1677,7 +1759,7 @@ Time O(ΣL), Space O(H)
 protected _spawnLike<RM>(options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1230](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1230)
+Defined in: [data-structures/trie/trie.ts:1266](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1266)
 
 (Protected) Spawn an empty like-kind trie instance.
 

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

@@ -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:717](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L717)
 
 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:727](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L727)
 
 Deep clone as the same concrete class.
 
@@ -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:509](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L509)
 
 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:394](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L394)
 
 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: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:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L298)
 
 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: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:468](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L468)
 
 Delete a vertex and remove it from all neighbor lists.
 
@@ -948,7 +948,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:584](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L584)
 
 Unique set of undirected edges across endpoints.
 
@@ -993,7 +993,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:524](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L524)
 
 Incident undirected edges of a vertex.
 
@@ -1379,7 +1379,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:850](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L850)
 
 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: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:1043](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1043)
 
 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: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:1102](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1102)
 
 Get articulation points discovered by `tarjan()`.
 
@@ -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: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:1111](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1111)
 
 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: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:276](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L276)
 
 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: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:692](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L692)
 
 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: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:1120](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1120)
 
 LOW link map computed by `tarjan()`.
 
@@ -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: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:671](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L671)
 
 UndirectedGraph connectivity and neighbors
 
@@ -1939,7 +1939,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:966](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L966)
 
 Detect whether the graph contains a cycle.
 Uses DFS with parent tracking.
@@ -2093,7 +2093,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:709](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L709)
 
 Whether the graph has no vertices and no edges.
 
@@ -2422,7 +2422,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:785](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L785)
 
 Tarjan-based bridge and articulation point detection.
 
@@ -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: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:1130](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/graph/undirected-graph.ts#L1130)
 
 Internal hook to attach an undirected edge into adjacency maps.
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "2.6.0",
+  "version": "2.6.1",
   "description": "Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.",
   "browser": "dist/umd/data-structure-typed.min.js",
   "umd:main": "dist/umd/data-structure-typed.min.js",
@@ -128,49 +128,6 @@
     "node": ">=12.20.0",
     "npm": ">=6.14.0"
   },
-  "scripts": {
-    "build": "npm run build:node && npm run build:types && npm run build:umd",
-    "build:node": "tsup",
-    "build:umd": "tsup --config tsup.umd.config.js",
-    "build:types": "rm -rf dist/types && tsc -p tsconfig.types.json",
-    "build:leetcode": "tsup --config tsup.leetcode.config.js",
-    "build:typedoc-plugin": "tsc scripts/typedoc-plugin-example-rewrite.ts --outDir scripts --esModuleInterop --module commonjs --target es2020 --moduleResolution node --skipLibCheck",
-    "gen:examples": "ts-node scripts/test-to-example.ts",
-    "generate:schema": "ts-node scripts/generate-schema.ts",
-    "test": "jest --runInBand",
-    "test:coverage": "jest --runInBand --coverage",
-    "test:integration": "npm run update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.test.ts && node test/integration/compile.mjs",
-    "test:perf": "npm run build && NODE_OPTIONS='--expose-gc --max-old-space-size=8192' node test/performance/benchmark-runner-enhanced.mjs",
-    "test:perf:report": "node test/performance/reportor-enhanced.mjs",
-    "check": "npm run check:src && npm run check:test",
-    "check:src": "tsc --noEmit",
-    "check:test": "tsc -p tsconfig.test.json --noEmit",
-    "check:circular-refs": "dependency-cruiser src",
-    "lint": "npm run lint:src && npm run lint:test",
-    "lint:src": "eslint --fix 'src/**/*.{js,ts}'",
-    "lint:test": "eslint --fix 'test/**/*.{js,ts}'",
-    "format": "npm run format:src && npm run format:test",
-    "format:src": "prettier --write 'src/**/*.{js,ts}'",
-    "format:test": "prettier --write 'test/**/*.{js,ts}'",
-    "inspect": "npm run build && npm run check && npm run lint",
-    "ci": "env && git fetch --tags && npm run update:subs && npm run inspect && npm run test:coverage && npm run changelog",
-    "docs:sync": "node scripts/sync-docs-to-site.mjs",
-    "docs:api": "npm run gen:examples && npm run build:typedoc-plugin && cd docs-site-docusaurus && npx typedoc --options typedoc.json && node sort-protected.mjs",
-    "docs:dev": "cd docs-site-docusaurus && npm run start",
-    "docs:build": "cd docs-site-docusaurus && rm -rf docs/api && npx typedoc --options typedoc.json && node sort-protected.mjs && npm run build",
-    "docs:preview": "cd docs-site-docusaurus && npm run serve",
-    "update:subs": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed data-structure-typed --save-dev",
-    "install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
-    "copy:to-subs": "sh scripts/copy_to_all_subs.sh",
-    "publish:subs": "npm run copy:to-subs && sh scripts/publish_all_subs.sh",
-    "publish:docs": "sh scripts/publish_docs.sh",
-    "publish:all": "npm run ci && npm publish && npm run publish:docs && npm run check:exist-latest && npm run publish:subs",
-    "check:exist-latest": "sh scripts/check_exist_remotely.sh",
-    "changelog": "auto-changelog",
-    "coverage:badge": "istanbul-badges-readme",
-    "toc": "doctoc README.md",
-    "prepare": "husky"
-  },
   "repository": {
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
@@ -290,5 +247,47 @@
     "UMD",
     "collection",
     "sorted collection"
-  ]
-}
+  ],
+  "scripts": {
+    "build": "pnpm build:node && pnpm build:types && pnpm build:umd",
+    "build:node": "tsup",
+    "build:umd": "tsup --config tsup.umd.config.js",
+    "build:types": "rm -rf dist/types && tsc -p tsconfig.types.json",
+    "build:leetcode": "tsup --config tsup.leetcode.config.js",
+    "build:typedoc-plugin": "tsc scripts/typedoc-plugin-example-rewrite.ts --outDir scripts --esModuleInterop --module commonjs --target es2020 --moduleResolution node --skipLibCheck",
+    "gen:examples": "ts-node scripts/test-to-example.ts",
+    "generate:schema": "ts-node scripts/generate-schema.ts",
+    "test": "jest --runInBand",
+    "test:coverage": "jest --runInBand --coverage",
+    "test:integration": "pnpm update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.test.ts && node test/integration/compile.mjs",
+    "test:perf": "pnpm build && NODE_OPTIONS='--expose-gc --max-old-space-size=8192' node test/performance/benchmark-runner-enhanced.mjs",
+    "test:perf:report": "node test/performance/reportor-enhanced.mjs",
+    "check": "pnpm check:src && pnpm check:test",
+    "check:src": "tsc --noEmit",
+    "check:test": "tsc -p tsconfig.test.json --noEmit",
+    "check:circular-refs": "dependency-cruiser src",
+    "lint": "pnpm lint:src && pnpm lint:test",
+    "lint:src": "eslint --fix 'src/**/*.{js,ts}'",
+    "lint:test": "eslint --fix 'test/**/*.{js,ts}'",
+    "format": "pnpm format:src && pnpm format:test",
+    "format:src": "prettier --write 'src/**/*.{js,ts}'",
+    "format:test": "prettier --write 'test/**/*.{js,ts}'",
+    "inspect": "pnpm build && pnpm check && pnpm lint",
+    "ci": "env && git fetch --tags && pnpm update:subs && pnpm inspect && pnpm test:coverage && pnpm changelog",
+    "docs:sync": "node scripts/sync-docs-to-site.mjs",
+    "docs:api": "pnpm gen:examples && pnpm build:typedoc-plugin && cd docs-site-docusaurus && npx typedoc --options typedoc.json && node sort-protected.mjs",
+    "docs:dev": "cd docs-site-docusaurus && pnpm start",
+    "docs:build": "cd docs-site-docusaurus && rm -rf docs/api && npx typedoc --options typedoc.json && node sort-protected.mjs && pnpm build",
+    "docs:preview": "cd docs-site-docusaurus && pnpm serve",
+    "update:subs": "pnpm add avl-tree-typed binary-tree-typed bst-typed heap-typed data-structure-typed --save-dev",
+    "install:all-subs": "pnpm add avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
+    "copy:to-subs": "sh scripts/copy_to_all_subs.sh",
+    "publish:subs": "pnpm copy:to-subs && sh scripts/publish_all_subs.sh",
+    "publish:docs": "sh scripts/publish_docs.sh",
+    "publish:all": "pnpm install --frozen-lockfile && pnpm publish && pnpm publish:docs && pnpm check:exist-latest && pnpm publish:subs",
+    "check:exist-latest": "sh scripts/check_exist_remotely.sh",
+    "changelog": "auto-changelog",
+    "coverage:badge": "istanbul-badges-readme",
+    "toc": "doctoc README.md"
+  }
+}