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…

Repositório para colocar os códigos feito quando eu cursei a disciplina de Algoritmos II