搜索结果

本人对经典Maxflow算法的修改，实现的是C++和Matlab混合编程。cpp源码可以在matlab下编译，该实现方式比纯matlab实现效率高出好多。

Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The n ...