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.

6 lines
38 B

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