Implement ford fulkerson algorithm for determining max flow in a graph given by it's adjacency matrix
Implemented Bellman Ford algorithm. Instead of giving a notification in case the graph contains a negative cycle, it follows the path along the cycle and returns the nodes on the cycle.
Implemented min-cost-flow algorithm which basically determinesa maxium flow using Ford-Fulkerson's method and then removes negative cost cycles by pushing flow along the circle's eges. Unfortunately, this implementation is still not working properly due to the fact that the residual graph cannot be expressed as an adjacency matrix, since there can be more than one directed edge [u,v] from node u to node v with different cost values.
Added node and edge classes as alternative representation of a graph
Composed nodes and edges in a network class which can create the elements of the network from an adjacency matrix