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]?