search

Kemsekov / GraphSharp

GraphSharp is a tool to study and use knowledge of graph theory in C#!
MIT License
39 stars 5 forks source link

Add network flow algorithms #45

Closed Kemsekov closed 8 months ago

Kemsekov commented 2 years ago

https://en.wikipedia.org/wiki/Maximum_flow_problem https://en.wikipedia.org/wiki/Minimum-cost_flow_problem https://en.wikipedia.org/wiki/Network_simplex_algorithm https://en.wikipedia.org/wiki/Multi-commodity_flow_problem

Kemsekov commented 8 months ago

Take max flow and min cost max flow from here https://developers.google.com/optimization/flow/assignment_min_cost_flow?hl=en#teams-workers

Kemsekov commented 8 months ago

Done.

It was rather simple