Graphs

Implemented Algorithms O(m+n):

1. Karger Minimum Cut

Searching:

2. Breadth First Search(with Applications): a) Shortest Paths b) Connected Components

3. Depth First Search(with Applications): a) Topological ordering(directed acyclic graph) b) Strongly Connected Components using Kasaraju's Algorithm(Toughest)

Sources:

1. Course Link :https://lagunita.stanford.edu/courses/course-v1:Engineering+Algorithms1+SelfPaced/about
2. For Kasaraju's Algo: https://www.geeksforgeeks.org/strongly-connected-components/ https://www.hackerearth.com/practice/algorithms/graphs/strongly-connected-components/tutorial/