avl-tree-typed 1.52.4 → 1.52.5

package/src/data-structures/graph/directed-graph.ts

@@ -81,11 +81,6 @@ export class DirectedGraph<
     this._inEdgeMap = v;
   }
 
-  /**
-   * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-   * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-   */
-
   /**
    * The function creates a new vertex with an optional value and returns it.
    * @param {VertexKey} key - The `key` parameter is the unique identifier for the vertex. It is of type `VertexKey`, which
@@ -99,11 +94,6 @@ export class DirectedGraph<
     return new DirectedVertex(key, value) as VO;
   }
 
-  /**
-   * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
-   * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
-   */
-
   /**
    * The function creates a directed edge between two vertexMap with an optional weight and value.
    * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
@@ -118,11 +108,6 @@ export class DirectedGraph<
     return new DirectedEdge(src, dest, weight ?? 1, value) as EO;
   }
 
-  /**
-   * Time Complexity: O(|V|) where |V| is the number of vertexMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|V|) where |V| is the number of vertexMap
    * Space Complexity: O(1)
@@ -152,11 +137,6 @@ export class DirectedGraph<
     return edgeMap[0] || undefined;
   }
 
-  /**
-   * Time Complexity: O(|E|) where |E| is the number of edgeMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|) where |E| is the number of edgeMap
    * Space Complexity: O(1)
@@ -186,11 +166,6 @@ export class DirectedGraph<
     return removed;
   }
 
-  /**
-   * Time Complexity: O(E) where E is the number of edgeMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(E) where E is the number of edgeMap
    * Space Complexity: O(1)
@@ -234,11 +209,6 @@ export class DirectedGraph<
     return removed;
   }
 
-  /**
-   * Time Complexity: O(1) - Constant time for Map operations.
-   * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-   */
-
   /**
    * Time Complexity: O(1) - Constant time for Map operations.
    * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -272,11 +242,6 @@ export class DirectedGraph<
     return this._vertexMap.delete(vertexKey);
   }
 
-  /**
-   * Time Complexity: O(|E|) where |E| is the number of edgeMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|) where |E| is the number of edgeMap
    * Space Complexity: O(1)
@@ -302,11 +267,6 @@ export class DirectedGraph<
     return removed;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -324,11 +284,6 @@ export class DirectedGraph<
     return [];
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -346,11 +301,6 @@ export class DirectedGraph<
     return [];
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -363,11 +313,6 @@ export class DirectedGraph<
     return this.outDegreeOf(vertexOrKey) + this.inDegreeOf(vertexOrKey);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -380,11 +325,6 @@ export class DirectedGraph<
     return this.incomingEdgesOf(vertexOrKey).length;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -397,11 +337,6 @@ export class DirectedGraph<
     return this.outgoingEdgesOf(vertexOrKey).length;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -414,11 +349,6 @@ export class DirectedGraph<
     return [...this.outgoingEdgesOf(vertexOrKey), ...this.incomingEdgesOf(vertexOrKey)];
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -431,11 +361,6 @@ export class DirectedGraph<
     return this._getVertex(e.src);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -448,11 +373,6 @@ export class DirectedGraph<
     return this._getVertex(e.dest);
   }
 
-  /**
-   * Time Complexity: O(|E|) where |E| is the number of edgeMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|) where |E| is the number of edgeMap
    * Space Complexity: O(1)
@@ -477,11 +397,6 @@ export class DirectedGraph<
     return destinations;
   }
 
-  /**
-   * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
-   * Space Complexity: O(|V|)
-   */
-
   /**
    * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
    * Space Complexity: O(|V|)
@@ -531,11 +446,6 @@ export class DirectedGraph<
     return sorted.reverse();
   }
 
-  /**
-   * Time Complexity: O(|E|) where |E| is the number of edgeMap
-   * Space Complexity: O(|E|)
-   */
-
   /**
    * Time Complexity: O(|E|) where |E| is the number of edgeMap
    * Space Complexity: O(|E|)
@@ -551,11 +461,6 @@ export class DirectedGraph<
     return edgeMap;
   }
 
-  /**
-   * Time Complexity: O(|E|) where |E| is the number of edgeMap
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|) where |E| is the number of edgeMap
    * Space Complexity: O(1)
@@ -581,11 +486,6 @@ export class DirectedGraph<
     return neighbors;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -618,11 +518,6 @@ export class DirectedGraph<
     return this.vertexMap.size === 0 && this.inEdgeMap.size === 0 && this.outEdgeMap.size === 0;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -648,13 +543,6 @@ export class DirectedGraph<
     return cloned;
   }
 
-  /**
-   *  Time Complexity: O(V + E)
-   *  Space Complexity: O(V)
-   *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-   *  Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
-   */
-
   /**
    *  Time Complexity: O(V + E)
    *  Space Complexity: O(V)
@@ -717,11 +605,6 @@ export class DirectedGraph<
     return { dfnMap, lowMap, SCCs };
   }
 
-  /**
-   * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
-   * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
-   */
-
   /**
    * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
    * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
@@ -753,11 +636,6 @@ export class DirectedGraph<
     return this.tarjan().SCCs;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)

package/src/data-structures/graph/undirected-graph.ts

@@ -96,11 +96,6 @@ export class UndirectedGraph<
     return new UndirectedEdge(v1, v2, weight ?? 1, value) as EO;
   }
 
-  /**
-   * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
    * Space Complexity: O(1)
@@ -127,11 +122,6 @@ export class UndirectedGraph<
     return edgeMap ? edgeMap[0] || undefined : undefined;
   }
 
-  /**
-   * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
    * Space Complexity: O(1)
@@ -162,11 +152,6 @@ export class UndirectedGraph<
     return removed;
   }
 
-  /**
-   * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
    * Space Complexity: O(1)
@@ -201,11 +186,6 @@ export class UndirectedGraph<
     }
   }
 
-  /**
-   * Time Complexity: O(1) - Constant time for Map operations.
-   * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-   */
-
   /**
    * Time Complexity: O(1) - Constant time for Map operations.
    * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -244,11 +224,6 @@ export class UndirectedGraph<
     return this._vertexMap.delete(vertexKey);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -268,11 +243,6 @@ export class UndirectedGraph<
     }
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -291,11 +261,6 @@ export class UndirectedGraph<
     }
   }
 
-  /**
-   * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-   * Space Complexity: O(|E|)
-   */
-
   /**
    * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
    * Space Complexity: O(|E|)
@@ -313,11 +278,6 @@ export class UndirectedGraph<
     return [...edgeSet];
   }
 
-  /**
-   * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-   * Space Complexity: O(|E|)
-   */
-
   /**
    * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
    * Space Complexity: O(|E|)
@@ -342,11 +302,6 @@ export class UndirectedGraph<
     return neighbors;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -378,11 +333,6 @@ export class UndirectedGraph<
     return this.vertexMap.size === 0 && this.edgeMap.size === 0;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -410,11 +360,6 @@ export class UndirectedGraph<
     return cloned;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    *  Time Complexity: O(V + E)
    *  Space Complexity: O(V)
@@ -484,13 +429,6 @@ export class UndirectedGraph<
     };
   }
 
-  /**
-   *  Time Complexity: O(V + E)
-   *  Space Complexity: O(V)
-   *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-   *  1. Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time
-   */
-
   /**
    * The function "getBridges" returns an array of bridges in a graph using the Tarjan's algorithm.
    * @returns The function `getBridges()` is returning the bridges found using the Tarjan's algorithm.