Successsive shortest path algorithm to solve minimum cost flow problem. Uses Dijkstra's algorithm to get shortest paths.
First line - size of matrix
Rest of the file - adjacency matrix
First Line - optimal assignment
End of file - total cost
Shaman135/successive-shortest-path
Successsive shortest path algorithm to solve minimum cost flow problem. Uses Dijkstra's algorithm to get shortest paths.
C++MIT