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

#pragma once
#include <iostream>
#include "popl.hpp"
#define INPUT_ERROR 1
#define INPUT_OK 0
namespace parser {
int printPoplException(const popl::invalid_option &e);
int checkOption(const int input_filename_count,
const int input_string_count);
}