Further never had me thinking too long to solve a problem.
This was swell until I met the problem: Network cuts.
If anyone can explain to me how to draw out all the cuts to a specific network I would appreciate it. (I can calculate capacities of cuts, but not determine the cut itself)
Example:
Consider the network (attached).
Draw up a table listing all the cuts, and the capacity of each cut.
Solution has 6 cuts. If I drew each possible cut I can find around 8.
I really do hate further because of these illogical childsplay-like solutions, which I'm failing to solve.
A cut is defined as a collection of edges that, if removed from the directed graph, produces a zero flow between the start (S) and the terminal (T).
According to this definition, why are my 7th and 8th cut diagrams (2nd .png) not valid in the solution?
According to this definition, why can't we do random squiggly-line cuts everywhere (ie. a cut going up and down, etc)
Someone enlighten me please