List 1: Implement the following algorithms in Plain Python or R. One or more graph data-sets (both small and large) will be supplied as appropriate to test your implementation on.
Also, think about concepts around you i.e. in the real world that you can represent as graphs. Create the graph, create the graph data-set out of it, apply the following algorithms on these. Can these algorithms find/discover something in these concepts that can be interesting and useful. Think about an application or tool - that might be of use.
Algorithms:
BFS
DFS
Single Source Shortest Path
All pair shortest path
Karger's Algorithm
Min-Cut Algorithm
Cliques Algorithms
More will be added later ..