This repo contains the code for computing the maximum flow of a flow network using the Edmonds-Karp implementation of Ford-Fulkerson. It also has an application of the max flow problem called "The ...
Ford-Fullkerson-Algorithm/ ├── src/ # Source code │ ├── utils.h/.c # Utility functions and data structures │ ├── graph.h/.c # Graph representation and operations │ ├── path.h/.c # Path finding ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback