x/data-structure-typed
1
0
Fork 0
mirror of https://github.com/zrwusa/data-structure-typed.git synced 2024-11-10 08:04:05 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
317 commits 11 branches 7 tags 39 MiB
Commit graph

61 commits

Author SHA1 Message Date
Revone 28207b6d45 perf: Unified all APIs, all parameters that accept node types can also accept node keys as parameters. 2023-11-09 17:47:02 +08:00
Revone 000efa749d docs: Conventional Commits of CONTRIBUTING.md, Built-in classic algorithms enriched 2023-11-08 20:25:02 +08:00
Revone 50d1a168e7 [perf] renamed tree-multiset to tree-multimap 2023-11-08 09:26:43 +08:00
Revone 996fd128ed [binary-tree] Perfectly solved the null problem, in BST, AVLTree, and TreeMultiset, only 'undefined' is used as the empty node. 2023-11-07 12:26:16 +08:00
Revone be38422de9 [test] null should be ignored in travesal method in BST 2023-11-06 19:36:09 +08:00
Revone 25b9e1e9e4 [graph] To facilitate users who are not familiar with the Tarjan algorithm, provide the following methods: getCycles, getSCCs, getBridges, getCutVertexes, getDFNMap, and getLowMap. 2023-11-06 14:47:00 +08:00
Revone 8acd2e3c9b [docs] Remove the first column from the data structure comparison table in various programming languages. 2023-11-05 21:42:35 +08:00
Revone d6b394446a [binary-tree] All traversal methods offer an includeNull parameter to support the output of null nodes. 2023-11-05 21:19:59 +08:00
Revone 62e55b84bd [graph] The getAllPathsBetween method in the [graph] provides a 'limit' parameter to control this exponential time complexity method from entering into a deadlock state. The getMinPathsBetween method, by default, calls the Dijkstra method to avoid invoking the excessively high time complexity method, getAllPathsBetween. 2023-11-04 21:23:02 +08:00
Revone 025a90a145 [graph] use 'Set' in dfs instead of 'Map' 2023-11-04 15:47:24 +08:00
Revone 0ab8054f52 [pkg] v1.41.5 published 2023-11-04 01:35:21 +08:00
Revone bd2ecc5699 [benchmark] enriched the utils of performance test. enriched the performance test cases 2023-11-04 01:21:30 +08:00
Revone ca013f019f [benchmark] pretty html report for benchmark test 2023-11-02 11:38:29 +08:00
Revone 68aa49f9b1 [project] Decouple integration testing from the CI workflow. 2023-11-01 18:19:49 +08:00
Revone e9f2359365 [binary-tree] Let the get method call getNode instead of getNodes. [rbtree] Use rigorous testing to verify that the properties of nodes in a red-black tree adhere to the red-black tree rules after insertion and deletion. 2023-11-01 17:51:38 +08:00
Revone ea3ab1283e [rbtree] extracted RBTNColor to types 2023-11-01 11:52:44 +08:00
Revone 10bbcffcef [pkg] v1.40.0 published 2023-10-31 11:22:21 +08:00
Revone 1822084407 [pkg] v1.39.6 published 2023-10-31 08:43:54 +08:00
Revone 3aea9fc046 v1.39.5 published 2023-10-30 18:53:14 +08:00
Revone c001251cfc [binary-tree] this._defaultCallbackByKey deprecated 2023-10-30 11:40:03 +08:00
Revone bf5b865e2c [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
Revone c492af0461 [linked-list] Standardize the method names of DoublyLinkedList and SinglyLinkedList. 2023-10-29 16:43:19 +08:00
Revone 6c45f53f72 [heap, priority-queue, binary-indexed-tree] Heap and PriorityQueue constructors use a single object as a parameter for uniformity with the design of other data structures. 
Binary Indexed Tree includes the getPrefixSum method.
 2023-10-28 17:37:51 +08:00
Revone c11cc4527b [graph] The removal method in the graph data structure is standardized to 'delete' 2023-10-28 15:58:48 +08:00
Revone f90afe0b57 [binary-tree] The binary tree's BFS and level-order traversal results should be the same. However, for convenience, we provide an additional method called listLevels to display traversal results in levels. 2023-10-27 22:30:52 +08:00
Revone af23af911a [binary-tree] renamed _loopType to _iterationType 2023-10-27 17:17:27 +08:00
Revone f2d3be7574 [binary-tree] Translate the return value type inference for methods that take a callback function as a parameter. 2023-10-26 20:26:06 +08:00
Revone 31c228668e [optimization] allow all list datatype delete methods to accept null as an input argument 2023-10-26 16:45:08 +08:00
Revone 74d4294320 [binary-tree] Provide comprehensive JSDoc comments for the enhanced APIs. 2023-10-24 09:25:33 +08:00
Revone af7372ba30 [pkg] ready to publish v1.37.0 2023-10-22 00:00:22 +08:00
Revone 284e85e76b [pkg] v1.36.9 published 2023-10-21 20:19:35 +08:00
Revone cb56b04af5 [test] big o estimate refined 2023-10-21 14:46:41 +08:00
Revone b7a7e36563 [project] added publish:all command 2023-10-20 11:51:26 +08:00
Revone ba9cd51a6a [project] enrich the scripts of ci 2023-10-19 09:21:00 +08:00
Revone 57c4511e69 [project] Integrate the CI commands into a single command and uniformly invoke this CI command across different platforms. 2023-10-18 16:05:55 +08:00
Revone b10400e9c5 [pkg] v1.36.3 published 2023-10-17 23:52:24 +08:00
Revone 338fb60887 [pkg] v1.36.1 published 2023-10-17 19:31:16 +08:00
Revone 894fb55107 [heap] v1.36.0 Heap and PriorityQueue have been redesigned 2023-10-16 00:24:56 +08:00
Revone 641bf9785f [pkg] v1.35.1 2023-10-11 23:45:08 +08:00
Revone 799b7db7d3 [pkg] 1.34.9 published 2023-10-11 19:32:36 +08:00
Revone 3bffa7320c [core] rename id to key 2023-10-10 20:13:47 +08:00
Revone 55b4034e1a [pkg] v1.34.7 published 2023-10-10 19:29:07 +08:00
Revone 0c5df67215 [readme] badages updated 2023-10-10 17:22:18 +08:00
Revone 7a2bc8556c [core] before RBTree implemented 2023-10-09 13:27:15 +08:00
Revone f4d234df29 [pkgs] all sub packages add unit test cases 2023-10-08 18:25:29 +08:00
Revone 40ad74f609 [pkg] v1.34.3, all individual packages coverage directory generated 2023-10-06 21:33:44 +08:00
Revone 8659e1d09d [pkg] code quality improved to 99% 2023-10-06 20:51:55 +08:00
Revone a1cd24aeeb [pkg] quality reduced to 53.94%, must improve it 2023-10-06 18:00:47 +08:00
Revone f223f6fd41 v1.33.7 published 2023-10-03 14:15:09 +08:00
Revone 63afaf90cf [core] v1.33.7 ready to be pubished 2023-09-29 17:40:32 +08:00