This project is a Java implementation of the Edmonds-Karp algorithm — a classic method for computing the maximum flow in a flow network. It uses Breadth-First Search (BFS) to find augmenting paths and is a practical application of graph theory and network flow.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project is a Java implementation of the Edmonds-Karp algorithm — a classic method for computing the maximum flow in a flow network. It uses Breadth-First Search (BFS) to find augmenting paths and is a practical application of graph theory and network flow.
TharushiJayasooriya/BFs-based--Max-flow-solver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project is a Java implementation of the Edmonds-Karp algorithm — a classic method for computing the maximum flow in a flow network. It uses Breadth-First Search (BFS) to find augmenting paths and is a practical application of graph theory and network flow.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published