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.
1 Commit
1 Branch
0 Tags
58 KiB
Tree: bc203ea9c5
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'bc203ea9c5'
${ noResults }
MaxFlowDinic/util/CMakeLists.txt

7 lines
218 B
Raw Normal View History

initial commit Finished basic implementation of Dinic's algorithm
2 years ago
​
​
​
​
​
​
  1. list(APPEND SRCS
  2. ${CMAKE_CURRENT_LIST_DIR}/Arc.h
  3. ${CMAKE_CURRENT_LIST_DIR}/GraphParser.cpp
  4. ${CMAKE_CURRENT_LIST_DIR}/OptionParser.cpp
  5. ${CMAKE_CURRENT_LIST_DIR}/Vertex.cpp
  6. ${CMAKE_CURRENT_LIST_DIR}/popl.hpp
  7. )