typescript-dsa-stl 1.4.1 → 2.0.0

package/README.md

@@ -1,249 +1,342 @@
-# 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)
-```
-
----
-
-## API overview
-
-| Module | Exports |
-|--------|--------|
-| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet` |
-| **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 lists (like C++ `vector<vector<type>> adj(n)`)
+
+You can model C++-style adjacency lists using the graph helper types exported from `typescript-dsa-stl/types`.
+
+#### Unweighted adjacency list
+
+C++:
+
+```cpp
+int n = 5;
+vector<vector<int>> adj(n);
+adj[u].push_back(v);   // or adj[u].pb(v);
+```
+
+TypeScript (manual `push`):
+
+```ts
+import type { AdjacencyList } from 'typescript-dsa-stl/types';
+
+const n = 5;
+// number of vertices = n, initially all neighbors empty
+const adj: AdjacencyList<number> = Array.from({ length: n }, () => []);
+
+// C++: adj[u].push_back(v);
+adj[u].push(v);
+
+// Iteration is the same idea as in C++
+for (const v of adj[u]) {
+  // neighbor v
+}
+```
+
+TypeScript (with helpers `addEdge` / `deleteEdge`):
+
+```ts
+import type { AdjacencyList } from 'typescript-dsa-stl/types';
+import { addEdge, deleteEdge } from 'typescript-dsa-stl/types';
+
+const n = 5;
+const adj: AdjacencyList<number> = Array.from({ length: n }, () => []);
+
+addEdge(adj, u, v);        // add u -> v
+deleteEdge(adj, u, v);     // remove all edges u -> v
+```
+
+#### Weighted adjacency list
+
+In C++ you might write:
+
+```cpp
+int n = 5;
+vector<vector<pair<int,int>>> adj(n);
+adj[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/types';
+
+const n = 5;
+const adj: WeightedAdjacencyList<number, number> =
+  Array.from({ length: n }, () => []);
+
+// C++: adj[u].push_back({v, w});
+adj[u].push({ to: v, weight: w });
+
+// When iterating, you get both neighbor and weight
+for (const { to, weight } of adj[u]) {
+  // edge u -> to with cost = weight
+}
+
+// If you prefer a different vertex or weight type, just change the generics:
+// const adj: WeightedAdjacencyList<string, bigint> = ...
+```
+
+Or with the helper functions `addEdge` / `deleteEdge`:
+
+```ts
+import type { WeightedAdjacencyList } from 'typescript-dsa-stl/types';
+import { addEdge, deleteEdge } from 'typescript-dsa-stl/types';
+
+const n = 5;
+const adj: WeightedAdjacencyList<number, number> =
+  Array.from({ length: n }, () => []);
+
+addEdge(adj, u, v, w);         // add u -> v with weight w
+deleteEdge(adj, u, v, w);      // delete all edges u -> v with weight w
+```
+
+---
+
+## API overview
+
+| Module | Exports |
+|--------|--------|
+| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet` |
+| **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`, `WeightedEdge`, `AdjacencyList`, `WeightedAdjacencyList` |
+
+### 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/types/index.d.ts

@@ -13,4 +13,54 @@ export type Reducer<T, U> = (acc: U, x: T) => U;
 export type IterableLike<T> = Iterable<T> | ArrayLike<T>;
 /** Convert IterableLike to array (single copy). Used internally by algorithms. */
 export declare function toArray<T>(source: IterableLike<T>): T[];
+/**
+ * Graph adjacency list helpers (C++-style).
+ *
+ * These are designed so you can mirror common C++ patterns like:
+ *   vector<vector<int>> adj(n);
+ *   vector<vector<pair<int,int>>> adj(n);
+ */
+/** Single weighted edge: `to` vertex with a `weight`. */
+export interface WeightedEdge<Vertex = number, Weight = number> {
+    to: Vertex;
+    weight: Weight;
+}
+/**
+ * Unweighted adjacency list.
+ *
+ * C++: `vector<vector<int>> adj(n);`
+ * TS:  `AdjacencyList<number>` (backed by `number[][]`).
+ */
+export type AdjacencyList<Vertex = number> = Vertex[][];
+/**
+ * Weighted adjacency list.
+ *
+ * C++: `vector<vector<pair<int,int>>> adj(n);`
+ * TS:  `WeightedAdjacencyList<number, number>`
+ *      (backed by `WeightedEdge<number, number>[][]`).
+ *
+ * Typical use:
+ *   const adj: WeightedAdjacencyList<number, number> =
+ *     Array.from({ length: n }, () => []);
+ *   adj[u].push({ to: v, weight: w });
+ */
+export type WeightedAdjacencyList<Vertex = number, Weight = number> = WeightedEdge<Vertex, Weight>[][];
+/**
+ * Add an edge to a graph adjacency list.
+ *
+ * Overloads:
+ *   - Unweighted: addEdge(adj, u, v)
+ *   - Weighted:   addEdge(adj, u, v, w)
+ */
+export declare function addEdge(adj: AdjacencyList<number>, u: number, v: number): void;
+export declare function addEdge(adj: WeightedAdjacencyList<number, number>, u: number, v: number, w: number): void;
+/**
+ * Delete all edges u -> v from a graph adjacency list.
+ *
+ * Overloads:
+ *   - Unweighted: deleteEdge(adj, u, v)
+ *   - Weighted:   deleteEdge(adj, u, v, w)
+ */
+export declare function deleteEdge(adj: AdjacencyList<number>, u: number, v: number): void;
+export declare function deleteEdge(adj: WeightedAdjacencyList<number, number>, u: number, v: number, w: number): void;
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,iFAAiF;AACjF,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAEnD,kDAAkD;AAClD,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAE7C,6BAA6B;AAC7B,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAExC,uDAAuD;AACvD,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAEhD,2EAA2E;AAC3E,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AAEzD,kFAAkF;AAClF,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAMvD"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,iFAAiF;AACjF,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAEnD,kDAAkD;AAClD,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAE7C,6BAA6B;AAC7B,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAExC,uDAAuD;AACvD,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAEhD,2EAA2E;AAC3E,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AAEzD,kFAAkF;AAClF,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAMvD;AAED;;;;;;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"}

package/dist/types/index.js

@@ -10,4 +10,34 @@ export function toArray(source) {
     }
     return Array.from(source);
 }
+export function addEdge(adj, u, v, w) {
+    if (w === undefined) {
+        adj[u].push(v);
+    }
+    else {
+        adj[u].push({ to: v, weight: w });
+    }
+}
+export function deleteEdge(adj, u, v, w) {
+    const row = adj[u];
+    if (!row)
+        return;
+    if (w === undefined) {
+        // Unweighted: remove all neighbors equal to v.
+        for (let i = row.length - 1; i >= 0; i--) {
+            if (row[i] === v) {
+                row.splice(i, 1);
+            }
+        }
+    }
+    else {
+        // Weighted: remove all edges with { to: v, weight: w }.
+        for (let i = row.length - 1; i >= 0; i--) {
+            const edge = row[i];
+            if (edge.to === v && edge.weight === w) {
+                row.splice(i, 1);
+            }
+        }
+    }
+}
 //# sourceMappingURL=index.js.map

package/dist/types/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAiBH,kFAAkF;AAClF,MAAM,UAAU,OAAO,CAAI,MAAuB;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACzC,IAAI,OAAQ,MAAsB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE,CAAC;QACnE,OAAO,CAAC,GAAI,MAAsB,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAsB,CAAC,CAAC;AAC5C,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAiBH,kFAAkF;AAClF,MAAM,UAAU,OAAO,CAAI,MAAuB;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACzC,IAAI,OAAQ,MAAsB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE,CAAC;QACnE,OAAO,CAAC,GAAI,MAAsB,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAsB,CAAC,CAAC;AAC5C,CAAC;AA2DD,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/package.json

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