graph-typed 1.51.2 → 1.51.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (15) hide show
  1. package/README.md +1 -325
  2. package/dist/data-structures/binary-tree/binary-tree.js +2 -2
  3. package/dist/data-structures/binary-tree/bst.js +1 -1
  4. package/dist/data-structures/index.d.ts +1 -1
  5. package/dist/data-structures/index.js +1 -1
  6. package/dist/utils/index.d.ts +1 -0
  7. package/dist/utils/index.js +1 -0
  8. package/dist/utils/number.d.ts +1 -0
  9. package/dist/utils/number.js +11 -0
  10. package/package.json +2 -2
  11. package/src/data-structures/binary-tree/binary-tree.ts +2 -2
  12. package/src/data-structures/binary-tree/bst.ts +1 -1
  13. package/src/data-structures/index.ts +1 -1
  14. package/src/utils/index.ts +1 -0
  15. package/src/utils/number.ts +9 -0
package/README.md CHANGED
@@ -2,7 +2,7 @@
2
2
  ![GitHub top language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed)
3
3
  ![npm](https://img.shields.io/npm/dw/graph-typed)
4
4
  ![eslint](https://aleen42.github.io/badges/src/eslint.svg)
5
- ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/graph-typed)
5
+ ![npm bundle size](https://img.shields.io/bundlephobia/minzip/graph-typed)
6
6
  ![npm bundle size](https://img.shields.io/bundlephobia/min/graph-typed)
7
7
  ![npm](https://img.shields.io/npm/v/graph-typed)
8
8
 
@@ -205,78 +205,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
205
205
  </thead>
206
206
  <tbody>
207
207
  <tr>
208
- <td>Binary Tree</td>
209
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
210
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
211
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html"><span>Binary Tree</span></a></td>
212
- </tr>
213
- <tr>
214
- <td>Binary Search Tree (BST)</td>
215
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
216
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
217
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html"><span>BST</span></a></td>
218
- </tr>
219
- <tr>
220
- <td>AVL Tree</td>
221
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
222
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
223
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html"><span>AVLTree</span></a></td>
224
- </tr>
225
- <tr>
226
- <td>Red Black Tree</td>
227
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
228
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
229
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/RedBlackTree.html"><span>RedBlackTree</span></a></td>
230
- </tr>
231
- <tr>
232
- <td>Tree Multiset</td>
233
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
234
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
235
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultimap.html"><span>TreeMultimap</span></a></td>
236
- </tr>
237
- <tr>
238
- <td>Segment Tree</td>
239
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
240
- <td></td>
241
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html"><span>SegmentTree</span></a></td>
242
- </tr>
243
- <tr>
244
- <td>Binary Indexed Tree</td>
245
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
246
- <td></td>
247
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html"><span>BinaryIndexedTree</span></a></td>
248
- </tr>
249
- <tr>
250
- <td>Heap</td>
251
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
252
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
253
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html"><span>Heap</span></a></td>
254
- </tr>
255
- <tr>
256
- <td>Priority Queue</td>
257
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
258
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
259
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html"><span>PriorityQueue</span></a></td>
260
- </tr>
261
- <tr>
262
- <td>Max Priority Queue</td>
263
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
264
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
265
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html"><span>MaxPriorityQueue</span></a></td>
266
- </tr>
267
- <tr>
268
- <td>Min Priority Queue</td>
269
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
270
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
271
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html"><span>MinPriorityQueue</span></a></td>
272
- </tr>
273
- <tr>
274
- <td>Trie</td>
275
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
276
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
277
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html"><span>Trie</span></a></td>
278
- </tr>
279
- <tr>
280
208
  <td>Graph</td>
281
209
  <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
282
210
  <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
@@ -294,42 +222,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
294
222
  <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
295
223
  <td><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html"><span>UndirectedGraph</span></a></td>
296
224
  </tr>
297
- <tr>
298
- <td>Queue</td>
299
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
300
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
301
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html"><span>Queue</span></a></td>
302
- </tr>
303
- <tr>
304
- <td>Deque</td>
305
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
306
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
307
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html"><span>Deque</span></a></td>
308
- </tr>
309
- <tr>
310
- <td>Linked List</td>
311
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
312
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
313
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html"><span>SinglyLinkedList</span></a></td>
314
- </tr>
315
- <tr>
316
- <td>Singly Linked List</td>
317
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
318
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
319
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html"><span>SinglyLinkedList</span></a></td>
320
- </tr>
321
- <tr>
322
- <td>Doubly Linked List</td>
323
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
324
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
325
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html"><span>DoublyLinkedList</span></a></td>
326
- </tr>
327
- <tr>
328
- <td>Stack</td>
329
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
330
- <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
331
- <td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html"><span>Stack</span></a></td>
332
- </tr>
333
225
  </tbody>
334
226
  </table>
335
227
 
@@ -345,84 +237,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
345
237
  </tr>
346
238
  </thead>
347
239
  <tbody>
348
- <tr>
349
- <td>Heap&lt;E&gt;</td>
350
- <td>priority_queue&lt;T&gt;</td>
351
- <td>PriorityQueue&lt;E&gt;</td>
352
- <td>heapq</td>
353
- </tr>
354
- <tr>
355
- <td>Deque&lt;E&gt;</td>
356
- <td>deque&lt;T&gt;</td>
357
- <td>ArrayDeque&lt;E&gt;</td>
358
- <td>deque</td>
359
- </tr>
360
- <tr>
361
- <td>Queue&lt;E&gt;</td>
362
- <td>queue&lt;T&gt;</td>
363
- <td>Queue&lt;E&gt;</td>
364
- <td>-</td>
365
- </tr>
366
- <tr>
367
- <td>HashMap&lt;K, V&gt;</td>
368
- <td>unordered_map&lt;K, V&gt;</td>
369
- <td>HashMap&lt;K, V&gt;</td>
370
- <td>defaultdict</td>
371
- </tr>
372
- <tr>
373
- <td>DoublyLinkedList&lt;E&gt;</td>
374
- <td>list&lt;T&gt;</td>
375
- <td>LinkedList&lt;E&gt;</td>
376
- <td>-</td>
377
- </tr>
378
- <tr>
379
- <td>SinglyLinkedList&lt;E&gt;</td>
380
- <td>-</td>
381
- <td>-</td>
382
- <td>-</td>
383
- </tr>
384
- <tr>
385
- <td>BinaryTree&lt;K, V&gt;</td>
386
- <td>-</td>
387
- <td>-</td>
388
- <td>-</td>
389
- </tr>
390
- <tr>
391
- <td>BST&lt;K, V&gt;</td>
392
- <td>-</td>
393
- <td>-</td>
394
- <td>-</td>
395
- </tr>
396
- <tr>
397
- <td>RedBlackTree&lt;E&gt;</td>
398
- <td>set&lt;T&gt;</td>
399
- <td>TreeSet&lt;E&gt;</td>
400
- <td>-</td>
401
- </tr>
402
- <tr>
403
- <td>RedBlackTree&lt;K, V&gt;</td>
404
- <td>map&lt;K, V&gt;</td>
405
- <td>TreeMap&lt;K, V&gt;</td>
406
- <td>-</td>
407
- </tr>
408
- <tr>
409
- <td>TreeMultimap&lt;K, V&gt;</td>
410
- <td>multimap&lt;K, V&gt;</td>
411
- <td>-</td>
412
- <td>-</td>
413
- </tr>
414
- <tr>
415
- <td>-</td>
416
- <td>multiset&lt;T&gt;</td>
417
- <td>-</td>
418
- <td>-</td>
419
- </tr>
420
- <tr>
421
- <td>Trie</td>
422
- <td>-</td>
423
- <td>-</td>
424
- <td>-</td>
425
- </tr>
426
240
  <tr>
427
241
  <td>DirectedGraph&lt;V, E&gt;</td>
428
242
  <td>-</td>
@@ -435,78 +249,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
435
249
  <td>-</td>
436
250
  <td>-</td>
437
251
  </tr>
438
- <tr>
439
- <td>PriorityQueue&lt;E&gt;</td>
440
- <td>priority_queue&lt;T&gt;</td>
441
- <td>PriorityQueue&lt;E&gt;</td>
442
- <td>-</td>
443
- </tr>
444
- <tr>
445
- <td>Array&lt;E&gt;</td>
446
- <td>vector&lt;T&gt;</td>
447
- <td>ArrayList&lt;E&gt;</td>
448
- <td>list</td>
449
- </tr>
450
- <tr>
451
- <td>Stack&lt;E&gt;</td>
452
- <td>stack&lt;T&gt;</td>
453
- <td>Stack&lt;E&gt;</td>
454
- <td>-</td>
455
- </tr>
456
- <tr>
457
- <td>Set&lt;E&gt;</td>
458
- <td>-</td>
459
- <td>HashSet&lt;E&gt;</td>
460
- <td>set</td>
461
- </tr>
462
- <tr>
463
- <td>Map&lt;K, V&gt;</td>
464
- <td>-</td>
465
- <td>HashMap&lt;K, V&gt;</td>
466
- <td>dict</td>
467
- </tr>
468
- <tr>
469
- <td>-</td>
470
- <td>unordered_set&lt;T&gt;</td>
471
- <td>HashSet&lt;E&gt;</td>
472
- <td>-</td>
473
- </tr>
474
- <tr>
475
- <td>Map&lt;K, V&gt;</td>
476
- <td>-</td>
477
- <td>-</td>
478
- <td>OrderedDict</td>
479
- </tr>
480
- <tr>
481
- <td>-</td>
482
- <td>unordered_multiset</td>
483
- <td>-</td>
484
- <td>Counter</td>
485
- </tr>
486
- <tr>
487
- <td>-</td>
488
- <td>-</td>
489
- <td>LinkedHashSet&lt;E&gt;</td>
490
- <td>-</td>
491
- </tr>
492
- <tr>
493
- <td>HashMap&lt;K, V&gt;</td>
494
- <td>-</td>
495
- <td>LinkedHashMap&lt;K, V&gt;</td>
496
- <td>-</td>
497
- </tr>
498
- <tr>
499
- <td>-</td>
500
- <td>unordered_multimap&lt;K, V&gt;</td>
501
- <td>-</td>
502
- <td>-</td>
503
- </tr>
504
- <tr>
505
- <td>-</td>
506
- <td>bitset&lt;N&gt;</td>
507
- <td>-</td>
508
- <td>-</td>
509
- </tr>
510
252
  </tbody>
511
253
  </table>
512
254
 
@@ -514,53 +256,8 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
514
256
 
515
257
  [//]: # (No deletion!!! Start of Replace Section)
516
258
  <div class="json-to-html-collapse clearfix 0">
517
- <div class='collapsible level0' ><span class='json-to-html-label'>avl-tree</span></div>
518
- <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.32</td><td>31.93</td><td>3.67e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>70.90</td><td>14.10</td><td>0.00</td></tr><tr><td>10,000 addMany</td><td>40.58</td><td>24.64</td><td>4.87e-4</td></tr><tr><td>10,000 get</td><td>27.31</td><td>36.62</td><td>2.00e-4</td></tr></table></div>
519
- </div><div class="json-to-html-collapse clearfix 0">
520
- <div class='collapsible level0' ><span class='json-to-html-label'>binary-tree</span></div>
521
- <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>12.35</td><td>80.99</td><td>7.17e-5</td></tr><tr><td>1,000 add & delete randomly</td><td>15.98</td><td>62.58</td><td>7.98e-4</td></tr><tr><td>1,000 addMany</td><td>10.96</td><td>91.27</td><td>0.00</td></tr><tr><td>1,000 get</td><td>18.61</td><td>53.73</td><td>0.00</td></tr><tr><td>1,000 dfs</td><td>164.20</td><td>6.09</td><td>0.04</td></tr><tr><td>1,000 bfs</td><td>58.84</td><td>17.00</td><td>0.01</td></tr><tr><td>1,000 morris</td><td>256.66</td><td>3.90</td><td>7.70e-4</td></tr></table></div>
522
- </div><div class="json-to-html-collapse clearfix 0">
523
- <div class='collapsible level0' ><span class='json-to-html-label'>bst</span></div>
524
- <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.59</td><td>31.66</td><td>2.74e-4</td></tr><tr><td>10,000 add & delete randomly</td><td>74.56</td><td>13.41</td><td>8.32e-4</td></tr><tr><td>10,000 addMany</td><td>29.16</td><td>34.30</td><td>0.00</td></tr><tr><td>10,000 get</td><td>29.24</td><td>34.21</td><td>0.00</td></tr></table></div>
525
- </div><div class="json-to-html-collapse clearfix 0">
526
- <div class='collapsible level0' ><span class='json-to-html-label'>rb-tree</span></div>
527
- <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</td><td>85.85</td><td>11.65</td><td>0.00</td></tr><tr><td>100,000 add & delete randomly</td><td>211.54</td><td>4.73</td><td>0.00</td></tr><tr><td>100,000 getNode</td><td>37.92</td><td>26.37</td><td>1.65e-4</td></tr></table></div>
528
- </div><div class="json-to-html-collapse clearfix 0">
529
- <div class='collapsible level0' ><span class='json-to-html-label'>comparison</span></div>
530
- <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>SRC PQ 10,000 add</td><td>0.57</td><td>1748.73</td><td>4.96e-6</td></tr><tr><td>CJS PQ 10,000 add</td><td>0.57</td><td>1746.69</td><td>4.91e-6</td></tr><tr><td>MJS PQ 10,000 add</td><td>0.57</td><td>1749.68</td><td>4.43e-6</td></tr><tr><td>SRC PQ 10,000 add & pop</td><td>3.47</td><td>288.14</td><td>6.38e-4</td></tr><tr><td>CJS PQ 10,000 add & pop</td><td>3.39</td><td>295.36</td><td>3.90e-5</td></tr><tr><td>MJS PQ 10,000 add & pop</td><td>3.37</td><td>297.17</td><td>3.03e-5</td></tr></table></div>
531
- </div><div class="json-to-html-collapse clearfix 0">
532
259
  <div class='collapsible level0' ><span class='json-to-html-label'>directed-graph</span></div>
533
260
  <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>9534.93</td><td>8.72e-7</td></tr><tr><td>1,000 addEdge</td><td>6.30</td><td>158.67</td><td>0.00</td></tr><tr><td>1,000 getVertex</td><td>0.05</td><td>2.16e+4</td><td>3.03e-7</td></tr><tr><td>1,000 getEdge</td><td>22.31</td><td>44.82</td><td>0.00</td></tr><tr><td>tarjan</td><td>210.90</td><td>4.74</td><td>0.01</td></tr><tr><td>tarjan all</td><td>214.72</td><td>4.66</td><td>0.01</td></tr><tr><td>topologicalSort</td><td>172.52</td><td>5.80</td><td>0.00</td></tr></table></div>
534
- </div><div class="json-to-html-collapse clearfix 0">
535
- <div class='collapsible level0' ><span class='json-to-html-label'>hash-map</span></div>
536
- <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 set</td><td>275.88</td><td>3.62</td><td>0.12</td></tr><tr><td>1,000,000 Map set</td><td>211.66</td><td>4.72</td><td>0.01</td></tr><tr><td>1,000,000 Set add</td><td>177.72</td><td>5.63</td><td>0.02</td></tr><tr><td>1,000,000 set & get</td><td>317.60</td><td>3.15</td><td>0.02</td></tr><tr><td>1,000,000 Map set & get</td><td>274.99</td><td>3.64</td><td>0.03</td></tr><tr><td>1,000,000 Set add & has</td><td>172.23</td><td>5.81</td><td>0.02</td></tr><tr><td>1,000,000 ObjKey set & get</td><td>929.40</td><td>1.08</td><td>0.07</td></tr><tr><td>1,000,000 Map ObjKey set & get</td><td>310.02</td><td>3.23</td><td>0.05</td></tr><tr><td>1,000,000 Set ObjKey add & has</td><td>283.28</td><td>3.53</td><td>0.04</td></tr></table></div>
537
- </div><div class="json-to-html-collapse clearfix 0">
538
- <div class='collapsible level0' ><span class='json-to-html-label'>heap</span></div>
539
- <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>5.80</td><td>172.35</td><td>8.78e-5</td></tr><tr><td>10,000 fib add & pop</td><td>357.92</td><td>2.79</td><td>0.00</td></tr></table></div>
540
- </div><div class="json-to-html-collapse clearfix 0">
541
- <div class='collapsible level0' ><span class='json-to-html-label'>doubly-linked-list</span></div>
542
- <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>221.57</td><td>4.51</td><td>0.03</td></tr><tr><td>1,000,000 unshift</td><td>229.02</td><td>4.37</td><td>0.07</td></tr><tr><td>1,000,000 unshift & shift</td><td>169.21</td><td>5.91</td><td>0.02</td></tr><tr><td>1,000,000 insertBefore</td><td>314.48</td><td>3.18</td><td>0.07</td></tr></table></div>
543
- </div><div class="json-to-html-collapse clearfix 0">
544
- <div class='collapsible level0' ><span class='json-to-html-label'>singly-linked-list</span></div>
545
- <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>212.98</td><td>4.70</td><td>0.01</td></tr><tr><td>10,000 insertBefore</td><td>250.68</td><td>3.99</td><td>0.01</td></tr></table></div>
546
- </div><div class="json-to-html-collapse clearfix 0">
547
- <div class='collapsible level0' ><span class='json-to-html-label'>max-priority-queue</span></div>
548
- <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>8.91</td><td>112.29</td><td>2.26e-4</td></tr></table></div>
549
- </div><div class="json-to-html-collapse clearfix 0">
550
- <div class='collapsible level0' ><span class='json-to-html-label'>priority-queue</span></div>
551
- <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 & pop</td><td>103.59</td><td>9.65</td><td>0.00</td></tr></table></div>
552
- </div><div class="json-to-html-collapse clearfix 0">
553
- <div class='collapsible level0' ><span class='json-to-html-label'>deque</span></div>
554
- <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>14.55</td><td>68.72</td><td>6.91e-4</td></tr><tr><td>1,000,000 push & pop</td><td>23.40</td><td>42.73</td><td>5.94e-4</td></tr><tr><td>1,000,000 push & shift</td><td>24.41</td><td>40.97</td><td>1.45e-4</td></tr><tr><td>1,000,000 unshift & shift</td><td>22.56</td><td>44.32</td><td>1.30e-4</td></tr></table></div>
555
- </div><div class="json-to-html-collapse clearfix 0">
556
- <div class='collapsible level0' ><span class='json-to-html-label'>queue</span></div>
557
- <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>39.90</td><td>25.07</td><td>0.01</td></tr><tr><td>1,000,000 push & shift</td><td>81.79</td><td>12.23</td><td>0.00</td></tr></table></div>
558
- </div><div class="json-to-html-collapse clearfix 0">
559
- <div class='collapsible level0' ><span class='json-to-html-label'>stack</span></div>
560
- <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>37.60</td><td>26.60</td><td>0.00</td></tr><tr><td>1,000,000 push & pop</td><td>47.01</td><td>21.27</td><td>0.00</td></tr></table></div>
561
- </div><div class="json-to-html-collapse clearfix 0">
562
- <div class='collapsible level0' ><span class='json-to-html-label'>trie</span></div>
563
- <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>45.97</td><td>21.76</td><td>0.00</td></tr><tr><td>100,000 getWords</td><td>66.20</td><td>15.11</td><td>0.00</td></tr></table></div>
564
261
  </div>
565
262
 
566
263
  [//]: # (No deletion!!! End of Replace Section)
@@ -576,20 +273,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
576
273
  </tr>
577
274
  </thead>
578
275
  <tbody>
579
- <tr>
580
- <td>Binary Tree DFS</td>
581
- <td>Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree,
582
- and then the right subtree, using recursion.
583
- </td>
584
- <td>Recursion + Iteration</td>
585
- </tr>
586
- <tr>
587
- <td>Binary Tree BFS</td>
588
- <td>Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level
589
- from left to right.
590
- </td>
591
- <td>Iteration</td>
592
- </tr>
593
276
  <tr>
594
277
  <td>Graph DFS</td>
595
278
  <td>Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as
@@ -597,13 +280,6 @@ expect(surinToSaanenGoatFarmViaDij?.minDist).toBe(25.2);
597
280
  </td>
598
281
  <td>Recursion + Iteration</td>
599
282
  </tr>
600
- <tr>
601
- <td>Binary Tree Morris</td>
602
- <td>Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree
603
- traversal without additional stack or recursion.
604
- </td>
605
- <td>Iteration</td>
606
- </tr>
607
283
  <tr>
608
284
  <td>Graph BFS</td>
609
285
  <td>Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected
package/dist/data-structures/binary-tree/binary-tree.js CHANGED
@@ -266,9 +266,9 @@ class BinaryTree extends base_1.IterableEntryBase {
266
266
  * @returns a boolean value.
267
267
  */
268
268
  isRealNode(node) {
269
- if (!this.isNode(node))
269
+ if (node === this.NIL || node === null || node === undefined)
270
270
  return false;
271
- return node !== this.NIL;
271
+ return this.isNode(node);
272
272
  }
273
273
  /**
274
274
  * The function checks if a given node is a BinaryTreeNode instance and has a key value of NaN.
package/dist/data-structures/binary-tree/bst.js CHANGED
@@ -608,7 +608,7 @@ class BST extends binary_tree_1.BinaryTree {
608
608
  if (!current)
609
609
  return undefined;
610
610
  if (this._variant === 'STANDARD') {
611
- // For BSTVariant.MIN, find the rightmost node
611
+ // For 'STANDARD', find the rightmost node
612
612
  while (current.right !== undefined) {
613
613
  current = current.right;
614
614
  }
package/dist/data-structures/index.d.ts CHANGED
@@ -4,9 +4,9 @@ export * from './stack';
4
4
  export * from './queue';
5
5
  export * from './graph';
6
6
  export * from './binary-tree';
7
- export * from './tree';
8
7
  export * from './heap';
9
8
  export * from './priority-queue';
10
9
  export * from './matrix';
11
10
  export * from './trie';
12
11
  export * from './base';
12
+ export * from './tree';
package/dist/data-structures/index.js CHANGED
@@ -20,9 +20,9 @@ __exportStar(require("./stack"), exports);
20
20
  __exportStar(require("./queue"), exports);
21
21
  __exportStar(require("./graph"), exports);
22
22
  __exportStar(require("./binary-tree"), exports);
23
- __exportStar(require("./tree"), exports);
24
23
  __exportStar(require("./heap"), exports);
25
24
  __exportStar(require("./priority-queue"), exports);
26
25
  __exportStar(require("./matrix"), exports);
27
26
  __exportStar(require("./trie"), exports);
28
27
  __exportStar(require("./base"), exports);
28
+ __exportStar(require("./tree"), exports);
package/dist/utils/index.d.ts CHANGED
@@ -1 +1,2 @@
1
1
  export * from './utils';
2
+ export * from './number';
package/dist/utils/index.js CHANGED
@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
15
15
  };
16
16
  Object.defineProperty(exports, "__esModule", { value: true });
17
17
  __exportStar(require("./utils"), exports);
18
+ __exportStar(require("./number"), exports);
package/dist/utils/number.d.ts ADDED
@@ -0,0 +1 @@
1
+ export declare function toBinaryString(num: number, digit?: number): string;
package/dist/utils/number.js ADDED
@@ -0,0 +1,11 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.toBinaryString = void 0;
4
+ function toBinaryString(num, digit = 32) {
5
+ // Convert number to binary string
6
+ let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
7
+ // Use pad Start to ensure the string length is 32 bits
8
+ binaryString = binaryString.padStart(digit, '0');
9
+ return binaryString;
10
+ }
11
+ exports.toBinaryString = toBinaryString;
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "graph-typed",
3
- "version": "1.51.2",
3
+ "version": "1.51.4",
4
4
  "description": "Graph. Javascript & Typescript Data Structure.",
5
5
  "main": "dist/index.js",
6
6
  "scripts": {
@@ -136,6 +136,6 @@
136
136
  "typescript": "^4.9.5"
137
137
  },
138
138
  "dependencies": {
139
- "data-structure-typed": "^1.51.2"
139
+ "data-structure-typed": "^1.51.4"
140
140
  }
141
141
  }
package/src/data-structures/binary-tree/binary-tree.ts CHANGED
@@ -316,8 +316,8 @@ export class BinaryTree<
316
316
  * @returns a boolean value.
317
317
  */
318
318
  isRealNode(node: KeyOrNodeOrEntry<K, V, NODE>): node is NODE {
319
- if (!this.isNode(node)) return false;
320
- return node !== this.NIL;
319
+ if (node === this.NIL || node === null || node === undefined) return false;
320
+ return this.isNode(node);
321
321
  }
322
322
 
323
323
  /**
package/src/data-structures/binary-tree/bst.ts CHANGED
@@ -695,7 +695,7 @@ export class BST<
695
695
  if (!current) return undefined;
696
696
 
697
697
  if (this._variant === 'STANDARD') {
698
- // For BSTVariant.MIN, find the rightmost node
698
+ // For 'STANDARD', find the rightmost node
699
699
  while (current.right !== undefined) {
700
700
  current = current.right;
701
701
  }
package/src/data-structures/index.ts CHANGED
@@ -4,9 +4,9 @@ export * from './stack';
4
4
  export * from './queue';
5
5
  export * from './graph';
6
6
  export * from './binary-tree';
7
- export * from './tree';
8
7
  export * from './heap';
9
8
  export * from './priority-queue';
10
9
  export * from './matrix';
11
10
  export * from './trie';
12
11
  export * from './base';
12
+ export * from './tree';
package/src/utils/index.ts CHANGED
@@ -1 +1,2 @@
1
1
  export * from './utils';
2
+ export * from './number';
package/src/utils/number.ts ADDED
@@ -0,0 +1,9 @@
1
+ export function toBinaryString(num: number, digit = 32) {
2
+ // Convert number to binary string
3
+ let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
4
+
5
+ // Use pad Start to ensure the string length is 32 bits
6
+ binaryString = binaryString.padStart(digit, '0');
7
+
8
+ return binaryString;
9
+ }