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.

15 lines
276 B

  1. #pragma once
  2. #include <iostream>
  3. #include "popl.hpp"
  4. #define INPUT_ERROR 1
  5. #define INPUT_OK 0
  6. namespace parser {
  7. int printPoplException(const popl::invalid_option &e);
  8. int checkOption(const int input_filename_count,
  9. const int input_string_count);
  10. }