data-structure-typed 1.21.2 → 1.21.3

package/README.md

@@ -3,8 +3,7 @@
 ## Brief
 Javascript & TypeScript Data Structure collections. 
 
-## Algorithms 
-
+## Algorithms
 DFS, DFSIterative, BFS, morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Floyd-Warshall Algorithm, Tarjan's Algorithm. Listed only a few out, you can discover more in API docs
 
 ## Code design
@@ -20,13 +19,13 @@ npm install data-structure-typed
 ```bash
 yarn add data-structure-typed
 ```
-### cdn
+### CDN
 ```html
 <script src="https://cdn.jsdelivr.net/npm/data-structure-typed/dist/bundle.js"></script>
 ```
 ```javascript
-const {AVLTree, AVLTreeNode, BST, Trie, DirectedGraph, DirectedVertex, TreeMultiset} = dataStructureTyped;
-const {MinHeap, SinglyLinkedList, DirectedVertex, Stack} = dataStructureTyped;
+const {AVLTree} = dataStructureTyped;
+const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedGraph, DirectedVertex, TreeMultiset} = dataStructureTyped;
 ```
 
 ![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/dfs-pre-order.webp?raw=true)
@@ -74,7 +73,7 @@ const {MinHeap, SinglyLinkedList, DirectedVertex, Stack} = dataStructureTyped;
     bst.get(6);             // null
     bst.isAVLBalanced();    // true or false
     const bfsIDs = bst.BFS();
-    bfsIDs[0] === 11;   // true
+    bfsIDs[0] === 11;       // true
     expect(bfsIDs[0]).toBe(11);
     
     const objBST = new BST<BSTNode<{ id: number, keyA: number }>>();
@@ -118,7 +117,7 @@ const {MinHeap, SinglyLinkedList, DirectedVertex, Stack} = dataStructureTyped;
     bst.get(6);             // null
     bst.isAVLBalanced();    // true or false
     const bfsIDs = bst.BFS();
-    bfsIDs[0] === 11;   // true
+    bfsIDs[0] === 11;       // true
     expect(bfsIDs[0]).toBe(11);
     
     const objBST = new BST();
@@ -158,8 +157,8 @@ import {DirectedGraph} from 'data-structure-typed';
     graph.hasVertex('C');       // false
     
     graph.addEdge('A', 'B');
-    graph.hasEdge('A', 'B'); // true
-    graph.hasEdge('B', 'A'); // false
+    graph.hasEdge('A', 'B');    // true
+    graph.hasEdge('B', 'A');    // false
     
     graph.removeEdgeSrcToDest('A', 'B');
     graph.hasEdge('A', 'B');    // false
@@ -204,10 +203,8 @@ import {UndirectedGraph} from 'data-structure-typed';
 <tbody>
 <tr>
 <td>Binary Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt="">
-</img></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt="">
-</img></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/BinaryTree.html"><span>Binary Tree</span></a></td>
 <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
 </tr>