Having a (complex) graph calculate his maximum flow

Realize a C++ application which recieving in input a graph is able to calculate the value of the maximum flow of the related graph. There are some specifications that I'll explain to who is interested. The basic idea is this.

The code has to be very clean and well commented, I have to understand every line.

Compétences : Programmation C++, Architecture Logicielle

en voir plus : maximum flow graph, the graph, programming graph, in a graph, graph programming, graph in c programming, graph in c, graph graph, graph c, c graph, architecture idea, a graph, maximum flow, able calculate, application calculate, code graph, maximum, calculate value, related programming, tanker scheduling problem maximum flow

Concernant l'employeur :
( 12 commentaires ) Cicagna, Italy

Nº du projet : #1073887

Décerné à:


Please check your PMB.

%selectedBids___i_sum_sub_4% %project_currencyDetails_sign_sub_5% USD en 1 jour
(8 Commentaires)