All the advanced algorihtms that i covered all by myself during my college . Many of the alogrithm were not taught in the college .The repository provides a comprehensive overview of various data structures and algorithms, organized from the simplest to the most complex.

Comparing performance of Tarjan algo v/s Schmidt decomposition for checking biconnectedness of undirected graphs (sparse, dense, non-biconnected, large number of nodes, etc.)

Parallel Biconnected Components

Solution for problem for Graph Algorithms course at AGH UST

Improving performance of Tarjan-Vishkin algorithm for finding BCCs, on large graphs using DSUs.

Compute Biconnected Components of a graph