Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Registration Number:-18MCS0089
Exercise Name:- Min Cost max flow Algorithm
Solution:
#include <iostream>
#include <list>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <string>
#include <sstream>
#include <queue>
Graph g;
Graph resGraph;
// Generates a new edge (allocating space dynamically) and returns a pointed to the
edge
Edge* genEdge(int destination, int capacity, int residualFlow, int cost){
Edge* e1 = new Edge;
e1->destination = destination;
e1->capacity = capacity;
e1->residualFlow = residualFlow;
e1->cost = cost;
return e1;
}
int main(){
int numVertices, numEdges, source, destination, flow;
int tu, tv, tcap, tcost, tflow;