-
Snake and Ladder Problem
-
Tarjan's Algorithm for Strongly Connected Components
-
Topological Sorting
-
Ford Fulkerson Algorithm
-
Transitive closure of a Graph
-
Check For Star Graph
-
Bellman–Ford Algorithm for Shortest Paths
-
Box Stacking Problem
-
Detect Cycle in a an Undirected Graph
-
Detect Cycle in a Directed Graph
-
Euler Circuit in a Directed Graph
-
Eulerian Path and Circuit
-
Fleury’s Algorithm
-
Graph Coloring
-
Longest Path in a Directed Acyclic Graph
-
How to find if a graph is Bipartite?
-
Shortest Path in a Directed Acyclic Graph
-
Maximum Bipartite Matching
-
Closest Pair of Points Problem
-
Peak Element in 2D array