Bpp/Graph_problem
Min_cost_flow
C++
 
 
DESCRIPTION
 

This module provides facilities to find a flow of minimum cost in a graph. The graph is supposed to have unique source and target nodes, and the algorithms that solve the problem add a return loop between these nodes.

 
SOURCE FILES
 

This section allows you to access the C++ source files of the module.

 
PARENT MODULE
 

This module is part of Bpp/Graph_problem.

 
CHILD MODULES
 

The modules listed below are parts of this module.

 
INCLUDED FILES
 

The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here.

  • <bpp/graph_problem/min_cost_flow/cost_scaling.hpp>

  • <bpp/graph_problem/min_cost_flow/cycle_canceling.hpp>

  • <bpp/graph_problem/min_cost_flow/linear_system.hpp>

  • <bpp/graph_problem/min_cost_flow/random_generation.hpp>

 
INTEGRATED NAMESPACES
 

The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module.

  • graphProblemMinCostFlowAlgorithm

  • graphProblemMinCostFlowRandomGeneration

 
 
Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org).