An implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solve the min-cut problem. More...

#include <graph.h>

Collaboration diagram for delphos::MinCutGraph:

Public Member Functions
	MinCutGraph (const FinalPitInstance &fpi, string value_attr)
	Creates a new graph based on a given instance. More...

	MinCutGraph (const FinalPitInstance &fpi, string value_attr, const double &angle, const unsigned int &nblevel)
	Creates a new graph based on a given instance. More...

	~MinCutGraph ()
	Destructor.

bool	PseudoFlow ()
	Implementation of the Pseudoflow algorithm.

BlockSelection *	GetMinCutRootSet ()
	Retrieves the minimum cut root set that corresponds to final pit set.

Detailed Description

An implementation of the graph used by the final pit solver based on the Pseudoflow algorithm to solve the min-cut problem.

Constructor & Destructor Documentation

delphos::MinCutGraph::MinCutGraph	(	const FinalPitInstance &	fpi,
		string	value_attr
	)

Creates a new graph based on a given instance.

Parameters

fpi	An instance of the final pit problem to be solved.
value_attr	The name of the valorization column in the block model used to compute final pit.

delphos::MinCutGraph::MinCutGraph	(	const FinalPitInstance &	fpi,
		string	value_attr,
		const double &	angle,
		const unsigned int &	nblevel
	)

Creates a new graph based on a given instance.

Parameters

fpi	An instance of the final pit problem to be solved.
value_attr	The name of the valorization column in the block model used to compute final pit.
angle	The slope angle of the precedence.
nblevel	The number of bench of slope precedence.

The documentation for this class was generated from the following files:

/home/gmorales/dev/MineLink/BlockScheduling/core/trunk/solvers/finalpit/graph.h
/home/gmorales/dev/MineLink/BlockScheduling/core/trunk/solvers/finalpit/graph.cpp