I am trying to implement all (most) of the graph algorihms... Just to cement my C++ fundamentals. It will also reinforce my graph-knowledge.

TODO: the adjacency list/matrix is still with pointers, I shall prefer to totally avoid pointers. But then, I'll do it in the future.

This one contains, different shortest paths, traversals, network flow (well, finding augmented paths, of course).

Would like to implement bipartite, maximum matching. Also, my own version of the same and do a lot of testing.