Description:- C program that uses capacity scaling(delta) to solve the maximum flow problem. program outputs all augmenting paths and also indicates any changes in delta(scaling parameter), and displays maximum flow obtained. This algorithm uses BFS method for graph traversal.
-
Notifications
You must be signed in to change notification settings - Fork 1
bhataparnak/maximum-flow-problem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Capacity scaling to solve the maximum flow problem
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published