data-structure-typed 1.42.5 → 1.42.7

package/README.md

@@ -25,11 +25,6 @@ Now you can use this library in Node.js and browser environments in CommonJS(req
 [//]: # (![Lines](https://img.shields.io/badge/lines-68.6%25-red.svg?style=flat))
 
 
-## Built-in classic algorithms
-
-DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm,
-Floyd-Warshall Algorithm, Tarjan's Algorithm.
-
 ## Installation and Usage
 
 ### npm
@@ -54,11 +49,12 @@ import {
 
 ### CDN
 
+Copy the line below into the head tag in an HTML document.
 ```html
-
 <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
 ```
 
+Copy the code below into the script tag of your HTML, and you're good to go with your development work.
 ```js
 const {Heap} = dataStructureTyped;
 const {
@@ -76,15 +72,8 @@ const {
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/directed-graph-test.webp)
 ![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/map-graph-test.webp)
 
-## API docs & Examples
-
-[API Docs](https://data-structure-typed-docs.vercel.app)
-
-[Live Examples](https://vivid-algorithm.vercel.app)
 
-<a href="https://github.com/zrwusa/vivid-algorithm" target="_blank">Examples Repository</a>
-
-## Code Snippet
+## Code Snippets
 
 ### Binary Search Tree (BST) snippet
 
@@ -99,27 +88,40 @@ bst.add(3);
 bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
 bst.size === 16;                // true
 bst.has(6);                     // true
-const node6 = bst.get(6);       // BSTNode
+const node6 = bst.getNode(6);   // BSTNode
 bst.getHeight(6) === 2;         // true
 bst.getHeight() === 5;          // true
 bst.getDepth(6) === 3;          // true
 
-bst.getLeftMost()?.id === 1;    // true
+bst.getLeftMost()?.key === 1;   // true
 
 bst.delete(6);
-bst.get(6);                     // null
+bst.get(6);                     // undefined
 bst.isAVLBalanced();            // true
 bst.bfs()[0] === 11;            // true
 
-const objBST = new BST<BSTNode<{id: number, keyA: number}>>();
-objBST.add(11, {id: 11, keyA: 11});
-objBST.add(3, {id: 3, keyA: 3});
-
-objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);
+const objBST = new BST<{height: number, age: number}>();
+
+objBST.add(11, { "name": "Pablo", "age": 15 });
+objBST.add(3, { "name": "Kirk", "age": 1 });
+
+objBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], [
+    { "name": "Alice", "age": 15 },
+    { "name": "Bob", "age": 1 },
+    { "name": "Charlie", "age": 8 },
+    { "name": "David", "age": 13 },
+    { "name": "Emma", "age": 16 },
+    { "name": "Frank", "age": 2 },
+    { "name": "Grace", "age": 6 },
+    { "name": "Hannah", "age": 9 },
+    { "name": "Isaac", "age": 12 },
+    { "name": "Jack", "age": 14 },
+    { "name": "Katie", "age": 4 },
+    { "name": "Liam", "age": 7 },
+    { "name": "Mia", "age": 10 },
+    { "name": "Noah", "age": 5 }
+  ]
+);
 
 objBST.delete(11);
 ```
@@ -133,39 +135,21 @@ const bst = new BST();
 bst.add(11);
 bst.add(3);
 bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
-bst.size === 16;        // true
-bst.has(6);             // true
-const node6 = bst.get(6);
-bst.getHeight(6) === 2; // true
-bst.getHeight() === 5;  // true
-bst.getDepth(6) === 3;  // true
+bst.size === 16;                // true
+bst.has(6);                     // true
+const node6 = bst.getNode(6);
+bst.getHeight(6) === 2;         // true
+bst.getHeight() === 5;          // true
+bst.getDepth(6) === 3;          // true
 const leftMost = bst.getLeftMost();
-leftMost?.id === 1;     // true
-expect(leftMost?.id).toBe(1);
+leftMost?.key === 1;            // true
+
 bst.delete(6);
-bst.get(6);             // null
-bst.isAVLBalanced();    // true or false
+bst.get(6);                     // undefined
+bst.isAVLBalanced();            // true or false
 const bfsIDs = bst.bfs();
-bfsIDs[0] === 11;       // true
-expect(bfsIDs[0]).toBe(11);
+bfsIDs[0] === 11;               // true
 
-const objBST = new BST();
-objBST.add(11, {id: 11, keyA: 11});
-objBST.add(3, {id: 3, keyA: 3});
-
-objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);
-
-objBST.delete(11);
-
-const avlTree = new AVLTree();
-avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-avlTree.isAVLBalanced();    // true
-avlTree.delete(10);
-avlTree.isAVLBalanced();    // true
 ```
 
 ### AVLTree snippet
@@ -222,7 +206,7 @@ graph.addVertex('C');
 graph.addEdge('A', 'B');
 graph.addEdge('B', 'C');
 
-const topologicalOrderIds = graph.topologicalSort(); // ['A', 'B', 'C']
+const topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']
 ```
 
 ### Undirected Graph snippet
@@ -242,9 +226,118 @@ graph.addEdge('A', 'B');
 graph.addEdge('B', 'D');
 
 const dijkstraResult = graph.dijkstra('A');
-Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D']
+Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', 'D']
 ```
 
+## Built-in classic algorithms
+
+<table>
+  <thead>
+  <tr>
+    <th>Algorithm</th>
+    <th>Function Description</th>
+    <th>Iteration Type</th>
+  </tr>
+  </thead>
+  <tbody>
+  <tr>
+    <td>Binary Tree DFS</td>
+    <td>Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree,
+      and then the right subtree, using recursion.
+    </td>
+    <td>Recursion + Iteration</td>
+  </tr>
+  <tr>
+    <td>Binary Tree BFS</td>
+    <td>Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level
+      from left to right.
+    </td>
+    <td>Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph DFS</td>
+    <td>Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as
+      possible, and backtracking to explore other paths. Used for finding connected components, paths, etc.
+    </td>
+    <td>Recursion + Iteration</td>
+  </tr>
+  <tr>
+    <td>Binary Tree Morris</td>
+    <td>Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree
+      traversal without additional stack or recursion.
+    </td>
+    <td>Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph BFS</td>
+    <td>Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected
+      to the starting node, and then expanding level by level. Used for finding shortest paths, etc.
+    </td>
+    <td>Recursion + Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph Tarjan's Algorithm</td>
+    <td>Find strongly connected components in a graph, typically implemented using depth-first search.</td>
+    <td>Recursion</td>
+  </tr>
+  <tr>
+    <td>Graph Bellman-Ford Algorithm</td>
+    <td>Finding the shortest paths from a single source, can handle negative weight edges</td>
+    <td>Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph Dijkstra's Algorithm</td>
+    <td>Finding the shortest paths from a single source, cannot handle negative weight edges</td>
+    <td>Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph Floyd-Warshall Algorithm</td>
+    <td>Finding the shortest paths between all pairs of nodes</td>
+    <td>Iteration</td>
+  </tr>
+  <tr>
+    <td>Graph getCycles</td>
+    <td>Find all cycles in a graph or detect the presence of cycles.</td>
+    <td>Recursion</td>
+  </tr>
+  <tr>
+    <td>Graph getCutVertexes</td>
+    <td>Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in
+      the graph.
+    </td>
+    <td>Recursion</td>
+  </tr>
+  <tr>
+    <td>Graph getSCCs</td>
+    <td>Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.
+    </td>
+    <td>Recursion</td>
+  </tr>
+  <tr>
+    <td>Graph getBridges</td>
+    <td>Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the
+      graph.
+    </td>
+    <td>Recursion</td>
+  </tr>
+  <tr>
+    <td>Graph topologicalSort</td>
+    <td>Perform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all
+      directed edges go from earlier nodes to later nodes.
+    </td>
+    <td>Recursion</td>
+  </tr>
+  </tbody>
+</table>
+
+## API docs & Examples
+
+[API Docs](https://data-structure-typed-docs.vercel.app)
+
+[Live Examples](https://vivid-algorithm.vercel.app)
+
+<a href="https://github.com/zrwusa/vivid-algorithm" target="_blank">Examples Repository</a>
+
 ## Data Structures
 
 <table>
@@ -283,7 +376,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
 <td>Red Black Tree</td>
 <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
 <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
-<td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html"><span>AVLTree</span></a></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html"><span>RedBlackTree</span></a></td>
 <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
 </tr>
 <tr>
@@ -444,12 +537,6 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
   </tr>
   </thead>
   <tbody>
-  <tr>
-    <td>Array&lt;E&gt;</td>
-    <td>vector&lt;T&gt;</td>
-    <td>ArrayList&lt;E&gt;</td>
-    <td>list</td>
-  </tr>
   <tr>
     <td>DoublyLinkedList&lt;E&gt;</td>
     <td>list&lt;T&gt;</td>
@@ -463,30 +550,23 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Set&lt;E&gt;</td>
-    <td>set&lt;T&gt;</td>
-    <td>HashSet&lt;E&gt;</td>
-    <td>set</td>
-  </tr>
-  <tr>
-    <td>Map&lt;K, V&gt;</td>
-    <td>map&lt;K, V&gt;</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>dict</td>
-  </tr>
-  <tr>
-    <td>Map&lt;K, V&gt;</td>
-    <td>-</td>
-    <td>-</td>
-    <td>OrderedDict</td>
+    <td>Array&lt;E&gt;</td>
+    <td>vector&lt;T&gt;</td>
+    <td>ArrayList&lt;E&gt;</td>
+    <td>list</td>
   </tr>
-
   <tr>
     <td>Queue&lt;E&gt;</td>
     <td>queue&lt;T&gt;</td>
     <td>Queue&lt;E&gt;</td>
     <td>-</td>
   </tr>
+  <tr>
+    <td>Deque&lt;E&gt;</td>
+    <td>deque&lt;T&gt;</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
   <tr>
     <td>PriorityQueue&lt;E&gt;</td>
     <td>priority_queue&lt;T&gt;</td>
@@ -494,7 +574,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Heap&lt;V&gt;</td>
+    <td>Heap&lt;E&gt;</td>
     <td>priority_queue&lt;T&gt;</td>
     <td>PriorityQueue&lt;E&gt;</td>
     <td>heapq</td>
@@ -506,15 +586,21 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Deque&lt;E&gt;</td>
-    <td>deque&lt;T&gt;</td>
-    <td>-</td>
-    <td>-</td>
+    <td>Set&lt;E&gt;</td>
+    <td>set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
+    <td>set</td>
+  </tr>
+  <tr>
+    <td>Map&lt;K, V&gt;</td>
+    <td>map&lt;K, V&gt;</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>dict</td>
   </tr>
   <tr>
-    <td>Trie</td>
-    <td>-</td>
     <td>-</td>
+    <td>unordered_set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
@@ -524,93 +610,99 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>defaultdict</td>
   </tr>
   <tr>
-    <td>-</td>
-    <td>multiset&lt;T&gt;</td>
+    <td>Map&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
+    <td>OrderedDict</td>
   </tr>
   <tr>
+    <td>BinaryTree&lt;K, V&gt;</td>
     <td>-</td>
-    <td>multimap&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>BinaryTree&lt;K, V&gt;</td>
+    <td>BST&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>BST&lt;K, V&gt;</td>
-    <td>-</td>
+    <td>TreeMultimap&lt;K, V&gt;</td>
+    <td>multimap&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>DirectedGraph&lt;V, E&gt;</td>
-    <td>-</td>
+    <td>AVLTree&lt;E&gt;</td>
     <td>-</td>
+    <td>TreeSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>UndirectedGraph&lt;V, E&gt;</td>
+    <td>AVLTree&lt;K, V&gt;</td>
     <td>-</td>
+    <td>TreeMap&lt;K, V&gt;</td>
     <td>-</td>
+  </tr>
+  <tr>
+    <td>AVLTree&lt;E&gt;</td>
+    <td>set</td>
+    <td>TreeSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
+    <td>Trie</td>
+    <td>-</td>
     <td>-</td>
-    <td>unordered_multiset</td>
     <td>-</td>
-    <td>Counter</td>
   </tr>
   <tr>
     <td>-</td>
+    <td>multiset&lt;T&gt;</td>
     <td>-</td>
-    <td>LinkedHashSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
+    <td>DirectedGraph&lt;V, E&gt;</td>
     <td>-</td>
     <td>-</td>
-    <td>LinkedHashMap&lt;K, V&gt;</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>AVLTree&lt;E&gt;</td>
+    <td>UndirectedGraph&lt;V, E&gt;</td>
+    <td>-</td>
     <td>-</td>
-    <td>TreeSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>AVLTree&lt;K, V&gt;</td>
     <td>-</td>
-    <td>TreeMap&lt;K, V&gt;</td>
+    <td>unordered_multiset</td>
     <td>-</td>
+    <td>Counter</td>
   </tr>
   <tr>
-    <td>AVLTree&lt;E&gt;</td>
-    <td>set</td>
-    <td>TreeSet&lt;E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>LinkedHashSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   <tr>
     <td>-</td>
-    <td>unordered_multimap&lt;K, V&gt;</td>
     <td>-</td>
+    <td>LinkedHashMap&lt;K, V&gt;</td>
     <td>-</td>
   </tr>
   <tr>
     <td>-</td>
-    <td>bitset&lt;N&gt;</td>
+    <td>unordered_multimap&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
     <td>-</td>
-    <td>unordered_set&lt;T&gt;</td>
-    <td>HashSet&lt;E&gt;</td>
+    <td>bitset&lt;N&gt;</td>
+    <td>-</td>
     <td>-</td>
   </tr>
   </tbody>
@@ -633,43 +725,43 @@ optimal approach to data structure design.
 
 ## Benchmark
 
-[//]: # (Start of Replace Section)
+[//]: # (No deletion!!! Start of Replace Section)
 <div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>avl-tree</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add randomly</td><td>30.52</td><td>32.76</td><td>3.28e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>66.96</td><td>14.94</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>39.78</td><td>25.14</td><td>3.67e-4</td></tr><tr><td>10,000 get</td><td>27.38</td><td>36.52</td><td>0.00</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add randomly</td><td>45.48</td><td>21.99</td><td>0.04</td></tr><tr><td>10,000 add & delete randomly</td><td>132.35</td><td>7.56</td><td>0.10</td></tr><tr><td>10,000 addMany</td><td>79.22</td><td>12.62</td><td>0.07</td></tr><tr><td>10,000 get</td><td>93.13</td><td>10.74</td><td>0.06</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>binary-tree</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000 add randomly</td><td>10.50</td><td>95.20</td><td>2.30e-4</td></tr><tr><td>1,000 add & delete randomly</td><td>16.18</td><td>61.81</td><td>2.48e-4</td></tr><tr><td>1,000 addMany</td><td>10.80</td><td>92.62</td><td>1.83e-4</td></tr><tr><td>1,000 get</td><td>18.03</td><td>55.45</td><td>1.41e-4</td></tr><tr><td>1,000 dfs</td><td>157.86</td><td>6.33</td><td>0.00</td></tr><tr><td>1,000 bfs</td><td>56.68</td><td>17.64</td><td>0.00</td></tr><tr><td>1,000 morris</td><td>37.21</td><td>26.88</td><td>2.79e-4</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000 add randomly</td><td>23.89</td><td>41.85</td><td>0.01</td></tr><tr><td>1,000 add & delete randomly</td><td>22.84</td><td>43.78</td><td>0.01</td></tr><tr><td>1,000 addMany</td><td>10.61</td><td>94.22</td><td>4.91e-4</td></tr><tr><td>1,000 get</td><td>18.56</td><td>53.87</td><td>8.86e-4</td></tr><tr><td>1,000 dfs</td><td>158.90</td><td>6.29</td><td>0.00</td></tr><tr><td>1,000 bfs</td><td>58.59</td><td>17.07</td><td>0.00</td></tr><tr><td>1,000 morris</td><td>269.91</td><td>3.70</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>bst</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add randomly</td><td>27.61</td><td>36.21</td><td>4.73e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>62.93</td><td>15.89</td><td>5.86e-4</td></tr><tr><td>10,000 addMany</td><td>28.70</td><td>34.84</td><td>0.00</td></tr><tr><td>10,000 get</td><td>27.67</td><td>36.14</td><td>2.92e-4</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add randomly</td><td>31.66</td><td>31.59</td><td>8.90e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>73.97</td><td>13.52</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>31.66</td><td>31.58</td><td>0.00</td></tr><tr><td>10,000 get</td><td>29.75</td><td>33.61</td><td>5.49e-4</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>rb-tree</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>100,000 add randomly</td><td>87.51</td><td>11.43</td><td>0.01</td></tr><tr><td>100,000 add & delete randomly</td><td>189.06</td><td>5.29</td><td>0.01</td></tr><tr><td>100,000 getNode</td><td>35.33</td><td>28.31</td><td>8.93e-4</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>100,000 add randomly</td><td>87.24</td><td>11.46</td><td>0.00</td></tr><tr><td>100,000 add & delete randomly</td><td>218.78</td><td>4.57</td><td>0.01</td></tr><tr><td>100,000 getNode</td><td>91.39</td><td>10.94</td><td>0.00</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>directed-graph</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000 addVertex</td><td>0.10</td><td>9899.91</td><td>8.58e-7</td></tr><tr><td>1,000 addEdge</td><td>6.06</td><td>165.02</td><td>1.68e-4</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.17e+4</td><td>4.22e-7</td></tr><tr><td>1,000 getEdge</td><td>23.05</td><td>43.38</td><td>0.00</td></tr><tr><td>tarjan</td><td>222.59</td><td>4.49</td><td>0.01</td></tr><tr><td>tarjan all</td><td>226.89</td><td>4.41</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>187.34</td><td>5.34</td><td>0.01</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000 addVertex</td><td>0.10</td><td>9631.84</td><td>5.21e-6</td></tr><tr><td>1,000 addEdge</td><td>6.25</td><td>160.06</td><td>3.97e-4</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.13e+4</td><td>1.05e-6</td></tr><tr><td>1,000 getEdge</td><td>23.83</td><td>41.97</td><td>0.00</td></tr><tr><td>tarjan</td><td>217.69</td><td>4.59</td><td>0.01</td></tr><tr><td>tarjan all</td><td>226.43</td><td>4.42</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>180.71</td><td>5.53</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>heap</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add & pop</td><td>4.66</td><td>214.54</td><td>9.38e-5</td></tr><tr><td>10,000 fib add & pop</td><td>364.30</td><td>2.74</td><td>0.01</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 add & pop</td><td>4.69</td><td>213.13</td><td>1.63e-4</td></tr><tr><td>10,000 fib add & pop</td><td>367.49</td><td>2.72</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>doubly-linked-list</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 unshift</td><td>243.61</td><td>4.10</td><td>0.07</td></tr><tr><td>1,000,000 unshift & shift</td><td>173.32</td><td>5.77</td><td>0.03</td></tr><tr><td>1,000,000 insertBefore</td><td>315.86</td><td>3.17</td><td>0.04</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 unshift</td><td>221.10</td><td>4.52</td><td>0.06</td></tr><tr><td>1,000,000 unshift & shift</td><td>179.99</td><td>5.56</td><td>0.03</td></tr><tr><td>1,000,000 insertBefore</td><td>331.29</td><td>3.02</td><td>0.06</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>singly-linked-list</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 push & pop</td><td>228.06</td><td>4.38</td><td>0.03</td></tr><tr><td>10,000 insertBefore</td><td>252.07</td><td>3.97</td><td>0.01</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 push & pop</td><td>216.59</td><td>4.62</td><td>0.01</td></tr><tr><td>10,000 insertBefore</td><td>255.08</td><td>3.92</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>max-priority-queue</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 refill & poll</td><td>11.53</td><td>86.71</td><td>2.27e-4</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>10,000 refill & poll</td><td>12.00</td><td>83.34</td><td>6.62e-4</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>deque</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 push</td><td>227.24</td><td>4.40</td><td>0.07</td></tr><tr><td>1,000,000 shift</td><td>25.60</td><td>39.07</td><td>0.00</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 push</td><td>222.01</td><td>4.50</td><td>0.05</td></tr><tr><td>1,000,000 shift</td><td>25.35</td><td>39.45</td><td>0.00</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>queue</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 push</td><td>45.98</td><td>21.75</td><td>0.01</td></tr><tr><td>1,000,000 push & shift</td><td>81.12</td><td>12.33</td><td>0.00</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>1,000,000 push</td><td>45.31</td><td>22.07</td><td>0.01</td></tr><tr><td>1,000,000 push & shift</td><td>83.92</td><td>11.92</td><td>0.01</td></tr></table></div>
     </div><div class="json-to-html-collapse clearfix 0">
       <div class='collapsible level0' ><span class='json-to-html-label'>trie</span></div>
-      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>100,000 push</td><td>59.40</td><td>16.83</td><td>0.01</td></tr><tr><td>100,000 getWords</td><td>90.07</td><td>11.10</td><td>0.00</td></tr></table></div>
+      <div class="content"><table style="display: table; width:100%; table-layout: fixed;"><tr><th>test name</th><th>time taken (ms)</th><th>executions per sec</th><th>sample deviation</th></tr><tr><td>100,000 push</td><td>59.08</td><td>16.92</td><td>0.01</td></tr><tr><td>100,000 getWords</td><td>95.74</td><td>10.44</td><td>0.01</td></tr></table></div>
     </div>
 
-[//]: # (End of Replace Section)
+[//]: # (No deletion!!! End of Replace Section)