Main.cpp

#include <iostream>
#include "Graph.h"
#include "MaxFlowAlgorithms.h"

void printResult(FordFulkersonAnswer& answer ,  std::string&& type);

int main(){
    Graph g = Graph();
    try{
        g.buildGraph();
    }catch (std::invalid_argument& e){
        std::cout << e.what();
        exit(0);
    }
    FordFulkersonAnswer answer1 = MaxFlowAlgorithms::fordFulkersonWithBfs(g);
    printResult(answer1, "BFS");
    std::cout<<std::endl;
    FordFulkersonAnswer answer2 = MaxFlowAlgorithms::fordFulkersonWithDijkstra(g);
    printResult(answer2, "Greedy");
}

void printResult(FordFulkersonAnswer& answer ,  std::string&& type){
    std::cout << type << " Method:" << std::endl;
    std::cout<< "Max flow = " << answer.getMaxFlow() << std::endl;
    std::cout << "Min cut: S = ";

    int size = answer.getLeft().size();
    for(int i = 0; i < size; ++i){
        if(i == size -1){
            std::cout << answer.getLeft()[i] << ".";
        } else{
            std::cout << answer.getLeft()[i] << ", ";
        }
    }
    std::cout << " T = ";
    size = answer.getRight().size();
    for(int i = 0; i < size; ++i){
        if(i == size -1){
            std::cout << answer.getRight()[i];
        } else{
            std::cout << answer.getRight()[i] << ", ";
        }
    }
}