The approach I took to solve the maximum flow problem is the Ford Fulkerson method. The implementation used is the Edmond’s-Karp algorithm, which is a further specialization of Ford Fulkerson
-
Notifications
You must be signed in to change notification settings - Fork 0
Warsha97/FordFulkersonDemo
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Demonstrates the solution of 'Maximum flow of a network' problem, using Ford Fulkerson approach.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published