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
..
data-structures	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
interfaces	fix: Fix bug in BST.isBST to make it compatible with inverse BST.	2023-12-23 11:53:18 +08:00
types	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
utils	refactor: Remove the _addTo method from BinaryTree and TreeMultiMap.	2023-12-22 19:59:38 +08:00
index.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00