Network Simplex and Tight Tree Layout difference?

[janithmehta]

While I can see that Network Simplex and Tight tree compute rankings differently, I cannot observe a visual difference between them. Examples of some types of graphs which show considerable difference between them would be great.

Tight Tree

Network Simplex

PS:- This is one of many graphs in which I fail to observe a visual difference

[weiyisheng]

@janithmehta I feel confuse too. A tight-tree means that every edge has its minimum length, so, is a tight-tree giving a optimally ranking in most case ?

[weiyisheng]

@janithmehta I also have other questions: I know how to calculate a cut value of a feasible-tree edge, but why a negative cut value indicates the edge should be reduced?

[lin-credible]

+1