sp
/
MaxFlowDinic
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
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.
9 Commits
1 Branch
0 Tags
58 KiB
Branch: main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
MaxFlowDinic/examples/FF_killer.txt

7 lines
48 B
Raw Permalink Normal View History

added examples and README
2 years ago
​
​
​
allow multiple definition of same arc in input
2 years ago
​
added examples and README
2 years ago
  1. 4 5 1 4
  2. 1 2 99
  3. 1 3 99
  4. 2 3 1
  5. 2 4 98
  6. 2 4 1
  7. 3 4 99