This project implements a Dynamic Connectivity Tool using the Union-Find (Disjoint Set Union) algorithm with Tarjan's optimizations (path compression and union by rank). It processes Union, Find, and ...

Abstract: We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges ...

💡 Kosaraju's Algorithm (for SCC) Kosaraju’s algorithm is a well-known method for finding strongly connected components (SCCs) in a directed graph. The algorithm consists of two main steps: Perform a ...