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
..
binary-tree	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
graph	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
hash	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
heap	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
linked-list	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
matrix	refactor: Remove the _addTo method from BinaryTree and TreeMultiMap.	2023-12-22 19:59:38 +08:00
priority-queue	style: code base reformat	2023-12-21 10:26:45 +08:00
queue	Refactor: Organize the access permissions of all member variables. Docs: Partial documentation for time and space complexity.	2024-01-05 15:37:28 +08:00
stack	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
tree	style: reformated codebase	2023-11-16 10:14:14 +08:00
trie	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00