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 ...
/dl/482771.html
标签：
Implementation
calculates
algorithm
Edmonds
上传时间：
2014-01-04
上传用户：kiklkook
