Revone
|
e6acc0f8f1
|
docs: diagram width
|
2024-10-11 22:50:11 +13:00 |
|
Revone
|
68d4ca3b10
|
docs: Merging colloquial descriptions with data structure selection
|
2024-10-11 22:47:06 +13:00 |
|
Revone
|
465744c2ec
|
feat: Replace the AVLTree with a Red-Black Tree to implement TreeMultiMap, preserving the implementation of TreeMultiMap using AVLTree and renaming it as AVLTreeMultiMap.
|
2024-01-08 22:22:41 +08:00 |
|
Revone
|
5c9f4fd483
|
fix: #74 . Refactor: Implement the Tarjan algorithm separately for DirectedGraph and UndirectedGraph. In the previous design, the tarjan method was placed in the AbstractGraph class. However, Tarjan algorithm is used to find connected components in directed graphs and to solve bridges, articulation points, determine the presence of cycles (though not all), and biconnected components in undirected graphs. The algorithm for finding all cycles in the graph can be shared between directed and undirected graphs using the getCycles method.
|
2024-01-07 22:25:25 +08:00 |
|
Revone
|
fa9e3dbac4
|
docs: Enhance the explanation of the theory that respects computer science.
|
2023-12-24 17:54:51 +08:00 |
|
Revone
|
2247316d16
|
refactor: Remove the _addTo method from BinaryTree and TreeMultiMap.
feat: Reimplement Matrix.
docs: Use typedoc.json configuration to only output class documentation.
|
2023-12-22 19:59:38 +08:00 |
|
Revone
|
c3db558607
|
Refactor: The default callback function now supports returning values for null and undefined nodes with undefined keys. The deleteVertex method in AbstractGraph has been made abstract. Unnecessary magnitude variables have been removed from the magnitude function. fix: In directed and undirected graphs, the deleteVertex method now removes edges from adjacent nodes when deleting a vertex.
|
2023-12-21 10:01:04 +08:00 |
|
Revone
|
3e97e806ba
|
refactor: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.
|
2023-12-12 21:14:17 +08:00 |
|
Revone
|
c3b79b70f6
|
docs: Add a GITHUB stars badge. Adjust the order of the table. Test: Specify the type of binary tree constructor.
|
2023-12-08 10:07:51 +08:00 |
|
Revone
|
7270a27425
|
docs: Benchmarking metrics compared to native JavaScript
|
2023-12-08 09:15:29 +08:00 |
|
Revone
|
e167771620
|
docs: Benchmarking metrics compared to native JavaScript
|
2023-12-08 09:04:49 +08:00 |
|
Revone
|
aff29b3568
|
docs: Why use our data structures.
|
2023-12-07 15:37:50 +08:00 |
|
Revone
|
d038e03ef2
|
docs: Chinese version README.md
|
2023-12-07 14:03:58 +08:00 |
|
Revone
|
3cd5316f2a
|
docs: Chinese version README.md
|
2023-12-07 11:40:36 +08:00 |
|
Revone
|
a0a9ed2f50
|
docs: Chinese version README.md
|
2023-12-07 11:40:01 +08:00 |
|