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/.gitignore

1 line
7 B
Raw Permalink Normal View History

initial commit Finished basic implementation of Dinic's algorithm
3 years ago
  1. build/