typescript-ds-lib 0.3.8 → 0.4.5

package/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2024 Artiom Baloian
+Copyright (c) 2025 Artiom Baloian
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/README.md

@@ -8,7 +8,7 @@ TypeScript data structure implementations without external dependencies. Why to
 - 0 Dependencies
 - Lightweight
 - Comes with Comparator (for custom types)
-- `hashCode()` and `equals()` are supported
+- `equals()` method provided for all data structures
 - Well documented
 
 
@@ -42,6 +42,7 @@ See the [documentation](https://github.com/baloian/typescript-ds-lib/blob/master
 ## Data Structures
 - Binary Search Tree
 - Deque
+- Graph (beta version and partially tested)
 - Hash Table (unordered map)
 - Heap
 - Linked List
@@ -52,7 +53,6 @@ See the [documentation](https://github.com/baloian/typescript-ds-lib/blob/master
 - Red-Black Tree
 - Set
 - Stack
-- Graph (coming soon)
 
 
 ## `Map-Set` vs Native JavaScript `Map-Set`
@@ -69,9 +69,7 @@ You can consider the library's `Map` and `Set` as ordered map and set, and nativ
 
 ## Contributions
 Contributions are welcome and can be made by submitting GitHub pull requests
-to this repository. In general, the source code follows
-[Airbnb JavaScript Style Guide](https://github.com/airbnb/javascript) and the
-rules specified in `.eslintrc.json` file.
+to this repository.
 
 
 ## License

package/dist/index.d.ts

@@ -1,6 +1,8 @@
 export * from './types';
 export { BinarySearchTree } from './lib/binary-search-tree';
 export { Deque } from './lib/deque';
+export { MatrixGraph } from './lib/graph/matrix-graph';
+export { LinkedListGraph } from './lib/graph/linked-list-graph';
 export { HashTable } from './lib/hash-table';
 export { Heap } from './lib/heap';
 export { LinkedList } from './lib/linked-list';

package/dist/index.js

@@ -14,12 +14,16 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Stack = exports.Set = exports.RedBlackTree = exports.Queue = exports.PriorityQueue = exports.Matrix = exports.Map = exports.LinkedList = exports.Heap = exports.HashTable = exports.Deque = exports.BinarySearchTree = void 0;
+exports.Stack = exports.Set = exports.RedBlackTree = exports.Queue = exports.PriorityQueue = exports.Matrix = exports.Map = exports.LinkedList = exports.Heap = exports.HashTable = exports.LinkedListGraph = exports.MatrixGraph = exports.Deque = exports.BinarySearchTree = void 0;
 __exportStar(require("./types"), exports);
 var binary_search_tree_1 = require("./lib/binary-search-tree");
 Object.defineProperty(exports, "BinarySearchTree", { enumerable: true, get: function () { return binary_search_tree_1.BinarySearchTree; } });
 var deque_1 = require("./lib/deque");
 Object.defineProperty(exports, "Deque", { enumerable: true, get: function () { return deque_1.Deque; } });
+var matrix_graph_1 = require("./lib/graph/matrix-graph");
+Object.defineProperty(exports, "MatrixGraph", { enumerable: true, get: function () { return matrix_graph_1.MatrixGraph; } });
+var linked_list_graph_1 = require("./lib/graph/linked-list-graph");
+Object.defineProperty(exports, "LinkedListGraph", { enumerable: true, get: function () { return linked_list_graph_1.LinkedListGraph; } });
 var hash_table_1 = require("./lib/hash-table");
 Object.defineProperty(exports, "HashTable", { enumerable: true, get: function () { return hash_table_1.HashTable; } });
 var heap_1 = require("./lib/heap");

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,+DAA4D;AAAnD,sHAAA,gBAAgB,OAAA;AACzB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,+CAA6C;AAApC,uGAAA,SAAS,OAAA;AAClB,mCAAkC;AAAzB,4FAAA,IAAI,OAAA;AACb,iDAA+C;AAAtC,yGAAA,UAAU,OAAA;AACnB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,uCAAsC;AAA7B,gGAAA,MAAM,OAAA;AACf,uDAAqD;AAA5C,+GAAA,aAAa,OAAA;AACtB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,uDAAoD;AAA3C,8GAAA,YAAY,OAAA;AACrB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,qCAAoC;AAA3B,8FAAA,KAAK,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,+DAA4D;AAAnD,sHAAA,gBAAgB,OAAA;AACzB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,yDAAuD;AAA9C,2GAAA,WAAW,OAAA;AACpB,mEAAgE;AAAvD,oHAAA,eAAe,OAAA;AACxB,+CAA6C;AAApC,uGAAA,SAAS,OAAA;AAClB,mCAAkC;AAAzB,4FAAA,IAAI,OAAA;AACb,iDAA+C;AAAtC,yGAAA,UAAU,OAAA;AACnB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,uCAAsC;AAA7B,gGAAA,MAAM,OAAA;AACf,uDAAqD;AAA5C,+GAAA,aAAa,OAAA;AACtB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,uDAAoD;AAA3C,8GAAA,YAAY,OAAA;AACrB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,qCAAoC;AAA3B,8FAAA,KAAK,OAAA"}

package/dist/lib/base-collection.d.ts

@@ -11,4 +11,8 @@ export declare abstract class BaseCollection<T> {
      * Removes all elements from the collection.
      */
     abstract clear(): void;
+    /**
+     * Checks if two collections are equal.
+     */
+    abstract equals(other: BaseCollection<T>): boolean;
 }

package/dist/lib/base-collection.js.map

@@ -1 +1 @@
-{"version":3,"file":"base-collection.js","sourceRoot":"","sources":["../../lib/base-collection.ts"],"names":[],"mappings":";;;AAAA,MAAsB,cAAc;CAenC;AAfD,wCAeC"}
+{"version":3,"file":"base-collection.js","sourceRoot":"","sources":["../../lib/base-collection.ts"],"names":[],"mappings":";;;AAAA,MAAsB,cAAc;CAoBnC;AApBD,wCAoBC"}

package/dist/lib/binary-search-tree.d.ts

@@ -31,4 +31,9 @@ export declare class BinarySearchTree<T> extends BaseCollection<T> implements Bi
      * Returns the number of nodes in the BST.
      */
     size(): number;
+    /**
+     * Checks if two BSTs are equal.
+     */
+    equals(other: BinarySearchTree<T>): boolean;
+    private areTreesEqual;
 }

package/dist/lib/binary-search-tree.js

@@ -34,10 +34,6 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
         }
         let current = this.root;
         while (true) {
-            if (this.isEqual(value, current.value)) {
-                // Value already exists, don't insert
-                return;
-            }
             if (this.comparator(value, current.value)) {
                 if (current.left === null) {
                     current.left = newNode;
@@ -46,6 +42,9 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
                 }
                 current = current.left;
             }
+            else if (this.isEqual(value, current.value)) {
+                return;
+            }
             else {
                 if (current.right === null) {
                     current.right = newNode;
@@ -204,6 +203,25 @@ class BinarySearchTree extends base_collection_1.BaseCollection {
     size() {
         return this.nodeCount;
     }
+    /**
+     * Checks if two BSTs are equal.
+     */
+    equals(other) {
+        if (!other || !(other instanceof BinarySearchTree))
+            return false;
+        if (this.size() !== other.size())
+            return false;
+        return this.areTreesEqual(this.root, other.root);
+    }
+    areTreesEqual(node1, node2) {
+        if (node1 === null && node2 === null)
+            return true;
+        if (node1 === null || node2 === null)
+            return false;
+        return (this.isEqual(node1.value, node2.value) &&
+            this.areTreesEqual(node1.left, node2.left) &&
+            this.areTreesEqual(node1.right, node2.right));
+    }
 }
 exports.BinarySearchTree = BinarySearchTree;
 //# sourceMappingURL=binary-search-tree.js.map

package/dist/lib/binary-search-tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AACA,uDAAmD;AAanD,MAAM,QAAQ;IACZ,KAAK,CAAI;IACT,IAAI,CAAqB;IACzB,KAAK,CAAqB;IAE1B,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;CACF;AAGD,MAAa,gBAAoB,SAAQ,gCAAiB;IAChD,IAAI,CAAqB;IACzB,UAAU,CAAgB;IAC1B,SAAS,CAAS;IAE1B,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,qCAAqC;gBACrC,OAAO;YACT,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBAC1B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;oBAC3B,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC;oBACxB,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAEO,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,oBAAoB;YACpB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACd,CAAC;YACD,8BAA8B;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC1C,iCAAiC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,sDAAsD;YACxE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,IAAiB;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,OAAO,CAAC,CAAI,EAAE,CAAI;QACxB,yDAAyD;QACzD,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,QAA8B,EAAE,YAAkD,SAAS;QACjG,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3C,MAAM;YACR,KAAK,UAAU;gBACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC5C,MAAM;YACR,KAAK,WAAW;gBACd,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC7C,MAAM;YACR;gBACE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,gBAAgB,CAAC,IAAwB,EAAE,QAA8B;QAC/E,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC3C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAEO,iBAAiB,CAAC,IAAwB,EAAE,QAA8B;QAChF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAEO,kBAAkB,CAAC,IAAwB,EAAE,QAA8B;QACjF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AApMD,4CAoMC"}
+{"version":3,"file":"binary-search-tree.js","sourceRoot":"","sources":["../../lib/binary-search-tree.ts"],"names":[],"mappings":";;;AACA,uDAAmD;AAWnD,MAAM,QAAQ;IACZ,KAAK,CAAI;IACT,IAAI,CAAqB;IACzB,KAAK,CAAqB;IAE1B,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;CACF;AAED,MAAa,gBAAoB,SAAQ,gCAAiB;IAChD,IAAI,CAAqB;IACzB,UAAU,CAAgB;IAC1B,SAAS,CAAS;IAE1B,YAAY,aAA4B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;QAC3D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBAC1B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;oBACvB,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9C,OAAO;YACT,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;oBAC3B,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC;oBACxB,IAAI,CAAC,SAAS,EAAE,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAEO,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,oBAAoB;YACpB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACd,CAAC;YACD,8BAA8B;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YAC1C,iCAAiC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,sDAAsD;YACxE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,IAAiB;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,OAAO,CAAC,CAAI,EAAE,CAAI;QACxB,yDAAyD;QACzD,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,OAAO,CACL,QAA8B,EAC9B,YAAkD,SAAS;QAE3D,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC3C,MAAM;YACR,KAAK,UAAU;gBACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC5C,MAAM;YACR,KAAK,WAAW;gBACd,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC7C,MAAM;YACR;gBACE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,gBAAgB,CAAC,IAAwB,EAAE,QAA8B;QAC/E,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC3C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAEO,iBAAiB,CAAC,IAAwB,EAAE,QAA8B;QAChF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAEO,kBAAkB,CAAC,IAAwB,EAAE,QAA8B;QACjF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAA0B;QAC/B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,gBAAgB,CAAC;YAAE,OAAO,KAAK,CAAC;QACjE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE;YAAE,OAAO,KAAK,CAAC;QAC/C,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAEO,aAAa,CAAC,KAAyB,EAAE,KAAyB;QACxE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAClD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QACnD,OAAO,CACL,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YACtC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;YAC1C,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAC7C,CAAC;IACJ,CAAC;CACF;AAxND,4CAwNC"}

package/dist/lib/deque.d.ts

@@ -22,4 +22,8 @@ export declare class Deque<T> extends BaseCollection<T> implements Deque<T> {
      * Removes all elements from the deque
      */
     clear(): void;
+    /**
+     * Checks if two deques are equal.
+     */
+    equals(other: Deque<T>): boolean;
 }

package/dist/lib/deque.js

@@ -63,6 +63,14 @@ class Deque extends base_collection_1.BaseCollection {
     clear() {
         this.items.clear();
     }
+    /**
+     * Checks if two deques are equal.
+     */
+    equals(other) {
+        if (!other || !(other instanceof Deque))
+            return false;
+        return this.items.equals(other.items);
+    }
 }
 exports.Deque = Deque;
 //# sourceMappingURL=deque.js.map

package/dist/lib/deque.js.map

@@ -1 +1 @@
-{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../lib/deque.ts"],"names":[],"mappings":";;;AAAA,+CAA2C;AAC3C,uDAAmD;AAanD,MAAa,KAAS,SAAQ,gCAAiB;IACrC,KAAK,CAAgB;IAE7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,wBAAU,EAAK,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACF;AAtED,sBAsEC"}
+{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../lib/deque.ts"],"names":[],"mappings":";;;AAAA,+CAA2C;AAC3C,uDAAmD;AAWnD,MAAa,KAAS,SAAQ,gCAAiB;IACrC,KAAK,CAAgB;IAE7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,wBAAU,EAAK,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAU;QAClB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAU;QACjB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAe;QACpB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;CACF;AA9ED,sBA8EC"}

package/dist/lib/graph/base.d.ts

@@ -0,0 +1,167 @@
+import { BaseCollection } from '../base-collection';
+/**
+ * Base class for Graph data structure implementations.
+ * Provides common functionality that can be extended by specific implementations
+ * like LinkedList-based or Matrix-based graphs.
+ */
+export declare abstract class BaseGraph<V, W = number> extends BaseCollection<V> {
+    protected vertices: Set<V>;
+    protected vertexToIndex: Map<V, number>;
+    protected indexToVertex: Map<number, V>;
+    protected nextVertexIndex: number;
+    constructor();
+    /**
+     * Adds a vertex to the graph.
+     * @param vertex - The vertex to add
+     */
+    addVertex(vertex: V): void;
+    /**
+     * Removes a vertex from the graph and all its associated edges.
+     * @param vertex - The vertex to remove
+     */
+    removeVertex(vertex: V): void;
+    /**
+     * Adds an edge between two vertices with an optional weight.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @param weight - The weight of the edge (default: 1)
+     */
+    addEdge(from: V, to: V, weight?: W): void;
+    /**
+     * Removes an edge between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     */
+    removeEdge(from: V, to: V): void;
+    /**
+     * Gets all neighbors of a vertex.
+     * @param vertex - The vertex to get neighbors for
+     * @returns Array of neighboring vertices
+     */
+    getNeighbors(vertex: V): V[];
+    /**
+     * Gets the weight of an edge between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns The weight of the edge, or undefined if no edge exists
+     */
+    getEdgeWeight(from: V, to: V): W | undefined;
+    /**
+     * Gets all vertices in the graph.
+     * @returns Array of all vertices
+     */
+    getVertices(): V[];
+    /**
+     * Checks if a vertex exists in the graph.
+     * @param vertex - The vertex to check
+     * @returns True if the vertex exists, false otherwise
+     */
+    hasVertex(vertex: V): boolean;
+    /**
+     * Checks if an edge exists between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(from: V, to: V): boolean;
+    /**
+     * Returns the number of vertices in the graph.
+     * @returns The number of vertices
+     */
+    vertexCount(): number;
+    /**
+     * Returns the number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount(): number;
+    /**
+     * Clears all vertices and edges from the graph.
+     */
+    clear(): void;
+    /**
+     * Returns the number of elements (vertices) in the graph.
+     * @returns The number of vertices
+     */
+    size(): number;
+    /**
+     * Checks if the graph is empty.
+     * @returns True if the graph has no vertices, false otherwise
+     */
+    isEmpty(): boolean;
+    /**
+     * Checks if this graph equals another graph.
+     * @param other - The other graph to compare with
+     * @returns True if the graphs are equal, false otherwise
+     */
+    equals(other: BaseGraph<V, W>): boolean;
+    /**
+     * Gets the index of a vertex.
+     * @param vertex - The vertex to get the index for
+     * @returns The index of the vertex, or -1 if not found
+     */
+    protected getVertexIndex(vertex: V): number;
+    /**
+     * Gets the vertex at a given index.
+     * @param index - The index to get the vertex for
+     * @returns The vertex at the index, or undefined if not found
+     */
+    protected getVertexAt(index: number): V | undefined;
+    /**
+     * Gets all vertex indices.
+     * @returns Array of vertex indices
+     */
+    protected getAllVertexIndices(): number[];
+    /**
+     * Called when a vertex is added to the graph.
+     * @param vertex - The vertex that was added
+     */
+    protected abstract onVertexAdded(vertex: V): void;
+    /**
+     * Called when a vertex is removed from the graph.
+     * @param vertex - The vertex that was removed
+     * @param vertexIndex - The index of the removed vertex
+     */
+    protected abstract onVertexRemoved(vertex: V, vertexIndex: number): void;
+    /**
+     * Called when an edge is added to the graph.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @param weight - The weight of the edge
+     */
+    protected abstract onEdgeAdded(from: V, to: V, weight: W): void;
+    /**
+     * Called when an edge is removed from the graph.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     */
+    protected abstract onEdgeRemoved(from: V, to: V): void;
+    /**
+     * Gets the neighbors of a vertex.
+     * @param vertex - The vertex to get neighbors for
+     * @returns Array of neighboring vertices
+     */
+    protected abstract onGetNeighbors(vertex: V): V[];
+    /**
+     * Gets the weight of an edge between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns The weight of the edge, or undefined if no edge exists
+     */
+    protected abstract onGetEdgeWeight(from: V, to: V): W | undefined;
+    /**
+     * Checks if an edge exists between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns True if the edge exists, false otherwise
+     */
+    protected abstract onHasEdge(from: V, to: V): boolean;
+    /**
+     * Gets the total number of edges in the graph.
+     * @returns The number of edges
+     */
+    protected abstract onGetEdgeCount(): number;
+    /**
+     * Called when the graph is cleared.
+     */
+    protected abstract onClear(): void;
+}

package/dist/lib/graph/base.js

@@ -0,0 +1,233 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BaseGraph = void 0;
+const base_collection_1 = require("../base-collection");
+/**
+ * Base class for Graph data structure implementations.
+ * Provides common functionality that can be extended by specific implementations
+ * like LinkedList-based or Matrix-based graphs.
+ */
+class BaseGraph extends base_collection_1.BaseCollection {
+    vertices;
+    vertexToIndex;
+    indexToVertex;
+    nextVertexIndex;
+    constructor() {
+        super();
+        this.vertices = new Set();
+        this.vertexToIndex = new Map();
+        this.indexToVertex = new Map();
+        this.nextVertexIndex = 0;
+    }
+    /**
+     * Adds a vertex to the graph.
+     * @param vertex - The vertex to add
+     */
+    addVertex(vertex) {
+        if (!this.vertices.has(vertex)) {
+            this.vertices.add(vertex);
+            this.vertexToIndex.set(vertex, this.nextVertexIndex);
+            this.indexToVertex.set(this.nextVertexIndex, vertex);
+            this.nextVertexIndex++;
+            this.onVertexAdded(vertex);
+        }
+    }
+    /**
+     * Removes a vertex from the graph and all its associated edges.
+     * @param vertex - The vertex to remove
+     */
+    removeVertex(vertex) {
+        if (this.vertices.has(vertex)) {
+            const vertexIndex = this.vertexToIndex.get(vertex);
+            // Remove all edges connected to this vertex
+            this.getVertices().forEach((otherVertex) => {
+                if (otherVertex !== vertex) {
+                    this.removeEdge(vertex, otherVertex);
+                    this.removeEdge(otherVertex, vertex);
+                }
+            });
+            // Remove from tracking collections
+            this.vertices.delete(vertex);
+            this.indexToVertex.delete(vertexIndex);
+            this.vertexToIndex.delete(vertex);
+            this.onVertexRemoved(vertex, vertexIndex);
+        }
+    }
+    /**
+     * Adds an edge between two vertices with an optional weight.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @param weight - The weight of the edge (default: 1)
+     */
+    addEdge(from, to, weight = 1) {
+        if (!this.vertices.has(from)) {
+            this.addVertex(from);
+        }
+        if (!this.vertices.has(to)) {
+            this.addVertex(to);
+        }
+        if (from !== to) {
+            this.onEdgeAdded(from, to, weight);
+        }
+    }
+    /**
+     * Removes an edge between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     */
+    removeEdge(from, to) {
+        if (this.vertices.has(from) && this.vertices.has(to)) {
+            this.onEdgeRemoved(from, to);
+        }
+    }
+    /**
+     * Gets all neighbors of a vertex.
+     * @param vertex - The vertex to get neighbors for
+     * @returns Array of neighboring vertices
+     */
+    getNeighbors(vertex) {
+        if (!this.vertices.has(vertex)) {
+            return [];
+        }
+        return this.onGetNeighbors(vertex);
+    }
+    /**
+     * Gets the weight of an edge between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns The weight of the edge, or undefined if no edge exists
+     */
+    getEdgeWeight(from, to) {
+        if (!this.vertices.has(from) || !this.vertices.has(to)) {
+            return undefined;
+        }
+        return this.onGetEdgeWeight(from, to);
+    }
+    /**
+     * Gets all vertices in the graph.
+     * @returns Array of all vertices
+     */
+    getVertices() {
+        return Array.from(this.vertices);
+    }
+    /**
+     * Checks if a vertex exists in the graph.
+     * @param vertex - The vertex to check
+     * @returns True if the vertex exists, false otherwise
+     */
+    hasVertex(vertex) {
+        return this.vertices.has(vertex);
+    }
+    /**
+     * Checks if an edge exists between two vertices.
+     * @param from - The source vertex
+     * @param to - The destination vertex
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(from, to) {
+        if (!this.vertices.has(from) || !this.vertices.has(to)) {
+            return false;
+        }
+        return this.onHasEdge(from, to);
+    }
+    /**
+     * Returns the number of vertices in the graph.
+     * @returns The number of vertices
+     */
+    vertexCount() {
+        return this.vertices.size;
+    }
+    /**
+     * Returns the number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount() {
+        return this.onGetEdgeCount();
+    }
+    /**
+     * Clears all vertices and edges from the graph.
+     */
+    clear() {
+        this.vertices.clear();
+        this.vertexToIndex.clear();
+        this.indexToVertex.clear();
+        this.nextVertexIndex = 0;
+        this.onClear();
+    }
+    /**
+     * Returns the number of elements (vertices) in the graph.
+     * @returns The number of vertices
+     */
+    size() {
+        return this.vertexCount();
+    }
+    /**
+     * Checks if the graph is empty.
+     * @returns True if the graph has no vertices, false otherwise
+     */
+    isEmpty() {
+        return this.vertices.size === 0;
+    }
+    /**
+     * Checks if this graph equals another graph.
+     * @param other - The other graph to compare with
+     * @returns True if the graphs are equal, false otherwise
+     */
+    equals(other) {
+        if (!(other instanceof BaseGraph)) {
+            return false;
+        }
+        if (this.vertexCount() !== other.vertexCount()) {
+            return false;
+        }
+        const thisVertices = this.getVertices();
+        const otherVertices = other.getVertices();
+        // Check if all vertices exist in both graphs
+        for (const vertex of thisVertices) {
+            if (!other.hasVertex(vertex)) {
+                return false;
+            }
+        }
+        // Check if all edges exist in both graphs
+        for (const from of thisVertices) {
+            for (const to of thisVertices) {
+                if (this.hasEdge(from, to) !== other.hasEdge(from, to)) {
+                    return false;
+                }
+                if (this.hasEdge(from, to)) {
+                    const thisWeight = this.getEdgeWeight(from, to);
+                    const otherWeight = other.getEdgeWeight(from, to);
+                    if (thisWeight !== otherWeight) {
+                        return false;
+                    }
+                }
+            }
+        }
+        return true;
+    }
+    /**
+     * Gets the index of a vertex.
+     * @param vertex - The vertex to get the index for
+     * @returns The index of the vertex, or -1 if not found
+     */
+    getVertexIndex(vertex) {
+        return this.vertexToIndex.get(vertex) ?? -1;
+    }
+    /**
+     * Gets the vertex at a given index.
+     * @param index - The index to get the vertex for
+     * @returns The vertex at the index, or undefined if not found
+     */
+    getVertexAt(index) {
+        return this.indexToVertex.get(index);
+    }
+    /**
+     * Gets all vertex indices.
+     * @returns Array of vertex indices
+     */
+    getAllVertexIndices() {
+        return Array.from(this.vertexToIndex.values());
+    }
+}
+exports.BaseGraph = BaseGraph;
+//# sourceMappingURL=base.js.map

package/dist/lib/graph/base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.js","sourceRoot":"","sources":["../../../lib/graph/base.ts"],"names":[],"mappings":";;;AAAA,wDAAoD;AAEpD;;;;GAIG;AACH,MAAsB,SAAyB,SAAQ,gCAAiB;IAC5D,QAAQ,CAAS;IACjB,aAAa,CAAiB;IAC9B,aAAa,CAAiB;IAC9B,eAAe,CAAS;IAElC;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAK,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAa,CAAC;QAC1C,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAa,CAAC;QAC1C,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,MAAS;QACjB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;YACrD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAS;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAEpD,4CAA4C;YAC5C,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE;gBACzC,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;oBAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;oBACrC,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,mCAAmC;YACnC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAElC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,IAAO,EAAE,EAAK,EAAE,SAAY,CAAM;QACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,IAAO,EAAE,EAAK;QACvB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,MAAS;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAO,EAAE,EAAK;QAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAS;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,IAAO,EAAE,EAAK;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAsB;QAC3B,IAAI,CAAC,CAAC,KAAK,YAAY,SAAS,CAAC,EAAE,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAE1C,6CAA6C;QAC7C,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;oBACvD,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAChD,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAClD,IAAI,UAAU,KAAK,WAAW,EAAE,CAAC;wBAC/B,OAAO,KAAK,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACO,cAAc,CAAC,MAAS;QAChC,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACO,WAAW,CAAC,KAAa;QACjC,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED;;;OAGG;IACO,mBAAmB;QAC3B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;CAiEF;AAvTD,8BAuTC"}

package/dist/lib/graph/linked-list-graph.d.ts

@@ -0,0 +1,18 @@
+import { BaseGraph } from './base';
+/**
+ * LinkedList-based Graph implementation.
+ * Uses adjacency lists to represent the graph.
+ */
+export declare class LinkedListGraph<V, W = number> extends BaseGraph<V, W> {
+    private adjacencyLists;
+    constructor();
+    protected onVertexAdded(vertex: V): void;
+    protected onVertexRemoved(vertex: V, vertexIndex: number): void;
+    protected onEdgeAdded(from: V, to: V, weight: W): void;
+    protected onEdgeRemoved(from: V, to: V): void;
+    protected onGetNeighbors(vertex: V): V[];
+    protected onGetEdgeWeight(from: V, to: V): W | undefined;
+    protected onHasEdge(from: V, to: V): boolean;
+    protected onGetEdgeCount(): number;
+    protected onClear(): void;
+}