Aleph::Max_Flow_Min_Cost_By_Network_Simplex< Net, Max_Flow_Algo > Struct Template Reference

Functor wrapper for Network Simplex algorithm. More...

#include <tpl_netcost.H>

Public Member Functions
size_t	operator() (Net &net)
	Execute the algorithm.

Detailed Description

template<class Net, template< class > class Max_Flow_Algo = Ford_Fulkerson_Maximum_Flow>
struct Aleph::Max_Flow_Min_Cost_By_Network_Simplex< Net, Max_Flow_Algo >

Functor wrapper for Network Simplex algorithm.

Template Parameters

Net	Network type.
Max_Flow_Algo	Maximum flow algorithm template.

See also

max_flow_min_cost_by_network_simplex

Definition at line 2232 of file tpl_netcost.H.

Member Function Documentation

operator()()

template<class Net , template< class > class Max_Flow_Algo = Ford_Fulkerson_Maximum_Flow>

size_t Aleph::Max_Flow_Min_Cost_By_Network_Simplex< Net, Max_Flow_Algo >::operator() ( Net &  net )

inline

Execute the algorithm.

Parameters

[in,out]

net

Network to process.

Returns

Number of simplex pivots performed.

Definition at line 2239 of file tpl_netcost.H.

References Aleph::maps().

---

The documentation for this struct was generated from the following file:

• tpl_netcost.H