This is a repository that contains graphing algorithms.
in the src/grafo folder it is possible to find examples of algorithms such as DFS, BFS, Djikstra, Bellman Ford, Floyd Warshall and connected components.
there is also implementation of edge and vertex classes and a graph inheritance for directed and undirected graphs.
in the src/FlowNetwork folder you can find the implementation of the Ford Fulkerson algorithm. implementation of the flow network and the augmenting path.