SCIL::KCONNECTED< Graph > Class Template Reference

The symbolic constraint for k-edge connected subgraphs.

#include <kconnected.h>

Inheritance diagram for SCIL::KCONNECTED< Graph >:

[legend]

Collaboration diagram for SCIL::KCONNECTED< Graph >:

[legend]

List of all members.

Public Member Functions
	KCONNECTED (Graph &G_, var_map< edge_descriptor > &VM_, int k_)
	Constructor.
void	init (subproblem &S)
	Adds static constraint r >= k.
int	cutTreeSeparation (solution &sol, std::list< cons_obj * > &newCons)
status	standard_separation (subproblem &S)
status	feasible (solution &S)
void	info ()

Detailed Description

template<typename Graph>
class SCIL::KCONNECTED< Graph >

Definition at line 30 of file kconnected.h.

Member Function Documentation

template<typename Graph >

int SCIL::KCONNECTED< Graph >::cutTreeSeparation	(	solution &	sol,
		std::list< cons_obj * > &	newCons
	)

Separates the cut constraints using a cut tree

Referenced by SCIL::KCONNECTED< Graph >::standard_separation().

template<typename Graph >

KCONNECTED< Graph >::status KCONNECTED::feasible ( solution & ) [inline, virtual]

This function is called, if the BCP-System wants to save the solution of the LP-solver as primal solution. If this function if called, it is guaranteed that all interal variabes have integral values in the LP-solution. The function should return either feasible or infeasible. It could also return fathom, preemtion, exception_branch or resolve_immedialtely.

Reimplemented from SCIL::sym_constraint.

Definition at line 67 of file kconnected.cc.

References SCIL::subproblem::configuration(), SCIL::MIN_CUT< Graph >::run(), and SCIL::solution::value().

template<typename Graph >

void KCONNECTED::info ( ) [inline, virtual]

Returns information on the symbolic constraints.

Reimplemented from SCIL::sym_constraint.

Definition at line 188 of file kconnected.cc.

template<typename Graph >

KCONNECTED< Graph >::status KCONNECTED::standard_separation ( subproblem & S ) [inline, virtual]