Question about flow-tree

Revision en1, by HE_MATEMATIK, 2017-07-08 11:01:05

Suppose we have a matrix A such that A[i][j] is the max flow from i to j in some undirected graph G.

Can anyone give me the counter-test for solution like: get maximal spanning tree in this full graph, and now if this graph existst, we will have maxflow(i, j) == A[i][j]?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English HE_MATEMATIK 2017-07-08 11:01:05 300 Initial revision (published)