@raikuxq/alg-ds 1.1.2 → 1.1.5

package/src/data-structures/LoopedArray/LoopedArray.ts

@@ -1,182 +0,0 @@
-import IArrayFacade from "../../types/IArrayFacade";
-
-/**
- * Linear data structure
- * Facade above array
- * After reaching full array new pushed elements will be overwritten over old elements
- */
-export default class LoopedArray<T> implements IArrayFacade<T> {
-  private readonly _capacity: number;
-  private _realLength = 0;
-  private _array: Array<T>;
-
-  /**
-   * Create empty instance
-   */
-  constructor(capacity: number) {
-    if (capacity <= 0) {
-      throw new Error("Capacity must be larger than 0");
-    }
-    this._capacity = capacity;
-    this._array = new Array<T>(0);
-  }
-
-  /**
-   * Push into end
-   */
-  public push(value: T): void {
-    if (this._realLength % this._capacity === 0) {
-      this._array = new Array<T>(0);
-    }
-
-    this._realLength++;
-
-    if (!this.isFull()) {
-      this._array.push(value);
-    } else {
-      const indexToPush = (this._realLength % this._capacity) - 1;
-      this._array.splice(indexToPush, 1, value);
-    }
-  }
-
-  /**
-   * Push into start
-   */
-  public unshift(value: T): void {
-    if (this._realLength % this._capacity === 0) {
-      this._array = new Array<T>(0);
-    }
-    this._realLength++;
-
-    if (!this.isFull()) {
-      this._array.unshift(value);
-    } else {
-      this._array.splice(this._capacity - 1);
-      this._array.unshift(value);
-    }
-  }
-
-  /**
-   * Delete node from array's end
-   */
-  public pop(): T {
-    this._realLength--;
-    const deletedItem = this._array.pop();
-    if (deletedItem === undefined)
-      throw new Error(
-        "cannot delete last element because of it does not exists"
-      );
-    return deletedItem;
-  }
-
-  /**
-   * Delete node from array's start
-   */
-  public shift(): T {
-    this._realLength--;
-    const deletedItem = this._array.shift();
-    if (deletedItem === undefined)
-      throw new Error(
-        "cannot delete first element because of it does not exists"
-      );
-    return deletedItem;
-  }
-
-  /**
-   * Get head element data
-   * @throws Error when head does not exists
-   */
-  public peek(): T {
-    return this._array[this._array.length - 1];
-  }
-
-  /**
-   * Get tail element data
-   * @throws Error when head does not exists
-   */
-  public peekFromStart(): T {
-    return this._array[0];
-  }
-
-  /**
-   * Get array element by index from start
-   * @throws when element does not exists
-   */
-  peekByIndex(index: number): T {
-    return this._array[index];
-  }
-
-  /**
-   * Push from index
-   */
-  pushFromIndex(value: T, fromIndex: number): void {
-    this._array[fromIndex] = value;
-  }
-
-  /**
-   * Get elements as array
-   */
-  public getAsArray(): Array<T> {
-    return this._array;
-  }
-
-  /**
-   * Check if element exists in array
-   */
-  public has(item: T): boolean {
-    return this._array.includes(item);
-  }
-
-  /**
-   * Is array empty
-   */
-  public isEmpty(): boolean {
-    return this._array.length === 0;
-  }
-
-  /**
-   * Is array full
-   */
-  public isFull(): boolean {
-    return this._array.length >= this._capacity;
-  }
-
-  /**
-   * List length
-   */
-  public length(): number {
-    return this._array.length;
-  }
-
-  /**
-   * Remove all elements from array
-   */
-  public clear(): void {
-    this._array = new Array<T>(0);
-  }
-
-  /**
-   * Delete node from array by index from start
-   */
-  deleteFromIndex(fromIndex: number): T {
-    const deletedElement = this._array[fromIndex];
-    delete this._array[fromIndex];
-    return deletedElement;
-  }
-
-  /**
-   * Add elements to array from array
-   * */
-  pushFromArray(elements: Array<T>): void {
-    elements.forEach((element: T) => {
-      this.push(element);
-    });
-  }
-
-  /**
-   * Reverse array nodes links and swap head with tail
-   */
-  reverse(): void {
-    this._array = this._array.reverse();
-  }
-}

package/src/data-structures/Queue/Queue.ts

@@ -1,92 +0,0 @@
-import DoubleLinkedList from "../LinkedList/DoubleLinkedList/DoubleLinkedList";
-import ILinearStorage from "../../types/ILinearStorage";
-import ILinearStorageRA from "../../types/ILinearStorageRA";
-
-/**
- * FIFO data structure
- */
-export default class Queue<T> implements ILinearStorage<T> {
-  private readonly _list: ILinearStorageRA<T>;
-
-  /**
-   * Create a queue instance
-   */
-  public constructor(capacity?: number) {
-    this._list = new DoubleLinkedList<T>(capacity);
-  }
-
-  /**
-   * Get first element in queue (without deleting)
-   * @throws when list is empty
-   */
-  public peek(): T {
-    if (this.isEmpty()) {
-      throw new Error("Cannot peek when list is empty");
-    }
-    return this._list.peek();
-  }
-
-  /**
-   * Add element to queue
-   * @throws when list is full
-   */
-  public push(item: T): void {
-    if (this._list.isFull()) {
-      throw new Error("Cannot push when queue is full");
-    }
-    this._list.unshift(item);
-  }
-
-  /**
-   * Delete first element in queue
-   * @throws when list is empty
-   */
-  public pop(): T {
-    if (this.isEmpty()) {
-      throw new Error("Cannot pop when list is empty");
-    }
-    return this._list.pop();
-  }
-
-  /**
-   * Check if element exists in list
-   */
-  public has(item: T): boolean {
-    return this._list.has(item);
-  }
-
-  /**
-   * Is queue empty
-   */
-  public isEmpty(): boolean {
-    return this._list.isEmpty();
-  }
-
-  /**
-   * Is stack full
-   */
-  public isFull(): boolean {
-    return this._list.isFull();
-  }
-
-  /**
-   * Remove all elements in queue
-   */
-  public clear(): void {
-    this._list.clear();
-  }
-
-  /**
-   * Queue length
-   */
-  public length(): number {
-    return this._list.length();
-  }
-
-  /**
-   * Reverse queue
-   */
-  public reverse(): void {
-    this._list.reverse();
-  }
-}

package/src/data-structures/Stack/Stack.ts

@@ -1,92 +0,0 @@
-import DoubleLinkedList from "../LinkedList/DoubleLinkedList/DoubleLinkedList";
-import ILinearStorage from "../../types/ILinearStorage";
-import ILinearStorageRA from "../../types/ILinearStorageRA";
-
-/**
- * LIFO data structure
- */
-export default class Stack<T> implements ILinearStorage<T> {
-  private readonly _list: ILinearStorageRA<T>;
-
-  /**
-   * Create a stack instance
-   */
-  public constructor(capacity?: number) {
-    this._list = new DoubleLinkedList(capacity);
-  }
-
-  /**
-   * Get stack top element
-   * @throws when list is empty
-   */
-  public peek(): T {
-    if (this.isEmpty()) {
-      throw new Error("Cannot peek when list is empty");
-    }
-    return this._list.peek();
-  }
-
-  /**
-   * Add element to stack head
-   * @throws when list is full
-   */
-  public push(item: T): void {
-    if (this.isFull()) {
-      throw new Error("Stack is full");
-    }
-    this._list.push(item);
-  }
-
-  /**
-   * Remove element from stack head
-   * @throws when list is empty
-   */
-  public pop(): T {
-    if (this.isEmpty()) {
-      throw new Error("Cannot pop when stack is empty");
-    }
-    return this._list.pop();
-  }
-
-  /**
-   * Check if element exists in list
-   */
-  public has(item: T): boolean {
-    return this._list.has(item);
-  }
-
-  /**
-   * Is stack empty
-   */
-  public isEmpty(): boolean {
-    return this._list.isEmpty();
-  }
-
-  /**
-   * Is stack full
-   */
-  public isFull(): boolean {
-    return this._list.isFull();
-  }
-
-  /**
-   * Remove all elements in stack
-   */
-  public clear(): void {
-    this._list.clear();
-  }
-
-  /**
-   * Queue length
-   */
-  public length(): number {
-    return this._list.length();
-  }
-
-  /**
-   * Reverse stack
-   */
-  public reverse(): void {
-    this._list.reverse();
-  }
-}

package/src/demo/demo.bst.ts

@@ -1,67 +0,0 @@
-import BinarySearchTree from "../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import { EnumTreeTraversalType } from "../types/EnumTreeTraversalType";
-// eslint-disable-next-line @typescript-eslint/no-var-requires
-const util = require("util");
-
-const logTree = <T>(tree: BinarySearchTree<T>) => {
-  console.log(
-    util.inspect(tree, { showHidden: false, depth: null, colors: true })
-  );
-
-  console.log("IN ORDER TRAVERSE");
-  console.log(tree.traverse(EnumTreeTraversalType.InOrder));
-  console.log("PRE ORDER TRAVERSE");
-  console.log(tree.traverse(EnumTreeTraversalType.PreOrder));
-  console.log("POST ORDER TRAVERSE");
-  console.log(tree.traverse(EnumTreeTraversalType.PostOrder));
-  console.log("HEIGHT");
-  console.log(tree.height());
-  console.log("LENGTH");
-  console.log(tree.length());
-  console.log("MAX");
-  console.log(tree.max());
-  console.log("MIN");
-  console.log(tree.min());
-};
-
-export const demoBst = (): void => {
-  const bst = new BinarySearchTree<number>();
-
-  bst.insert(22);
-  bst.insert(4);
-  bst.insert(16);
-  bst.insert(19);
-  bst.insert(15);
-  bst.insert(8);
-  bst.insert(23);
-  logTree(bst);
-
-  bst.delete(15);
-  logTree(bst);
-};
-
-class Human {
-  public readonly age: number;
-  public readonly name: string;
-
-  public constructor(name: string, age: number) {
-    this.age = age;
-    this.name = name;
-  }
-}
-
-export const demoBstObjects = (): void => {
-  const bst = new BinarySearchTree<Human>((human1, human2) => {
-    return human1.age > human2.age;
-  });
-
-  bst.insert(new Human("Bob", 22));
-  bst.insert(new Human("Alice", 14));
-  bst.insert(new Human("John", 16));
-  bst.insert(new Human("Boris", 19));
-  bst.insert(new Human("Anna", 15));
-  bst.insert(new Human("Dmitry", 8));
-  bst.insert(new Human("Alex", 23));
-
-  logTree(bst);
-};

package/src/demo/demo.graph.ts

@@ -1,246 +0,0 @@
-import IGraph from "../types/IGraph";
-import { createGraph } from "../helpers/createGraph";
-import { EnumGraphType } from "../types/EnumGraphType";
-import { generateRandomGraph } from "../data-structures/Graph/demo/generateRandomGraph";
-import { shortestPath } from "../data-structures/Graph/searching/shortestPath";
-import BFSIterationStrategy from "../data-structures/Graph/strategy/BFSIterationStrategy";
-
-export const demoUndirectedGraph = (): void => {
-  console.log("\nEmpty undirected graph created");
-  const graph: IGraph<string> = createGraph(EnumGraphType.Undirected);
-
-  graph.addVertex("John");
-  graph.addVertex("Mary");
-  graph.addVertex("Kate");
-  console.log("\nJohn, Mary and Kate was added to graph");
-  console.log("Vertices count:");
-  console.log(graph.verticesCount());
-  console.log("Vertices list:");
-  console.log(graph.vertices());
-
-  console.log("\nChecking is graph hasVertex John: ");
-  console.log(graph.hasVertex("John"));
-
-  graph.removeVertex("John");
-  console.log("\nDeleting vertex John... ");
-  console.log("\nChecking is graph hasVertex John: ");
-  console.log(graph.hasVertex("John"));
-  console.log(graph);
-
-  graph.addVertex("Bob");
-  graph.addVertex("Elon");
-  console.log("\nAdding Bob и Elon: ");
-  console.log(graph);
-
-  graph.addEdge("Bob", "Elon", 5);
-  console.log("\nAdding edge between Bob and Elon: ");
-  console.log("\nHas edge between Bob и Elon: ");
-  console.log(graph.hasEdge("Bob", "Elon"));
-  console.log("\nHas edge between Elon и Bob: ");
-  console.log(graph.hasEdge("Elon", "Bob"));
-  console.log("\nEdge weight between Bob и Elon: ");
-  console.log(graph.getEdgeWeight("Bob", "Elon"));
-  console.log("\nEdge weight between Elon and Kate: ");
-  console.log(graph.getEdgeWeight("Elon", "Bob"));
-  console.log("==========================================");
-
-  graph.addEdge("Kate", "Elon", 12);
-  console.log("\nAdding edge between Kate and Elon: ");
-  console.log("\nHas edge between Kate и Elon: ");
-  console.log(graph.hasEdge("Kate", "Elon"));
-  console.log("\nHas edge between Elon и Kate: ");
-  console.log(graph.hasEdge("Elon", "Kate"));
-  console.log("\nEdge weight between Kate и Elon: ");
-  console.log(graph.getEdgeWeight("Kate", "Elon"));
-  console.log("\nEdge weight between Elon and Kate: ");
-  console.log(graph.getEdgeWeight("Elon", "Kate"));
-  console.log("==========================================");
-
-  graph.addEdge("Kate", "Mary", 8);
-  console.log("\nAdding edge between Kate and Mary: ");
-  console.log("\nHas edge between Kate и Mary: ");
-  console.log(graph.hasEdge("Kate", "Mary"));
-  console.log("\nHas edge between Mary и Kate: ");
-  console.log(graph.hasEdge("Mary", "Kate"));
-  console.log("\nEdge weight between Kate и Mary: ");
-  console.log(graph.getEdgeWeight("Kate", "Mary"));
-  console.log("\nEdge weight between Mary and Kate: ");
-  console.log(graph.getEdgeWeight("Mary", "Kate"));
-  console.log("==========================================");
-
-  console.log("Edges count:");
-  console.log(graph.edgesCount());
-
-  console.log("Elon neighbors:");
-  console.log(graph.getVertexNeighbors("Elon"));
-  console.log("Bob neighbors:");
-  console.log(graph.getVertexNeighbors("Bob"));
-  console.log("Kate neighbors:");
-  console.log(graph.getVertexNeighbors("Kate"));
-  console.log("Mary neighbors:");
-  console.log(graph.getVertexNeighbors("Mary"));
-
-  console.log("\nGraph weight: ");
-  console.log(graph.weight());
-
-  console.log("\nUpdating edge between Elon and Bob: ");
-  graph.addEdge("Elon", "Bob", 10);
-  console.log("\nEdge weight between Bob и Elon: ");
-  console.log(graph.getEdgeWeight("Bob", "Elon"));
-  console.log("\nEdge weight between Elon and Kate: ");
-  console.log(graph.getEdgeWeight("Elon", "Bob"));
-  console.log("==========================================");
-
-  console.log("\nGraph weight after one edge weight was updated: ");
-  console.log(graph.weight());
-
-  graph.removeEdge("Bob", "Elon");
-  console.log("\nRemove edge between Bob and Elon: ");
-  console.log("\nGraph after one edge weight was deleted: ");
-  console.log(graph);
-
-  graph.removeVertex("Kate");
-  console.log("\nRemove vertex Kate and cascade all related edges: ");
-  console.log(graph);
-};
-
-export const demoDirectedGraph = (): void => {
-  console.log("\nEmpty directed graph created");
-  const graph: IGraph<string> = createGraph(EnumGraphType.Directed);
-
-  graph.addVertex("John");
-  graph.addVertex("Mary");
-  graph.addVertex("Kate");
-  console.log("\nJohn, Mary and Kate was added to graph");
-  console.log("Vertices count:");
-  console.log(graph.verticesCount());
-  console.log("Vertices list:");
-  console.log(graph.vertices());
-
-  console.log("\nChecking is graph hasVertex John: ");
-  console.log(graph.hasVertex("John"));
-
-  graph.removeVertex("John");
-  console.log("\nDeleting vertex John... ");
-  console.log("\nChecking is graph hasVertex John: ");
-  console.log(graph.hasVertex("John"));
-  console.log(graph);
-
-  graph.addVertex("Bob");
-  graph.addVertex("Elon");
-  console.log("\nAdding Bob и Elon: ");
-  console.log(graph);
-
-  graph.addEdge("Bob", "Elon", 5);
-  console.log("\nAdding edge between Bob and Elon: ");
-  console.log("\nHas edge between Bob и Elon: ");
-  console.log(graph.hasEdge("Bob", "Elon"));
-  console.log("\nHas edge between Elon и Bob: ");
-  console.log(graph.hasEdge("Elon", "Bob"));
-  console.log("\nEdge weight between Bob и Elon: ");
-  console.log(graph.getEdgeWeight("Bob", "Elon"));
-  console.log("==========================================");
-
-  graph.addEdge("Kate", "Elon", 12);
-  console.log("\nAdding edge between Kate and Elon: ");
-  console.log("\nHas edge between Kate и Elon: ");
-  console.log(graph.hasEdge("Kate", "Elon"));
-  console.log("\nHas edge between Elon и Kate: ");
-  console.log(graph.hasEdge("Elon", "Kate"));
-  console.log("\nEdge weight between Kate и Elon: ");
-  console.log(graph.getEdgeWeight("Kate", "Elon"));
-  console.log("==========================================");
-
-  graph.addEdge("Kate", "Mary", 8);
-  console.log("\nAdding edge between Kate and Mary: ");
-  console.log("\nHas edge between Kate и Mary: ");
-  console.log(graph.hasEdge("Kate", "Mary"));
-  console.log("\nHas edge between Mary и Kate: ");
-  console.log(graph.hasEdge("Mary", "Kate"));
-  console.log("\nEdge weight between Kate и Mary: ");
-  console.log(graph.getEdgeWeight("Kate", "Mary"));
-  console.log("==========================================");
-
-  console.log("Edges count:");
-  console.log(graph.edgesCount());
-
-  console.log("Elon neighbors:");
-  console.log(graph.getVertexNeighbors("Elon"));
-  console.log("Bob neighbors:");
-  console.log(graph.getVertexNeighbors("Bob"));
-  console.log("Kate neighbors:");
-  console.log(graph.getVertexNeighbors("Kate"));
-  console.log("Mary neighbors:");
-  console.log(graph.getVertexNeighbors("Mary"));
-
-  console.log("\nGraph weight: ");
-  console.log(graph.weight());
-
-  console.log("\nAdding edge between Elon and Bob: ");
-  graph.addEdge("Elon", "Bob", 10);
-  console.log("\nEdge weight between Elon и Bob: ");
-  console.log(graph.getEdgeWeight("Elon", "Bob"));
-  console.log("\nEdge weight between Bob and Elon: ");
-  console.log(graph.getEdgeWeight("Bob", "Elon"));
-  console.log("==========================================");
-  console.log(graph);
-
-  console.log("\nGraph weight after one edge weight was updated: ");
-  console.log(graph.weight());
-
-  graph.removeEdge("Bob", "Elon");
-  console.log("\nRemove edge between Bob and Elon: ");
-  console.log("\nGraph after one edge weight was deleted: ");
-  console.log(graph);
-
-  graph.removeVertex("Kate");
-  console.log("\nRemove vertex Kate and cascade all related edges: ");
-  console.log(graph);
-};
-
-export const demoGraphGeneratedByType = (
-  type: EnumGraphType,
-  verticesCount: number,
-  edgesCount: number
-): void => {
-  const bfsIteration = new BFSIterationStrategy<string>();
-  const graph: IGraph<string> = generateRandomGraph(
-    verticesCount,
-    edgesCount,
-    type
-  );
-  console.log(
-    `\nGenerated ${type.toLocaleLowerCase()} graph (N = ${verticesCount}, K = ${edgesCount}): \n`
-  );
-  console.log(graph);
-
-  console.log(`\nFinding shortest path via BFS: \n`);
-  graph.vertices().forEach((vertexFrom: string) => {
-    graph.vertices().forEach((vertexTo: string) => {
-      const getPath = () => {
-        try {
-          return shortestPath<string>(
-            graph,
-            vertexFrom,
-            vertexTo,
-            bfsIteration
-          );
-        } catch (e) {
-          return `[-- ${e.message} --]`;
-        }
-      };
-
-      if (vertexFrom !== vertexTo) {
-        console.log(`\nShortest path from ${vertexFrom} to ${vertexTo} is:`);
-        console.log(getPath());
-      }
-    });
-  });
-};
-
-export const demoGraphGenerated = (): void => {
-  const verticesCount = 6;
-  const edgesCount = 6;
-  demoGraphGeneratedByType(EnumGraphType.Directed, verticesCount, edgesCount);
-  demoGraphGeneratedByType(EnumGraphType.Undirected, verticesCount, edgesCount);
-};

package/src/demo/demo.hashtable.ts

@@ -1,28 +0,0 @@
-import HashTable from "../data-structures/HashTable/HashTable";
-
-export const demoHashtable = (): void => {
-  const hashTable = new HashTable<number>(15);
-
-  // emulate 66% load
-  for (let i = 0; i < 10; i++) {
-    hashTable.set(`key${i * 2}`, i * 2);
-  }
-  console.log(hashTable);
-
-  for (let i = 10; i < 15; i++) {
-    hashTable.set(`key${i * 2}`, i * 2);
-  }
-  console.log(hashTable);
-  console.log("\n length:", hashTable.length());
-
-  hashTable.set("key4", 10000);
-  console.log("\n", hashTable.get("key4"));
-  hashTable.delete("key4");
-  console.log("\n has key4:", hashTable.has("key4"));
-  hashTable.set("key4", 20000);
-  console.log("\n has key4:", hashTable.has("key4"));
-  console.log("\n key4 value:", hashTable.get("key4"));
-  console.log("\n", hashTable);
-  hashTable.clear();
-  console.log("\n", hashTable);
-};