branch flow-max-min algorithm - readme
delete source unserviceable
basic file git ignore
refactory of the class, using pattern design Decorator
refactory add vertex, node and move
refactory clear,delete edge and delete vertex
it end the refactory, I have not updated the model Geometric
algorithm BFS and DFS
an improved algorithm BFS DFS AdjacencyList
simulation in swing of the algorithm BFS and DFS
algorithm bellman-ford
add draw curve
Ford-Fullkerson and Edmond-Karp algorithm
Residual Graph Network Flow
improve and algorithm Dinic
test of performance, bug in the algorithm Dinic
Dinic with backtrack to look for a path
version 1 Dinic, work with the same graph
Algorithm Dinic
design curve with arrow