GitHub / cankobanz / maximum-flow-modelling-on-network-flow-graph
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankobanz%2Fmaximum-flow-modelling-on-network-flow-graph
PURL: pkg:github/cankobanz/maximum-flow-modelling-on-network-flow-graph
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Java
Size: 6.84 KB
Dependencies parsed at: Pending
Created at: over 3 years ago
Updated at: over 1 year ago
Pushed at: over 2 years ago
Last synced at: over 1 year ago
Topics: algorithms-and-data-structures, dinic-algorithm, max-flow