data-structure-typed/test/unit/data-structures
2023-10-30 20:08:25 +08:00
..
binary-tree [binary-tree] this._defaultCallbackByKey deprecated 2023-10-30 11:40:03 +08:00
graph [graph test] edge cases enriched 2023-10-30 20:08:25 +08:00
hash [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
heap [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
linked-list [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
matrix [test] Increase the test coverage to 89.51. 2023-10-28 23:54:27 +08:00
priority-queue [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
queue [graph] Modify the data structure design of the graph to change the generics of Vertex and Edge to defaults, where it is possible to only pass the value types of Vertex and Edge for increased usability. 2023-10-30 18:27:58 +08:00
stack [test] Test case coverage is 63.1%. 2023-09-26 17:06:17 +08:00
tree [tree] tests passed 2023-10-18 17:10:31 +08:00
trie 1. No need for dfsIterative; integrate it directly into the dfs method. 2. Allow for public configuration of setLoopType. 3. Replace subTreeAdd with subTreeForeach for improved clarity and flexibility; provide a callback for enhanced versatility. 4. Standardize the naming of certain methods and parameters. 2023-10-21 20:03:54 +08:00