network_flow.hpp File Reference

This class contains a network flow graph representation and min cost flow algorithm. More...

#include "custom_set.hpp"
#include "graph.hpp"
#include "refcount.hpp"
#include <iosfwd>
#include <vector>

Include dependency graph for network_flow.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	network_flow
struct	network_flow::nf_name_t
	vertex tags More...
struct	network_flow::nf_index_t
struct	network_flow::nf_distance_t
struct	network_flow::nf_potential_t
struct	network_flow::nf_imbalance_t
struct	network_flow::nf_balance_t
struct	network_flow::nf_vertex_description_t
struct	network_flow::nf_cost_t
	edge tags More...
struct	network_flow::nf_capacity_t
struct	network_flow::nf_flow_t
struct	network_flow::nf_reduced_cost_t
struct	network_flow::nf_residual_capacity_t
struct	network_flow::nf_pseudo_flow_t
struct	network_flow::nf_edge_description_t

Macros
#define	I2S(number)   std::to_string(number)

Typedefs
using	network_flowRef = refcount< network_flow >
	refcount definition of the class More...

Detailed Description

This class contains a network flow graph representation and min cost flow algorithm.

Author

Fabrizio Castro castr.nosp@m.o.fa.nosp@m.brizi.nosp@m.o@gm.nosp@m.ail.c.nosp@m.om

Simone Froio simon.nosp@m.efro.nosp@m.io@ho.nosp@m.tmai.nosp@m.l.it

Version

$Revision:

Date

Definition in file network_flow.hpp.

Macro Definition Documentation

I2S

#define I2S

(

number

)

std::to_string(number)

Definition at line 53 of file network_flow.hpp.

Referenced by network_flow::get_edge_description(), network_flow::get_vertex_description(), and network_flow::successive_shortest_path_algorithm().

Typedef Documentation

network_flowRef

using network_flowRef = refcount<network_flow>

refcount definition of the class

Definition at line 311 of file network_flow.hpp.