v1.51.5 (18 January 2024)
Changes
- Tests for DirectedGraph.tarjan
#69
- Rbtree
#31
- [graph test] edge cases enriched
#30
- [graph] Modify the data structure design of the graph to change the g…
#29
- Optimization
#23
- Optimization
#20
- [binary-tree, graph] Replace all code that uses Arrays as makeshift Q…
#18
-
- No need for dfsIterative; integrate it directly into the dfs metho…
#17
- [heap] fibonacci heap implemented. [test] big O estimate. [project] n…
#15
- [rbtree] implemented, but with bugs
#13
- [trie] renamed ambiguous methods and add comments to all methods.
#12
- [binarytree] modified the getDepth method to adhere to the proper def…
#11
- Trie
#10
- [tree] getHeight returns faulty height bug fixed
#9
- [trie] support casesensitivity. getWords bug fixed
#8
- [binary-tree, graph] In order to optimize the design of Binary Trees,…
#7
- [BinaryTree, Heap] In abstract classes, only retain abstract methods.…
#6
- [heap] test
#5
- [heap, priority queue] Heap improved. References #123: redesigned
#4
- test
#3