A simple students project implementing Dinic's Algorithm to compute the max flow/min cut of a network.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

8 lines
54 B

  1. 4 5 1 4
  2. 1 2 99
  3. 1 3 99
  4. 2 3 1
  5. 3 2 1
  6. 2 4 98
  7. 2 4 1
  8. 3 4 99