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.
|
|
include(util/CMakeLists.txt)
set(CMAKE_CXX_STANDARD 17)
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -D__FILENAME__='\"$(subst ${CMAKE_SOURCE_DIR}/,,$(abspath $<))\"'") #add_definitions(-DLOG_DEBUG)
cmake_minimum_required(VERSION 3.0...3.22)
set(CMAKE_BUILD_TYPE Debug)
project( max_flow
VERSION 1.0
LANGUAGES CXX)
#find_package(Boost COMPONENTS program_options REQUIRED)
#include_directories("." db exceptions)
add_executable(maxFlow ${SRCS}
main.cpp
Graph.cpp
)
target_link_libraries(maxFlow stdc++fs)
|