Functor wrapper for maximum flow minimum cost algorithm. More...

#include <tpl_netcost.H>

Public Member Functions
std::tuple< size_t, double >	operator() (Net &net, const double it_factor=0.4, const size_t step=10)
	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_Cycle_Canceling< Net, Max_Flow_Algo >

Functor wrapper for maximum flow minimum cost algorithm.

Provides a callable object interface to the cycle-canceling algorithm.

Template Parameters

Net	Network type.
Max_Flow_Algo	Maximum flow algorithm template.

See also: max_flow_min_cost_by_cycle_canceling

Definition at line 734 of file tpl_netcost.H.

Member Function Documentation

◆ operator()()

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

std::tuple< size_t, double > Aleph::Max_Flow_Min_Cost_By_Cycle_Canceling< Net, Max_Flow_Algo >::operator()	(	Net &	net,
		const double	it_factor = `0.4`,
		const size_t	step = `10`
	)

inline

Execute the algorithm.

Parameters

[in,out]	net	Network to process.
[in]	it_factor	Initial iteration factor (default: 0.4).
[in]	step	Step increment (default: 10).

Returns: Tuple of (cycles cancelled, final iteration factor).

Definition at line 743 of file tpl_netcost.H.

References Aleph::maps().

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

tpl_netcost.H

Public Member Functions

Detailed Description

Member Function Documentation

◆ operator()()