GeezerVison

GeezerVison is showing github.com — GitHub - fnieri/MaxFlowProblem: This project solves the maxflow problem in algorithmics from an instance in the instances directory, The problem is solved using GLPK and the augmenting path DInitz algorithm

Branches Tags

Open more actions menu

Latest commit

History

25 Commits

Folders and files

Name		Name	Last commit message	Last commit date
flow_solvers		flow_solvers
instances		instances
.gitignore		.gitignore
README.md		README.md
analyse_generation.py		analyse_generation.py
analyse_instances.py		analyse_instances.py
chemin_augmentant.py		chemin_augmentant.py
generate_model.py		generate_model.py
resPython1.txt		resPython1.txt
resPython2.txt		resPython2.txt
resPython3.txt		resPython3.txt
resPython4.txt		resPython4.txt
resPython5.txt		resPython5.txt
resPython6.txt		resPython6.txt
resPython7.txt		resPython7.txt
resPython8.txt		resPython8.txt
resPython9.txt		resPython9.txt
results0.txt		results0.txt
results1.txt		results1.txt
results10.txt		results10.txt
results11.txt		results11.txt
results12.txt		results12.txt
results13.txt		results13.txt
results14.txt		results14.txt
results2.txt		results2.txt
results3.txt		results3.txt
results4.txt		results4.txt
results5.txt		results5.txt
results6.txt		results6.txt
results7.txt		results7.txt
results8.txt		results8.txt
results9.txt		results9.txt

Repository files navigation

Maximum flow problem - Harsh Dua, Francesco Nieri

To use the generate_model.py, run it with python3 using

python generate_model.py inst-n-p.txt

where the inst-n-p.txt file is in the same directory. This will generate a model-n-p.lp and a model-n-p.sol in the same directory

To use the chemin_augmentant.py, run it with python3 using

python chemin_augmentant.py inst-n-p.txt

This will generate a model-n-p.path file in the same directory

About

This project solves the maxflow problem in algorithmics from an instance in the instances directory, The problem is solved using GLPK and the augmenting path DInitz algorithm