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.
 
 
 

7 lines
218 B

list(APPEND SRCS
${CMAKE_CURRENT_LIST_DIR}/Arc.h
${CMAKE_CURRENT_LIST_DIR}/GraphParser.cpp
${CMAKE_CURRENT_LIST_DIR}/OptionParser.cpp
${CMAKE_CURRENT_LIST_DIR}/Vertex.cpp
${CMAKE_CURRENT_LIST_DIR}/popl.hpp
)