• Depth First Search and it's Variants

• Breadth First Search

• Dijkstra

• Bellman Ford

• Miscellaneous

• Depth First Search and it's Variants

Cycle Checking , Topsort , Connected Components , Strongly Connected Components , Articulation Points , Articulation Bridge etc various algorihms are actually application of DFS .

• Basic DFS

• Given a Set of Vertices in a Directed Unweighted Graph , how many Nodes are reachable by all of them

• Given a Source Vertex and a graph Consisting of Both Directed and Undirected Edges give direction to the existing undirected edges so that Number of visited vertices from Source vertex is maximized

• Given a Source Vertex and a graph Consisting of Both Directed and Undirected Edges give direction to the existing undirected edges so that Number of visited vertices from Source vertex is minimized

Light OJ 1049 : Solution

Light OJ 1111 : Solution

Light OJ 1185 : Solution

Codeforces 883G : Solution

• Detect Cycle in a Graph

• Topological Sorting of Nodes in Directed Graph ( Any )

• Topological Sorting of Nodes in Directed Graph ( ALL)

• Given a Directed Graph and a Source Vertex add minimum directed edges to the Graph So that All the Vertices are Reachable from Source Vertex

Light OJ 1003 : Solution

Light OJ 1390 : Solution

Codeforces 1385E: Solution

Codeforces 999E: Solution

Light OJ 1034: Solution

UVA 10305: Solution

UVA 11060: Solution

UVA 11686: Solution

UVA 124: Solution

UVA 872: Solution