GitHub - AvivBk/maximum_flow_in_a_flow_network: The project receives as input a valid flow network represented by a directed graph with capacitances on the edges. The project finds maximum flow in the network through two approaches: 1. Ford Falkerson, Path Finding Improves Shortest Path Selection (BFS) 2. Ford Falkerson, finding an improving route with the greedy approach - by finding the heaviest route (Dijkstra variation with priority queue) Then finds the minimum capacity of the track At the end of the process, the user is shown the value of the maximum flow in the network as well as the minimum section in the network, by BFS on G(F)

AvivBk / maximum_flow_in_a_flow_network Public

Notifications You must be signed in to change notification settings
Fork 1
Star 0

The project receives as input a valid flow network represented by a directed graph with capacitances on the edges. The project finds maximum flow in the network through two approaches: 1. Ford Falkerson, Path Finding Improves Shortest Path Selection (BFS) 2. Ford Falkerson, finding an improving route with the greedy approach - by finding the hea…

0 stars 1 fork Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
FlowNetwork.vcxproj		FlowNetwork.vcxproj
FlowNetwork.vcxproj.filters		FlowNetwork.vcxproj.filters
FlowNetwork.vcxproj.user		FlowNetwork.vcxproj.user
Program.cpp		Program.cpp
Program.h		Program.h
adjacency_list_graph.cpp		adjacency_list_graph.cpp
adjacency_list_graph.h		adjacency_list_graph.h
edge_node.h		edge_node.h
edges_array.h		edges_array.h
input.txt		input.txt
main.cpp		main.cpp
max_flow_ford_fulkerson.cpp		max_flow_ford_fulkerson.cpp
max_flow_ford_fulkerson.h		max_flow_ford_fulkerson.h
max_flow_greedy_method.cpp		max_flow_greedy_method.cpp
max_flow_greedy_method.h		max_flow_greedy_method.h
output.txt		output.txt
vertex_list.cpp		vertex_list.cpp
vertex_list.h		vertex_list.h
vertex_node.h		vertex_node.h