There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
Algorithms II uni project. Analyzes undirected graphs and uses a custom version of Tarjan's algorithm with a single DFS to find all SCCs, size of biggest SCC, articulation points and size of biggest SCC with articulation points removed.