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.

27 lines
574 B

  1. include(util/CMakeLists.txt)
  2. set(CMAKE_CXX_STANDARD 17)
  3. set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -D__FILENAME__='\"$(subst ${CMAKE_SOURCE_DIR}/,,$(abspath $<))\"'")
  4. #add_definitions(-DLOG_DEBUG)
  5. cmake_minimum_required(VERSION 3.0...3.22)
  6. set(CMAKE_BUILD_TYPE Debug)
  7. project(
  8. max_flow
  9. VERSION 1.0
  10. LANGUAGES CXX)
  11. #find_package(Boost COMPONENTS program_options REQUIRED)
  12. #include_directories("." db exceptions)
  13. add_executable(maxFlow
  14. ${SRCS}
  15. main.cpp
  16. Graph.cpp
  17. )
  18. target_link_libraries(maxFlow stdc++fs)