Minimum Cost Flow Algorithms

Detailed Description

This group contains the algorithms for finding minimum cost flows and circulations. For more information about this problem and its dual solution see Minimum Cost Flow Problem.

NetworkSimplex is an efficient implementation of the primal Network Simplex algorithm for finding minimum cost flows. It also provides dual solution (node potentials), if an optimal flow is found.

Classes
class	NetworkSimplex< GR, V, C >
	Implementation of the primal Network Simplex algorithm for finding a minimum cost flow. More...

Files
file	network_simplex.h
	Network Simplex algorithm for finding a minimum cost flow.