Sorting Theory

Problems

Print adjacency list BFS of graph DFS of Graph Find the number of islands Undirected Graph Cycle Directed Graph Cycle Find whether path exist Topological sort Level of Nodes Possible paths between 2 vertices X Total Shapes Distance of nearest cell having 1 Mother Vertex Unit Area of largest region of 1's Rotten Oranges Minimum Swaps to Sort Steps by Knight Dijkstra Algorithm Minimum Spanning Tree Strongly Connected Minimum Cost Path Bridge edge in a graph Strongly connected component (Tarjans's Algo)