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.

7 lines
44 B

  1. 6 6 1 6
  2. 1 2 2
  3. 2 3 2
  4. 2 4 2
  5. 3 5 2
  6. 4 5 2
  7. 5 6 4