search

root-11 / graph-theory

A simple graph library
MIT License
82 stars 19 forks source link

Simplex Network Algorithm for min cost flow problem #10

Closed root-11 closed 3 years ago

root-11 commented 4 years ago

Implementation of the Simplex Network Algorithm for min cost problem. example.

root-11 commented 3 years ago

After reviewing a number of examples of the simplex network method (snm) for calculating the solution to the minimum cost flow model, I've come to the conclusion(s) that:

  1. Successive shortest path is simpler to implement
  2. more robust (handles excess and inadequate supply).
  3. In practice no slower than SNM.

On this basis the method is available form today in master.