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.

Tree: ed2c9d30d1

main

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'ed2c9d30d1'

${ noResults }

MaxFlowDinic/util

History

Stefan Pranger ed2c9d30d1 added FF killer example with loop		3 years ago
..
Arc.h	initial commit	3 years ago
CMakeLists.txt	initial commit	3 years ago
GraphParser.cpp	initial commit	3 years ago
GraphParser.h	initial commit	3 years ago
OptionParser.cpp	changes to option parser output	3 years ago
OptionParser.h	initial commit	3 years ago
Vertex.cpp	initial commit	3 years ago
Vertex.h	initial commit	3 years ago
popl.hpp	initial commit	3 years ago