This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It is an application of finding maximum flow on network flow graphs. The aim of the project is make sure to supply as many flow from source to sink.
-
Notifications
You must be signed in to change notification settings - Fork 0
This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It is an application of finding maximum flow on network flow graphs. The aim of the project is make sure to supply as many flow from source to sink.
cankobanz/maximum-flow-modelling-on-network-flow-graph
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This is a school project from Data Structures and Algorithms course where network flow graph, Dinic's Algorithm are used effectively. It is an application of finding maximum flow on network flow graphs. The aim of the project is make sure to supply as many flow from source to sink.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published