typescript-dsa-stl 2.0.1 → 2.1.0

package/README.md

@@ -1,354 +1,421 @@
-# TypeScript_DSA
-
-**This is the GitHub repository** for the npm package **[typescript-dsa-stl](https://www.npmjs.com/package/typescript-dsa-stl)**.
-
-STL-style data structures and algorithms for TypeScript: **Vector**, **Stack**, **Queue**, **List**, **PriorityQueue**, **OrderedMap** (Map), **UnorderedMap**, **OrderedSet** (Set), **UnorderedSet**, **OrderedMultiMap**, **OrderedMultiSet**, and algorithms (`sort`, `binarySearch`, `lowerBound`, `min`, `max`, etc.). Install from npm to use in your project; this repo holds the source code.
-
----
-
-## Install
-
-```bash
-npm install typescript-dsa-stl
-```
-
----
-
-## Quick start
-
-```ts
-import {
-  Vector,
-  Stack,
-  Queue,
-  List,
-  PriorityQueue,
-  OrderedMap,
-  UnorderedMap,
-  OrderedSet,
-  UnorderedSet,
-  OrderedMultiMap,
-  OrderedMultiSet,
-  sort,
-  find,
-  binarySearch,
-  min,
-  max,
-  clamp,
-  range,
-} from 'typescript-dsa-stl';
-
-// Collections
-const vec = new Vector<number>([1, 2, 3]);
-vec.push(4);
-console.log(vec.back()); // 4
-
-const stack = new Stack<string>();
-stack.push('a');
-stack.push('b');
-console.log(stack.top()); // 'b'
-
-const queue = new Queue<number>();
-queue.enqueue(1);
-queue.enqueue(2);
-console.log(queue.front()); // 1
-
-const list = new List<number>();
-list.pushBack(10);
-const node = list.pushBack(20);
-list.insertBefore(node, 15);
-console.log(list.toArray()); // [10, 15, 20]
-
-// PriorityQueue (max-heap by default)
-const pq = new PriorityQueue<number>();
-pq.push(3); pq.push(1); pq.push(4);
-console.log(pq.top()); // 4
-pq.pop();
-
-// OrderedMap (keys sorted), UnorderedMap (hash)
-const map = new UnorderedMap<string, number>();
-map.set('a', 1); map.set('b', 2);
-console.log(map.get('a')); // 1
-
-// OrderedSet (sorted unique), UnorderedSet (hash)
-const set = new UnorderedSet<number>([1, 2, 2, 3]);
-console.log(set.size); // 3
-
-// OrderedMultiSet (sorted, duplicates allowed)
-const multiSet = new OrderedMultiSet<number>();
-multiSet.add(3); multiSet.add(1); multiSet.add(2); multiSet.add(2);
-console.log(multiSet.toArray()); // [1, 2, 2, 3]
-console.log(multiSet.count(2));  // 2
-
-// OrderedMultiMap (one key → multiple values, keys sorted)
-const multiMap = new OrderedMultiMap<string, number>();
-multiMap.set('scores', 90); multiMap.set('scores', 85); multiMap.set('scores', 95);
-console.log(multiMap.getAll('scores')); // [90, 85, 95]
-
-// Algorithms (work on arrays and iterables)
-const arr = [3, 1, 4, 1, 5];
-sort(arr);               // [1, 1, 3, 4, 5]
-find(arr, (n) => n > 3); // 4
-min(arr);                // 1
-max(arr);                // 5
-
-const sorted = [1, 2, 4, 4, 5];
-binarySearch(sorted, 4); // 2
-lowerBound(sorted, 4);   // 2
-upperBound(sorted, 4);   // 4
-
-// Utils
-clamp(42, 0, 10);       // 10
-range(0, 5);            // [0, 1, 2, 3, 4]
-```
-
-### 2D and 3D vectors (like C++ `vector<vector<int>>`)
-
-`Vector<T>` is generic, so you can nest it for 2D/3D grids:
-
-| C++ | TypeScript |
-|-----|------------|
-| `vector<int>` | `Vector<number>` |
-| `vector<vector<int>>` | `Vector<Vector<number>>` |
-| `vector<vector<vector<int>>>` | `Vector<Vector<Vector<number>>>` |
-
-**2D example:**
-
-```ts
-import { Vector } from 'typescript-dsa-stl';
-
-const grid = new Vector<Vector<number>>();
-
-const row0 = new Vector<number>([1, 2, 3]);
-const row1 = new Vector<number>([4, 5, 6]);
-grid.push(row0);
-grid.push(row1);
-
-grid.at(0).at(1);   // 2  (first row, second column)
-grid.at(1).at(0);   // 4  (second row, first column)
-
-grid.at(0).set(1, 99);
-grid.at(0).push(10);
-```
-
-**3D example:**
-
-```ts
-const cube = new Vector<Vector<Vector<number>>>();
-
-const layer0 = new Vector<Vector<number>>();
-layer0.push(new Vector<number>([1, 2]));
-layer0.push(new Vector<number>([3, 4]));
-cube.push(layer0);
-
-cube.at(0).at(1).at(0);  // 3  (layer 0, row 1, col 0)
-```
-
-### Graph adjacency list (like C++ `vector<vector<type>> graph(n)`)
-
-You can model C++-style adjacency lists using the graph types and helpers exported from `typescript-dsa-stl/collections` (or the main package).
-
-#### Unweighted adjacency list
-
-C++:
-
-```cpp
-int n = 5;
-vector<vector<int>> graph(n);
-graph[u].push_back(v);   // or graph[u].pb(v);
-```
-
-TypeScript (manual `push`):
-
-```ts
-import type { AdjacencyList } from 'typescript-dsa-stl/collections';
-
-const n = 5;
-// number of vertices = n, initially all neighbors empty
-const graph: AdjacencyList<number> = Array.from({ length: n }, () => []);
-
-// C++: graph[u].push_back(v);
-graph[u].push(v);
-
-// Iteration is the same idea as in C++
-for (const v of graph[u]) {
-  // neighbor v
-}
-```
-
-TypeScript (with helpers `addEdge` / `deleteEdge`):
-
-```ts
-import type { AdjacencyList } from 'typescript-dsa-stl/collections';
-import { addEdge, deleteEdge } from 'typescript-dsa-stl/collections';
-
-const n = 5;
-const graph: AdjacencyList<number> = Array.from({ length: n }, () => []);
-
-addEdge(graph, u, v);        // add u -> v
-deleteEdge(graph, u, v);     // remove all edges u -> v
-```
-
-#### Weighted adjacency list
-
-In C++ you might write:
-
-```cpp
-int n = 5;
-vector<vector<pair<int,int>>> graph(n);
-graph[u].push_back({v, w});   // edge u -> v with weight w
-```
-
-In TypeScript, use `WeightedEdge` and `WeightedAdjacencyList`:
-
-```ts
-import type {
-  WeightedEdge,
-  WeightedAdjacencyList,
-} from 'typescript-dsa-stl/collections';
-
-const n = 5;
-const graph: WeightedAdjacencyList<number, number> =
-  Array.from({ length: n }, () => []);
-
-// C++: graph[u].push_back({v, w});
-graph[u].push({ to: v, weight: w });
-
-// When iterating, you get both neighbor and weight
-for (const { to, weight } of graph[u]) {
-  // edge u -> to with cost = weight
-}
-
-// If you prefer a different vertex or weight type, just change the generics:
-// const graph: WeightedAdjacencyList<string, bigint> = ...
-```
-
-Or with the helper functions `addEdge` / `deleteEdge`:
-
-```ts
-import type { WeightedAdjacencyList } from 'typescript-dsa-stl/collections';
-import { addEdge, deleteEdge } from 'typescript-dsa-stl/collections';
-
-const n = 5;
-const graph: WeightedAdjacencyList<number, number> =
-  Array.from({ length: n }, () => []);
-
-addEdge(graph, u, v, w);         // add u -> v with weight w
-deleteEdge(graph, u, v, w);      // delete all edges u -> v with weight w
-```
-
-#### Graph adjacency list — use cases
-
-Use an **unweighted** graph (adjacency list) when you only care about connectivity; use a **weighted** graph when edges have costs (distance, time, capacity).
-
-| Use case | When to use |
-|----------|-------------|
-| **BFS / DFS, connectivity** | Unweighted: shortest path in terms of hop count, connected components, cycle detection. |
-| **Shortest path (Dijkstra), MST** | Weighted: edge weights as distances or costs; run Dijkstra, Prim, or Kruskal on the list. |
-| **Social / dependency graphs** | Unweighted or weighted: followers, dependencies (e.g. build order), recommendation graphs. |
-| **Grid / game graphs** | Unweighted: 4- or 8-neighbor grids; weighted if movement costs differ per cell. |
-| **Network / flow** | Weighted: capacities or latencies on edges for max-flow or routing. |
-
----
-
-## API overview
-
-| Module | Exports |
-|--------|--------|
-| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet`, `WeightedEdge`, `AdjacencyList`, `WeightedAdjacencyList`, `addEdge`, `deleteEdge` |
-| **Algorithms** | `sort`, `find`, `findIndex`, `transform`, `filter`, `reduce`, `reverse`, `unique`, `binarySearch`, `lowerBound`, `upperBound`, `min`, `max`, `partition` |
-| **Utils** | `clamp`, `range`, `noop`, `identity`, `swap` |
-| **Types** | `Comparator`, `Predicate`, `UnaryFn`, `Reducer`, `IterableLike`, `toArray` |
-
-### Subpath imports (tree-shaking)
-
-```ts
-import { Vector, Stack } from 'typescript-dsa-stl/collections';
-import { sort, binarySearch } from 'typescript-dsa-stl/algorithms';
-import { clamp, range } from 'typescript-dsa-stl/utils';
-import type { Comparator } from 'typescript-dsa-stl/types';
-```
-
----
-
-## Data structures
-
-| Structure | Access | Insert end | Insert middle | Remove end | Remove middle |
-|-----------|--------|------------|---------------|------------|---------------|
-| **Vector** | O(1) | O(1)* | O(n) | O(1) | O(n) |
-| **Stack** | — | O(1) | — | O(1) | — |
-| **Queue** | — | O(1)* | — | O(1)* | — |
-| **List** | O(n) | O(1) | O(1)** | O(1) | O(1)** |
-| **PriorityQueue** | — | O(log n) | — | O(log n) | — |
-| **OrderedMap** (Map) | O(log n) get | O(log n) set | — | O(log n) delete | — |
-| **UnorderedMap** | O(1)* get/set | O(1)* | — | O(1)* delete | — |
-| **OrderedSet** (Set) | O(log n) has | O(log n) add | — | O(log n) delete | — |
-| **UnorderedSet** | O(1)* has/add | O(1)* | — | O(1)* delete | — |
-| **OrderedMultiMap** | O(log n) get | O(log n) set | — | O(log n) delete | — |
-| **OrderedMultiSet** | O(log n) has/count | O(log n) add | — | O(log n) delete | — |
-
-\* Amortized (hash).  
-\** At a known node.
-
----
-
-## OrderedMultiMap and OrderedMultiSet — use cases
-
-**OrderedMultiSet** is a sorted collection that allows duplicate elements (like C++ `std::multiset`). Use it when you need ordering and multiple copies of the same value.
-
-| Use case | Example |
-|----------|---------|
-| **Sorted runs / leaderboard with ties** | Store scores; multiple users can have the same score. Iterate in sorted order, use `count(score)` for ties. |
-| **Event timeline with repeated timestamps** | Add events by time; several events can share the same time. `add(timestamp)`, iterate in order. |
-| **K-th smallest in a multiset** | Keep elements sorted; k-th element is at index `k - 1` in iteration. |
-| **Range counts** | Combined with binary search ideas: count elements in `[low, high]` using `count` and iteration. |
-
-**OrderedMultiMap** maps one key to multiple values while keeping keys sorted (like C++ `std::multimap`). Use it when a key can have several associated values and you need key order.
-
-| Use case | Example |
-|----------|---------|
-| **Inverted index** | Key = term, values = document IDs containing that term. `set(term, docId)` for each occurrence; `getAll(term)` returns all doc IDs. |
-| **Grouping by key** | Key = category, values = items. `set(category, item)`; iterate keys in order, use `getAll(key)` per group. |
-| **One-to-many relations** | Key = user ID, values = session IDs. `set(userId, sessionId)`; `getAll(userId)` lists all sessions. |
-| **Time-series by bucket** | Key = time bucket, values = events. Sorted keys give chronological buckets; `getAll(bucket)` gets events in that bucket. |
-
-### OrderedMultiSet example
-
-```ts
-import { OrderedMultiSet } from 'typescript-dsa-stl';
-
-const scores = new OrderedMultiSet<number>();
-scores.add(85); scores.add(92); scores.add(85); scores.add(78);
-console.log(scores.toArray());   // [78, 85, 85, 92]
-console.log(scores.count(85));   // 2
-scores.delete(85);               // remove one 85
-console.log(scores.count(85));   // 1
-scores.deleteAll(85);            // remove all 85s
-```
-
-### OrderedMultiMap example
-
-```ts
-import { OrderedMultiMap } from 'typescript-dsa-stl';
-
-const index = new OrderedMultiMap<string, number>();  // term -> doc IDs
-index.set('typescript', 1); index.set('typescript', 3); index.set('stl', 2);
-console.log(index.getAll('typescript'));  // [1, 3]
-console.log(index.get('stl'));            // 2
-for (const [key, value] of index) {
-  console.log(key, value);               // keys in sorted order
-}
-```
-
----
-
-## For maintainers
-
-- **Build:** `npm run build` (also runs before `npm publish` via `prepublishOnly`)
-- **Publish:** `npm publish` (use `npm publish --access public` for a scoped package name)
-
----
-
-## License
-
-MIT
+# TypeScript_DSA
+
+**This is the GitHub repository** for the npm package **[typescript-dsa-stl](https://www.npmjs.com/package/typescript-dsa-stl)**.
+
+STL-style data structures and algorithms for TypeScript: **Vector**, **Stack**, **Queue**, **List**, **PriorityQueue**, **OrderedMap** (Map), **UnorderedMap**, **OrderedSet** (Set), **UnorderedSet**, **OrderedMultiMap**, **OrderedMultiSet**, and algorithms (`sort`, `binarySearch`, `lowerBound`, `min`, `max`, etc.). Install from npm to use in your project; this repo holds the source code.
+
+---
+
+## Install
+
+```bash
+npm install typescript-dsa-stl
+```
+
+---
+
+## Quick start
+
+```ts
+import {
+  Vector,
+  Stack,
+  Queue,
+  List,
+  PriorityQueue,
+  OrderedMap,
+  UnorderedMap,
+  OrderedSet,
+  UnorderedSet,
+  OrderedMultiMap,
+  OrderedMultiSet,
+  sort,
+  find,
+  binarySearch,
+  min,
+  max,
+  clamp,
+  range,
+} from 'typescript-dsa-stl';
+
+// Collections
+const vec = new Vector<number>([1, 2, 3]);
+vec.push(4);
+console.log(vec.back()); // 4
+
+const stack = new Stack<string>();
+stack.push('a');
+stack.push('b');
+console.log(stack.top()); // 'b'
+
+const queue = new Queue<number>();
+queue.enqueue(1);
+queue.enqueue(2);
+console.log(queue.front()); // 1
+
+const list = new List<number>();
+list.pushBack(10);
+const node = list.pushBack(20);
+list.insertBefore(node, 15);
+console.log(list.toArray()); // [10, 15, 20]
+
+// PriorityQueue (max-heap by default)
+const pq = new PriorityQueue<number>();
+pq.push(3); pq.push(1); pq.push(4);
+console.log(pq.top()); // 4
+pq.pop();
+
+// OrderedMap (keys sorted), UnorderedMap (hash)
+const map = new UnorderedMap<string, number>();
+map.set('a', 1); map.set('b', 2);
+console.log(map.get('a')); // 1
+
+// OrderedSet (sorted unique), UnorderedSet (hash)
+const set = new UnorderedSet<number>([1, 2, 2, 3]);
+console.log(set.size); // 3
+
+// OrderedMultiSet (sorted, duplicates allowed)
+const multiSet = new OrderedMultiSet<number>();
+multiSet.add(3); multiSet.add(1); multiSet.add(2); multiSet.add(2);
+console.log(multiSet.toArray()); // [1, 2, 2, 3]
+console.log(multiSet.count(2));  // 2
+
+// OrderedMultiMap (one key → multiple values, keys sorted)
+const multiMap = new OrderedMultiMap<string, number>();
+multiMap.set('scores', 90); multiMap.set('scores', 85); multiMap.set('scores', 95);
+console.log(multiMap.getAll('scores')); // [90, 85, 95]
+
+// Algorithms (work on arrays and iterables)
+const arr = [3, 1, 4, 1, 5];
+sort(arr);               // [1, 1, 3, 4, 5]
+find(arr, (n) => n > 3); // 4
+min(arr);                // 1
+max(arr);                // 5
+
+const sorted = [1, 2, 4, 4, 5];
+binarySearch(sorted, 4); // 2
+lowerBound(sorted, 4);   // 2
+upperBound(sorted, 4);   // 4
+
+// Utils
+clamp(42, 0, 10);       // 10
+range(0, 5);            // [0, 1, 2, 3, 4]
+```
+
+### 2D and 3D vectors (like C++ `vector<vector<int>>`)
+
+`Vector<T>` is generic, so you can nest it for 2D/3D grids:
+
+| C++ | TypeScript |
+|-----|------------|
+| `vector<int>` | `Vector<number>` |
+| `vector<vector<int>>` | `Vector<Vector<number>>` |
+| `vector<vector<vector<int>>>` | `Vector<Vector<Vector<number>>>` |
+
+**2D example:**
+
+```ts
+import { Vector } from 'typescript-dsa-stl';
+
+const grid = new Vector<Vector<number>>();
+
+const row0 = new Vector<number>([1, 2, 3]);
+const row1 = new Vector<number>([4, 5, 6]);
+grid.push(row0);
+grid.push(row1);
+
+grid.at(0).at(1);   // 2  (first row, second column)
+grid.at(1).at(0);   // 4  (second row, first column)
+
+grid.at(0).set(1, 99);
+grid.at(0).push(10);
+```
+
+**3D example:**
+
+```ts
+const cube = new Vector<Vector<Vector<number>>>();
+
+const layer0 = new Vector<Vector<number>>();
+layer0.push(new Vector<number>([1, 2]));
+layer0.push(new Vector<number>([3, 4]));
+cube.push(layer0);
+
+cube.at(0).at(1).at(0);  // 3  (layer 0, row 1, col 0)
+```
+
+### Graph adjacency list (like C++ `vector<vector<type>> graph(n)`)
+
+You can model C++-style adjacency lists using the graph types and helpers exported from `typescript-dsa-stl/collections` (or the main package).
+
+#### Unweighted adjacency list
+
+C++:
+
+```cpp
+int n = 5;
+vector<vector<int>> graph(n);
+graph[u].push_back(v);   // or graph[u].pb(v);
+```
+
+TypeScript (easy declaration with `createAdjacencyList`):
+
+```ts
+import { createAdjacencyList } from 'typescript-dsa-stl/collections';
+
+const n = 5;
+const graph = createAdjacencyList(n);   // empty graph with n vertices
+
+// C++: graph[u].push_back(v);
+graph[u].push(v);
+
+// Iteration is the same idea as in C++
+for (const v of graph[u]) {
+  // neighbor v
+}
+```
+
+Or with helpers `addEdge` / `deleteEdge`:
+
+```ts
+import { createAdjacencyList, addEdge, deleteEdge } from 'typescript-dsa-stl/collections';
+
+const graph = createAdjacencyList(5);
+
+addEdge(graph, u, v);        // add u -> v
+deleteEdge(graph, u, v);     // remove all edges u -> v
+```
+
+#### Weighted adjacency list
+
+In C++ you might write:
+
+```cpp
+int n = 5;
+vector<vector<pair<int,int>>> graph(n);
+graph[u].push_back({v, w});   // edge u -> v with weight w
+```
+
+In TypeScript, use `createWeightedAdjacencyList` for easy declaration:
+
+```ts
+import { createWeightedAdjacencyList } from 'typescript-dsa-stl/collections';
+
+const n = 5;
+const graph = createWeightedAdjacencyList(n);   // empty weighted graph with n vertices
+
+// C++: graph[u].push_back({v, w});
+graph[u].push({ to: v, weight: w });
+
+// When iterating, you get both neighbor and weight
+for (const { to, weight } of graph[u]) {
+  // edge u -> to with cost = weight
+}
+```
+
+Or with the helper functions `addEdge` / `deleteEdge`:
+
+```ts
+import { createWeightedAdjacencyList, addEdge, deleteEdge } from 'typescript-dsa-stl/collections';
+
+const graph = createWeightedAdjacencyList(5);
+
+addEdge(graph, u, v, w);         // add u -> v with weight w
+deleteEdge(graph, u, v, w);      // delete all edges u -> v with weight w
+```
+
+#### Graph adjacency list — use cases
+
+Use an **unweighted** graph (adjacency list) when you only care about connectivity; use a **weighted** graph when edges have costs (distance, time, capacity).
+
+| Use case | When to use |
+|----------|-------------|
+| **BFS / DFS, connectivity** | Unweighted: shortest path in terms of hop count, connected components, cycle detection. |
+| **Shortest path (Dijkstra), MST** | Weighted: edge weights as distances or costs; run Dijkstra, Prim, or Kruskal on the list. |
+| **Social / dependency graphs** | Unweighted or weighted: followers, dependencies (e.g. build order), recommendation graphs. |
+| **Grid / game graphs** | Unweighted: 4- or 8-neighbor grids; weighted if movement costs differ per cell. |
+| **Network / flow** | Weighted: capacities or latencies on edges for max-flow or routing. |
+
+#### Disjoint Set Union (Union-Find)
+
+Use Union-Find (DSU) to compute connected components efficiently. It merges endpoints of every edge in the adjacency list, so for directed graphs it returns weak connectivity components.
+
+```ts
+import { createAdjacencyList, connectedComponents } from 'typescript-dsa-stl';
+
+const n = 5;
+const graph = createAdjacencyList(n);
+graph[0].push(1);
+graph[1].push(0);
+graph[3].push(4);
+graph[4].push(3);
+
+const comps = connectedComponents(n, graph);
+// e.g. [[0, 1], [2], [3, 4]]
+```
+
+##### Traverse the result
+
+`connectedComponents(n, adj)` returns `number[][]` where each inner array is a component (list of vertices).
+
+```ts
+// 1) Iterate each component
+for (const comp of comps) {
+  // comp is like [v0, v1, ...]
+  for (const v of comp) {
+    // do something with vertex v
+  }
+}
+
+// 2) Component sizes
+const sizes = comps.map(comp => comp.length);
+```
+
+#### Kruskal MST (uses DSU)
+
+For a weighted graph, `kruskalMST` builds a Minimum Spanning Tree (MST) using DSU.
+
+```ts
+import {
+  createWeightedAdjacencyList,
+  addEdge,
+  kruskalMST,
+} from 'typescript-dsa-stl';
+
+const n = 4;
+const wGraph = createWeightedAdjacencyList(n);
+
+// Add undirected edges by adding both directions.
+addEdge(wGraph, 0, 1, 1); addEdge(wGraph, 1, 0, 1);
+addEdge(wGraph, 0, 2, 4); addEdge(wGraph, 2, 0, 4);
+addEdge(wGraph, 1, 2, 2); addEdge(wGraph, 2, 1, 2);
+addEdge(wGraph, 1, 3, 3); addEdge(wGraph, 3, 1, 3);
+
+const { edges, totalWeight } = kruskalMST(n, wGraph, { undirected: true });
+// edges: MST edges (chosen by weight), totalWeight: sum of weights
+```
+
+##### Traverse the MST
+
+`kruskalMST(...)` returns `{ edges, totalWeight }`. To traverse the MST like a graph, convert `edges` into an adjacency list:
+
+```ts
+import { createWeightedAdjacencyList } from 'typescript-dsa-stl/collections';
+
+const mstAdj = createWeightedAdjacencyList(n);
+
+for (const { u, v, weight } of edges) {
+  // MST is undirected (we used { undirected: true })
+  mstAdj[u].push({ to: v, weight });
+  mstAdj[v].push({ to: u, weight });
+}
+
+// Example: iterate neighbors of vertex 0 in the MST
+for (const { to, weight } of mstAdj[0]) {
+  // visit edge 0 -> to (weight)
+}
+```
+
+---
+
+## API overview
+
+| Module | Exports |
+|--------|--------|
+| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet`, `WeightedEdge`, `AdjacencyList`, `WeightedAdjacencyList`, `createAdjacencyList`, `createWeightedAdjacencyList`, `addEdge`, `deleteEdge` |
+| **Algorithms** | `sort`, `find`, `findIndex`, `transform`, `filter`, `reduce`, `reverse`, `unique`, `binarySearch`, `lowerBound`, `upperBound`, `min`, `max`, `partition`, `DisjointSetUnion`, `connectedComponents`, `kruskalMST` |
+| **Utils** | `clamp`, `range`, `noop`, `identity`, `swap` |
+| **Types** | `Comparator`, `Predicate`, `UnaryFn`, `Reducer`, `IterableLike`, `toArray` |
+
+### Subpath imports (tree-shaking)
+
+```ts
+import { Vector, Stack } from 'typescript-dsa-stl/collections';
+import { sort, binarySearch } from 'typescript-dsa-stl/algorithms';
+import { clamp, range } from 'typescript-dsa-stl/utils';
+import type { Comparator } from 'typescript-dsa-stl/types';
+```
+
+---
+
+## Data structures
+
+| Structure | Access | Insert end | Insert middle | Remove end | Remove middle |
+|-----------|--------|------------|---------------|------------|---------------|
+| **Vector** | O(1) | O(1)* | O(n) | O(1) | O(n) |
+| **Stack** | — | O(1) | — | O(1) | — |
+| **Queue** | — | O(1)* | — | O(1)* | — |
+| **List** | O(n) | O(1) | O(1)** | O(1) | O(1)** |
+| **PriorityQueue** | — | O(log n) | — | O(log n) | — |
+| **OrderedMap** (Map) | O(log n) get | O(log n) set | — | O(log n) delete | — |
+| **UnorderedMap** | O(1)* get/set | O(1)* | — | O(1)* delete | — |
+| **OrderedSet** (Set) | O(log n) has | O(log n) add | — | O(log n) delete | — |
+| **UnorderedSet** | O(1)* has/add | O(1)* | — | O(1)* delete | — |
+| **OrderedMultiMap** | O(log n) get | O(log n) set | — | O(log n) delete | — |
+| **OrderedMultiSet** | O(log n) has/count | O(log n) add | — | O(log n) delete | — |
+
+\* Amortized (hash).  
+\** At a known node.
+
+---
+
+## OrderedMultiMap and OrderedMultiSet — use cases
+
+**OrderedMultiSet** is a sorted collection that allows duplicate elements (like C++ `std::multiset`). Use it when you need ordering and multiple copies of the same value.
+
+| Use case | Example |
+|----------|---------|
+| **Sorted runs / leaderboard with ties** | Store scores; multiple users can have the same score. Iterate in sorted order, use `count(score)` for ties. |
+| **Event timeline with repeated timestamps** | Add events by time; several events can share the same time. `add(timestamp)`, iterate in order. |
+| **K-th smallest in a multiset** | Keep elements sorted; k-th element is at index `k - 1` in iteration. |
+| **Range counts** | Combined with binary search ideas: count elements in `[low, high]` using `count` and iteration. |
+
+**OrderedMultiMap** maps one key to multiple values while keeping keys sorted (like C++ `std::multimap`). Use it when a key can have several associated values and you need key order.
+
+| Use case | Example |
+|----------|---------|
+| **Inverted index** | Key = term, values = document IDs containing that term. `set(term, docId)` for each occurrence; `getAll(term)` returns all doc IDs. |
+| **Grouping by key** | Key = category, values = items. `set(category, item)`; iterate keys in order, use `getAll(key)` per group. |
+| **One-to-many relations** | Key = user ID, values = session IDs. `set(userId, sessionId)`; `getAll(userId)` lists all sessions. |
+| **Time-series by bucket** | Key = time bucket, values = events. Sorted keys give chronological buckets; `getAll(bucket)` gets events in that bucket. |
+
+### OrderedMultiSet example
+
+```ts
+import { OrderedMultiSet } from 'typescript-dsa-stl';
+
+const scores = new OrderedMultiSet<number>();
+scores.add(85); scores.add(92); scores.add(85); scores.add(78);
+console.log(scores.toArray());   // [78, 85, 85, 92]
+console.log(scores.count(85));   // 2
+scores.delete(85);               // remove one 85
+console.log(scores.count(85));   // 1
+scores.deleteAll(85);            // remove all 85s
+```
+
+### OrderedMultiMap example
+
+```ts
+import { OrderedMultiMap } from 'typescript-dsa-stl';
+
+const index = new OrderedMultiMap<string, number>();  // term -> doc IDs
+index.set('typescript', 1); index.set('typescript', 3); index.set('stl', 2);
+console.log(index.getAll('typescript'));  // [1, 3]
+console.log(index.get('stl'));            // 2
+for (const [key, value] of index) {
+  console.log(key, value);               // keys in sorted order
+}
+```
+
+---
+
+## For maintainers
+
+- **Build:** `npm run build` (also runs before `npm publish` via `prepublishOnly`)
+- **Publish:** `npm publish` (use `npm publish --access public` for a scoped package name)
+
+---
+
+## License
+
+MIT

package/dist/algorithms/disjointSetUnion.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Disjoint Set Union (Union-Find) with:
+ * - Path compression (iterative)
+ * - Union by size
+ *
+ * Optimized for vertex indices in range [0..n-1].
+ */
+export declare class DisjointSetUnion {
+    private readonly parent;
+    private readonly size;
+    constructor(n: number);
+    /**
+     * Find the representative(root) of x.
+     * Amortized almost O(1) with path compression.
+     */
+    find(x: number): number;
+    /** Returns true if a merge happened (were in different sets). */
+    union(a: number, b: number): boolean;
+    connected(a: number, b: number): boolean;
+    /** Size of the connected component containing x. */
+    componentSize(x: number): number;
+    /**
+     * Get component representative id for each vertex.
+     * Runs `find(i)` for each i (so it also compresses paths).
+     */
+    roots(): Int32Array;
+    /**
+     * Group vertices into components.
+     * Complexity: O(n * alpha(n)).
+     */
+    components(nVertices?: number): number[][];
+}
+//# sourceMappingURL=disjointSetUnion.d.ts.map

package/dist/algorithms/disjointSetUnion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"disjointSetUnion.d.ts","sourceRoot":"","sources":["../../src/algorithms/disjointSetUnion.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAa;IACpC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAa;gBAEtB,CAAC,EAAE,MAAM;IAUrB;;;OAGG;IACH,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAiBvB,iEAAiE;IACjE,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAiBpC,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAIxC,oDAAoD;IACpD,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIhC;;;OAGG;IACH,KAAK,IAAI,UAAU;IAQnB;;;OAGG;IACH,UAAU,CAAC,SAAS,SAAqB,GAAG,MAAM,EAAE,EAAE;CAqBvD"}

package/dist/algorithms/disjointSetUnion.js

@@ -0,0 +1,93 @@
+/**
+ * Disjoint Set Union (Union-Find) with:
+ * - Path compression (iterative)
+ * - Union by size
+ *
+ * Optimized for vertex indices in range [0..n-1].
+ */
+export class DisjointSetUnion {
+    constructor(n) {
+        // Assumes valid vertex count and indices are provided by the caller.
+        this.parent = new Int32Array(n);
+        this.size = new Int32Array(n);
+        for (let i = 0; i < n; i++) {
+            this.parent[i] = i;
+            this.size[i] = 1;
+        }
+    }
+    /**
+     * Find the representative(root) of x.
+     * Amortized almost O(1) with path compression.
+     */
+    find(x) {
+        // Find root.
+        let root = x;
+        while (this.parent[root] !== root) {
+            root = this.parent[root];
+        }
+        // Compress path.
+        while (this.parent[x] !== x) {
+            const p = this.parent[x];
+            this.parent[x] = root;
+            x = p;
+        }
+        return root;
+    }
+    /** Returns true if a merge happened (were in different sets). */
+    union(a, b) {
+        let ra = this.find(a);
+        let rb = this.find(b);
+        if (ra === rb)
+            return false;
+        // Union by size: attach smaller tree under larger tree.
+        if (this.size[ra] < this.size[rb]) {
+            const tmp = ra;
+            ra = rb;
+            rb = tmp;
+        }
+        this.parent[rb] = ra;
+        this.size[ra] += this.size[rb];
+        return true;
+    }
+    connected(a, b) {
+        return this.find(a) === this.find(b);
+    }
+    /** Size of the connected component containing x. */
+    componentSize(x) {
+        return this.size[this.find(x)];
+    }
+    /**
+     * Get component representative id for each vertex.
+     * Runs `find(i)` for each i (so it also compresses paths).
+     */
+    roots() {
+        const out = new Int32Array(this.parent.length);
+        for (let i = 0; i < out.length; i++) {
+            out[i] = this.find(i);
+        }
+        return out;
+    }
+    /**
+     * Group vertices into components.
+     * Complexity: O(n * alpha(n)).
+     */
+    components(nVertices = this.parent.length) {
+        // Use an array lookup instead of Map for faster grouping.
+        const rootToIndex = new Int32Array(this.parent.length);
+        rootToIndex.fill(-1);
+        const groups = [];
+        const n = Math.min(nVertices, this.parent.length);
+        for (let i = 0; i < n; i++) {
+            const r = this.find(i);
+            let idx = rootToIndex[r];
+            if (idx === -1) {
+                idx = groups.length;
+                rootToIndex[r] = idx;
+                groups.push([]);
+            }
+            groups[idx].push(i);
+        }
+        return groups;
+    }
+}
+//# sourceMappingURL=disjointSetUnion.js.map

package/dist/algorithms/disjointSetUnion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"disjointSetUnion.js","sourceRoot":"","sources":["../../src/algorithms/disjointSetUnion.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,OAAO,gBAAgB;IAI3B,YAAY,CAAS;QACnB,qEAAqE;QACrE,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,CAAS;QACZ,aAAa;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAClC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,iBAAiB;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACtB,CAAC,GAAG,CAAC,CAAC;QACR,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iEAAiE;IACjE,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,KAAK,CAAC;QAE5B,wDAAwD;QACxD,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,EAAE,GAAG,EAAE,CAAC;YACR,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,CAAS,EAAE,CAAS;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,oDAAoD;IACpD,aAAa,CAAC,CAAS;QACrB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;QACvC,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAErB,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;gBACpB,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/algorithms/graph.d.ts

@@ -0,0 +1,29 @@
+import type { AdjacencyList, WeightedAdjacencyList } from '../collections/index.js';
+export interface WeightedUndirectedEdge {
+    u: number;
+    v: number;
+    weight: number;
+}
+/**
+ * Connected components in an (unweighted) graph using DSU.
+ * Complexity: O((n + m) * alpha(n)).
+ *
+ * Notes:
+ * - Assumes vertices are numbered `0..n-1`.
+ * - If your adjacency list stores each edge once or twice, DSU will still work.
+ */
+export declare function connectedComponents(n: number, adj: AdjacencyList<number>): number[][];
+/**
+ * Kruskal's algorithm for Minimum Spanning Tree (MST) using DSU.
+ *
+ * Complexity: O(m log m) for sorting edges + O(m * alpha(n)).
+ *
+ * @returns a spanning forest if the graph is disconnected.
+ */
+export declare function kruskalMST(n: number, adj: WeightedAdjacencyList<number, number>, options?: {
+    undirected?: boolean;
+}): {
+    edges: WeightedUndirectedEdge[];
+    totalWeight: number;
+};
+//# sourceMappingURL=graph.d.ts.map

package/dist/algorithms/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/algorithms/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAGpF,MAAM,WAAW,sBAAsB;IACrC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,MAAM,EACT,GAAG,EAAE,aAAa,CAAC,MAAM,CAAC,GACzB,MAAM,EAAE,EAAE,CAQZ;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,MAAM,EACT,GAAG,EAAE,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,OAAO,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,OAAO,CAAA;CAAE,GACjC;IAAE,KAAK,EAAE,sBAAsB,EAAE,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CAgC1D"}

package/dist/algorithms/graph.js

@@ -0,0 +1,57 @@
+import { DisjointSetUnion } from './disjointSetUnion.js';
+/**
+ * Connected components in an (unweighted) graph using DSU.
+ * Complexity: O((n + m) * alpha(n)).
+ *
+ * Notes:
+ * - Assumes vertices are numbered `0..n-1`.
+ * - If your adjacency list stores each edge once or twice, DSU will still work.
+ */
+export function connectedComponents(n, adj) {
+    const dsu = new DisjointSetUnion(n);
+    for (let u = 0; u < n; u++) {
+        for (const v of adj[u] ?? []) {
+            dsu.union(u, v);
+        }
+    }
+    return dsu.components(n);
+}
+/**
+ * Kruskal's algorithm for Minimum Spanning Tree (MST) using DSU.
+ *
+ * Complexity: O(m log m) for sorting edges + O(m * alpha(n)).
+ *
+ * @returns a spanning forest if the graph is disconnected.
+ */
+export function kruskalMST(n, adj, options) {
+    const undirected = options?.undirected ?? true;
+    // Extract edges from adjacency list.
+    // For undirected graphs represented as both-direction adjacency,
+    // take only u < v to avoid duplicates.
+    const edges = [];
+    for (let u = 0; u < n; u++) {
+        for (const { to: v, weight } of adj[u] ?? []) {
+            if (undirected) {
+                if (u < v)
+                    edges.push({ u, v, weight });
+            }
+            else {
+                edges.push({ u, v, weight });
+            }
+        }
+    }
+    edges.sort((a, b) => a.weight - b.weight);
+    const dsu = new DisjointSetUnion(n);
+    const mstEdges = [];
+    let totalWeight = 0;
+    for (const e of edges) {
+        if (dsu.union(e.u, e.v)) {
+            mstEdges.push(e);
+            totalWeight += e.weight;
+            if (mstEdges.length === n - 1)
+                break; // MST complete for connected graphs.
+        }
+    }
+    return { edges: mstEdges, totalWeight };
+}
+//# sourceMappingURL=graph.js.map

package/dist/algorithms/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/algorithms/graph.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAQzD;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,CAAS,EACT,GAA0B;IAE1B,MAAM,GAAG,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,CAAS,EACT,GAA0C,EAC1C,OAAkC;IAElC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,IAAI,CAAC;IAE/C,qCAAqC;IACrC,iEAAiE;IACjE,uCAAuC;IACvC,MAAM,KAAK,GAA6B,EAAE,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,UAAU,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC1C,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE1C,MAAM,GAAG,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,QAAQ,GAA6B,EAAE,CAAC;IAC9C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,WAAW,IAAI,CAAC,CAAC,MAAM,CAAC;YACxB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,qCAAqC;QAC7E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;AAC1C,CAAC"}

package/dist/algorithms/index.d.ts

@@ -1,2 +1,5 @@
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
+export { DisjointSetUnion } from './disjointSetUnion.js';
+export type { WeightedUndirectedEdge } from './graph.js';
+export { connectedComponents, kruskalMST } from './graph.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/algorithms/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/algorithms/index.js

@@ -1,2 +1,4 @@
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
+export { DisjointSetUnion } from './disjointSetUnion.js';
+export { connectedComponents, kruskalMST } from './graph.js';
 //# sourceMappingURL=index.js.map

package/dist/algorithms/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/collections/Graph.d.ts

@@ -30,6 +30,16 @@ export type AdjacencyList<Vertex = number> = Vertex[][];
  *   adj[u].push({ to: v, weight: w });
  */
 export type WeightedAdjacencyList<Vertex = number, Weight = number> = WeightedEdge<Vertex, Weight>[][];
+/**
+ * Create an empty unweighted graph with `n` vertices (0..n-1).
+ * Equivalent to C++: `vector<vector<int>> graph(n);`
+ */
+export declare function createAdjacencyList(n: number): AdjacencyList<number>;
+/**
+ * Create an empty weighted graph with `n` vertices (0..n-1).
+ * Equivalent to C++: `vector<vector<pair<int,int>>> graph(n);`
+ */
+export declare function createWeightedAdjacencyList(n: number): WeightedAdjacencyList<number, number>;
 /**
  * Add an edge to a graph adjacency list.
  *

package/dist/collections/Graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../src/collections/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,yDAAyD;AACzD,MAAM,WAAW,YAAY,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM;IAC5D,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,MAAM,MAAM,aAAa,CAAC,MAAM,GAAG,MAAM,IAAI,MAAM,EAAE,EAAE,CAAC;AAExD;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,qBAAqB,CAC/B,MAAM,GAAG,MAAM,EACf,MAAM,GAAG,MAAM,IACb,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;AAErC;;;;;;GAMG;AACH,wBAAgB,OAAO,CACrB,GAAG,EAAE,aAAa,CAAC,MAAM,CAAC,EAC1B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AACR,wBAAgB,OAAO,CACrB,GAAG,EAAE,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AAgBR;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,GAAG,EAAE,aAAa,CAAC,MAAM,CAAC,EAC1B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AACR,wBAAgB,UAAU,CACxB,GAAG,EAAE,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC"}
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../src/collections/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,yDAAyD;AACzD,MAAM,WAAW,YAAY,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM;IAC5D,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,MAAM,MAAM,aAAa,CAAC,MAAM,GAAG,MAAM,IAAI,MAAM,EAAE,EAAE,CAAC;AAExD;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,qBAAqB,CAC/B,MAAM,GAAG,MAAM,EACf,MAAM,GAAG,MAAM,IACb,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;AAErC;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAEpE;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,CACzC,CAAC,EAAE,MAAM,GACR,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,CAEvC;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CACrB,GAAG,EAAE,aAAa,CAAC,MAAM,CAAC,EAC1B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AACR,wBAAgB,OAAO,CACrB,GAAG,EAAE,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AAgBR;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,GAAG,EAAE,aAAa,CAAC,MAAM,CAAC,EAC1B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC;AACR,wBAAgB,UAAU,CACxB,GAAG,EAAE,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR,IAAI,CAAC"}

package/dist/collections/Graph.js

@@ -5,6 +5,20 @@
  *   vector<vector<int>> adj(n);
  *   vector<vector<pair<int,int>>> adj(n);
  */
+/**
+ * Create an empty unweighted graph with `n` vertices (0..n-1).
+ * Equivalent to C++: `vector<vector<int>> graph(n);`
+ */
+export function createAdjacencyList(n) {
+    return Array.from({ length: n }, () => []);
+}
+/**
+ * Create an empty weighted graph with `n` vertices (0..n-1).
+ * Equivalent to C++: `vector<vector<pair<int,int>>> graph(n);`
+ */
+export function createWeightedAdjacencyList(n) {
+    return Array.from({ length: n }, () => []);
+}
 export function addEdge(adj, u, v, w) {
     if (w === undefined) {
         adj[u].push(v);

package/dist/collections/Graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../src/collections/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAmDH,MAAM,UAAU,OAAO,CACrB,GAEyC,EACzC,CAAS,EACT,CAAS,EACT,CAAU;IAEV,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACnB,GAA6B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;SAAM,CAAC;QACL,GAA6C,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC;AACH,CAAC;AAoBD,MAAM,UAAU,UAAU,CACxB,GAEyC,EACzC,CAAS,EACT,CAAS,EACT,CAAU;IAEV,MAAM,GAAG,GAAI,GAAqE,CAAC,CAAC,CAAC,CAAC;IAEtF,IAAI,CAAC,GAAG;QAAE,OAAO;IAEjB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,+CAA+C;QAC/C,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjB,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAiC,CAAC;YACpD,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../src/collections/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAiCH;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS;IAC3C,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,2BAA2B,CACzC,CAAS;IAET,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7C,CAAC;AAoBD,MAAM,UAAU,OAAO,CACrB,GAEyC,EACzC,CAAS,EACT,CAAS,EACT,CAAU;IAEV,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACnB,GAA6B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;SAAM,CAAC;QACL,GAA6C,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC;AACH,CAAC;AAoBD,MAAM,UAAU,UAAU,CACxB,GAEyC,EACzC,CAAS,EACT,CAAS,EACT,CAAU;IAEV,MAAM,GAAG,GAAI,GAAqE,CAAC,CAAC,CAAC,CAAC;IAEtF,IAAI,CAAC,GAAG;QAAE,OAAO;IAEjB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,+CAA+C;QAC/C,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjB,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAiC,CAAC;YACpD,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/collections/index.d.ts

@@ -11,5 +11,5 @@ export { OrderedMultiSet } from './OrderedMultiSet.js';
 export { OrderedMultiMap } from './OrderedMultiMap.js';
 export { RedBlackTree, RBNode } from './RedBlackTree.js';
 export type { WeightedEdge, AdjacencyList, WeightedAdjacencyList } from './Graph.js';
-export { addEdge, deleteEdge } from './Graph.js';
+export { createAdjacencyList, createWeightedAdjacencyList, addEdge, deleteEdge } from './Graph.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/collections/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACrF,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/collections/index.js

@@ -10,5 +10,5 @@ export { UnorderedSet } from './UnorderedSet.js';
 export { OrderedMultiSet } from './OrderedMultiSet.js';
 export { OrderedMultiMap } from './OrderedMultiMap.js';
 export { RedBlackTree, RBNode } from './RedBlackTree.js';
-export { addEdge, deleteEdge } from './Graph.js';
+export { createAdjacencyList, createWeightedAdjacencyList, addEdge, deleteEdge } from './Graph.js';
 //# sourceMappingURL=index.js.map

package/dist/collections/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEzD,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/index.d.ts

@@ -5,9 +5,10 @@
  * @example
  * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
  */
-export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, } from './collections/index.js';
+export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, } from './collections/index.js';
 export type { WeightedEdge, AdjacencyList, WeightedAdjacencyList } from './collections/index.js';
-export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './algorithms/index.js';
+export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, connectedComponents, kruskalMST, } from './algorithms/index.js';
+export type { WeightedUndirectedEdge } from './algorithms/index.js';
 export { clamp, range, noop, identity, swap } from './utils/index.js';
 export type { Comparator, Predicate, UnaryFn, Reducer, IterableLike } from './types/index.js';
 export { toArray } from './types/index.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,GACX,MAAM,wBAAwB,CAAC;AAChC,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AACjG,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACtE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,GAC5B,MAAM,wBAAwB,CAAC;AAChC,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AACjG,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,UAAU,GACX,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACtE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/index.js

@@ -5,8 +5,8 @@
  * @example
  * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
  */
-export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, } from './collections/index.js';
-export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './algorithms/index.js';
+export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, } from './collections/index.js';
+export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, connectedComponents, kruskalMST, } from './algorithms/index.js';
 export { clamp, range, noop, identity, swap } from './utils/index.js';
 export { toArray } from './types/index.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,GACX,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,GAC5B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,UAAU,GACX,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "typescript-dsa-stl",
-  "version": "2.0.1",
-  "description": "STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, List, PriorityQueue, Map, Set, sort, binarySearch. Use like C++ STL.",
+  "version": "2.1.0",
+  "description": "STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.",
   "type": "module",
   "main": "dist/index.js",
   "module": "dist/index.js",