Skip to content

davidfer1112/Flujo_Maximo_FordFulkerson

Repository files navigation

Flujo_Maximo_FordFulkerson

ES/

Implementación de algoritmo Ford Fulkerson, con matrices de adyacencia, 
el programa tiene como fin buscar el flujo máximo de un grafo, 
a su vez que se va mostrando cada paso en un lapso de tres segundos

EN/

Implementation of Ford Fulkerson algorithm, with adjacency matrices,
the program aims to find the maximum flow of a graph, 
while showing each step in a time span of three seconds.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages