Initial commit. Adding graph algorithms (dijkstra, bellman-ford, floyd-warshall).
Adding a gitignore. Unittesting the shortest path algorithms. Organizing directory structure.
Adding maximum flow algorithm (ford-fulkerson), and unit tests for it. Changing shortest path algorithms such that they return a prev[] mapping to retrace the original path.