ogdf::SpannerElkinNeimanIterated< TWeight > Class Template Reference

Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerElkinNeiman algorithm up to 200 times. More...

#include <ogdf/graphalg/SpannerElkinNeiman.h>

Inheritance diagram for ogdf::SpannerElkinNeimanIterated< TWeight >:

Public Member Functions
	SpannerElkinNeimanIterated ()
Public Member Functions inherited from ogdf::SpannerIteratedWrapper< TWeight >
	SpannerIteratedWrapper (SpannerModule< TWeight > *module, int maxIterations)
	Initializes the wrapper.
int	getExecutedIterations ()
virtual bool	preconditionsOk (const GraphAttributes &GA, double stretch, std::string &error) override
Public Member Functions inherited from ogdf::SpannerModule< TWeight >
	SpannerModule ()
	Initializes a spanner module.
virtual	~SpannerModule ()
virtual ReturnType	call (const GraphAttributes &GA, double stretch, GraphCopySimple &spanner, EdgeArray< bool > &inSpanner)
	Executes the algorithm.
int64_t	getTimeNeeded ()
void	setTimelimit (int64_t milliseconds)
	Sets the timelimit for the algorithm in milliseconds.
Public Member Functions inherited from ogdf::Module
	Module ()
	Initializes a module.
virtual	~Module ()

Additional Inherited Members
Public Types inherited from ogdf::Module
enum class	ReturnType { Feasible , Optimal , NoFeasibleSolution , TimeoutFeasible , TimeoutInfeasible , Error }
	The return type of a module. More...
Static Public Member Functions inherited from ogdf::SpannerModule< TWeight >
static void	apspSpanner (const GraphAttributes &GA, const GraphCopySimple &spanner, NodeArray< NodeArray< TWeight > > &shortestPathMatrix)
	Calculates an all-pair shortest-path on spanner with the weights given by GA.
static bool	isMultiplicativeSpanner (const GraphAttributes &GA, const GraphCopySimple &spanner, double stretch)
	Validates a spanner.
Static Public Member Functions inherited from ogdf::Module
static bool	isSolution (ReturnType ret)
	Returns true iff ret indicates that the module returned a feasible solution.
Protected Member Functions inherited from ogdf::SpannerModule< TWeight >
void	assertTimeLeft ()
	Assert, that time is left.
int64_t	getTimeLeft ()
int	getWeight (const GraphAttributes &GA, edge e)
double	getWeight (const GraphAttributes &GA, edge e)
virtual void	init (const GraphAttributes &GA, double stretch, GraphCopySimple &spanner, EdgeArray< bool > &inSpanner)
	Initializes members and create an empty spanner.
bool	isTimelimitEnabled ()
Static Protected Member Functions inherited from ogdf::SpannerModule< TWeight >
static TWeight	getWeight (const GraphAttributes &GA, edge e)
Protected Attributes inherited from ogdf::SpannerModule< TWeight >
const GraphAttributes *	m_GA
EdgeArray< bool > *	m_inSpanner
GraphCopySimple *	m_spanner
double	m_stretch

Detailed Description

template<typename TWeight>
class ogdf::SpannerElkinNeimanIterated< TWeight >

Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerElkinNeiman algorithm up to 200 times.

Definition at line 295 of file SpannerElkinNeiman.h.

Constructor & Destructor Documentation

SpannerElkinNeimanIterated()

template<typename TWeight >

ogdf::SpannerElkinNeimanIterated< TWeight >::SpannerElkinNeimanIterated ( )

inline

Definition at line 297 of file SpannerElkinNeiman.h.

---

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

• include/ogdf/graphalg/SpannerElkinNeiman.h