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.

15 lines
101 B

  1. 10 14 1 10
  2. 1 2 5
  3. 2 10 4
  4. 1 10 7
  5. 1 3 8
  6. 3 10 9
  7. 1 4 3
  8. 4 7 1
  9. 7 10 1
  10. 1 5 3
  11. 5 8 4
  12. 8 10 6
  13. 1 6 7
  14. 6 9 6
  15. 9 10 5