My Friends,
as i ask a new question recently,
Increase by one, Shortest path, changes the edges or not?
i want to ask a related question as a new post
Suppose we have a Graph G in which weight of all edges is >1 (integer and positive). If we increase weight of all edges by one, the min-cut (S, T) in two graphs remain unchanged.
i want to find an formal way to proof why the min cut dosnt change.
$\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;$