ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges Struct Reference

Add edges into a blowup graph and delete them on destruction. More...

Inheritance diagram for ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges:

Public Member Functions
	TemporaryEdges (BlowupGraph< T > &blowupGraph)
	Construct object for a specific blowupGraph. More...
	~TemporaryEdges ()
	Remove the edges again. More...
edge	add (node v, node w, T cost, int capacity)
	Add a temporary edge to the blowup graph. More...
Public Member Functions inherited from ogdf::ArrayBuffer< edge >
	ArrayBuffer ()
	Creates an empty array buffer, without initial memory allocation. More...
	ArrayBuffer (ArrayBuffer< edge, int > &&buffer)
	Creates an array buffer containing the elements of buffer (move semantics). More...
	ArrayBuffer (const Array< edge, int > &source, bool autogrow=true)
	Creates an array buffer, initialized by the given array; you may specify that the array should not grow. More...
	ArrayBuffer (const ArrayBuffer< edge, int > &buffer)
	Creates an array buffer that is a copy of buffer. More...
	ArrayBuffer (int size, bool autogrow=true)
	Creates an empty array buffer, allocating memory for up to size elements; you may specify that the array should not grow automatically. More...
void	clear ()
	Clears the buffer. More...
bool	isGrowable () const
	Returns whether the buffer will automatically expand if the initial size is insufficient. More...
void	leftShift (ArrayBuffer< int, int > &ind)
	Removes the components listed in the buffer ind by shifting the remaining components to the left. More...
void	setCapacity (int newCapacity)
	Changes the capacity of the buffer (independent whether the buffer is growable of not). More...
void	setGrowable (bool _growable)
	Sets the flag whether the buffer will automatically expand if the initial size is insufficient. More...
iterator	begin ()
	Returns an iterator to the first element. More...
const_iterator	begin () const
	Returns a const iterator to the first element. More...
iterator	end ()
	Returns an iterator to one past the last element. More...
const_iterator	end () const
	Returns a const iterator to one past the last element. More...
reverse_iterator	rbegin ()
	Returns a reverse iterator to the last element. More...
const_reverse_iterator	rbegin () const
	Returns a const reverse iterator to the last element. More...
reverse_iterator	rend ()
	Returns a reverse iterator to one before the first element. More...
const_reverse_iterator	rend () const
	Returns a const reverse iterator to one before the first element. More...
const edge &	operator[] (int i) const
	Returns a reference to the element at position i. More...
edge &	operator[] (int i)
	Returns a reference to the element at position i. More...
const edge &	top () const
	Returns the newest element of the buffer. More...
edge &	top ()
	Returns the newest element of the buffer. More...
void	push (edge e)
	Puts a new element in the buffer. More...
void	pop ()
	Removes the newest element from the buffer. More...
edge	popRet ()
	Removes the newest element from the buffer and returns it. More...
bool	empty () const
	Returns true if the buffer is empty, false otherwise. More...
bool	full () const
	Returns true iff the buffer is non-growable and filled. More...
int	size () const
	Returns number of elements in the buffer. More...
int	capacity () const
	Returns the current capacity of the datastructure. Note that this value is rather irrelevant if the array is growable. More...
void	init ()
	Reinitializes the array, clearing it, and without initial memory allocation. More...
void	init (int size)
	Reinitializes the array, clearing it, and allocating memory for up to size elements. More...
ArrayBuffer< edge, int > &	operator= (const ArrayBuffer< edge, int > &buffer)
	Assignment operator. More...
ArrayBuffer< edge, int > &	operator= (ArrayBuffer< edge, int > &&buffer)
	Assignment operator (move semantics). More...
void	compactCpycon (Array< edge, int > &A2) const
	Generates a compact copy holding the current elements. More...
void	compactCopy (Array< edge, int > &A2) const
	Generates a compact copy holding the current elements. More...
void	compactCopy (Array< edge, int > &A2) const
	Generates a compact copy holding the current elements. More...
bool	operator== (const ArrayBuffer< edge, int > &L) const
	Equality operator. More...
bool	operator!= (const ArrayBuffer< edge, int > &L) const
	Inequality operator. More...
int	linearSearch (const edge &x) const
	Performs a linear search for element x. More...
int	linearSearch (const edge &x, const COMPARER &comp) const
	Performs a linear search for element x with comparer comp. More...
void	quicksort ()
	Sorts buffer using Quicksort. More...
void	quicksort (const COMPARER &comp)
	Sorts buffer using Quicksort and a user-defined comparer comp. More...
int	binarySearch (const edge &e) const
	Performs a binary search for element e. More...
int	binarySearch (const edge &e, const COMPARER &comp) const
	Performs a binary search for element e with comparer comp. More...
void	permute (int l, int r, RNG &rng)
	Randomly permutes the subarray with index set [l..r] using random number generator rng. More...
void	permute (RNG &rng)
	Randomly permutes the array using random number generator rng. More...
void	permute (int l, int r)
	Randomly permutes the subarray with index set [l..r]. More...
void	permute ()
	Randomly permutes the array. More...

Private Attributes
BlowupGraph< T > &	m_blowupGraph

Additional Inherited Members
Public Types inherited from ogdf::ArrayBuffer< edge >
using	const_iterator = typename Array< edge, int >::const_iterator
using	const_reverse_iterator = typename Array< edge, int >::const_reverse_iterator
using	iterator = typename Array< edge, int >::iterator
using	key_type = int
using	reverse_iterator = typename Array< edge, int >::reverse_iterator
using	value_type = edge

Detailed Description

template<typename T>
struct ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges

Add edges into a blowup graph and delete them on destruction.

Definition at line 80 of file Approximation.h.

Constructor & Destructor Documentation

TemporaryEdges()

template<typename T >

ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges::TemporaryEdges ( BlowupGraph< T > &  blowupGraph )

inline

Construct object for a specific blowupGraph.

Definition at line 82 of file Approximation.h.

~TemporaryEdges()

template<typename T >

ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges::~TemporaryEdges ( )

inline

Remove the edges again.

Definition at line 92 of file Approximation.h.

Member Function Documentation

add()

template<typename T >

edge ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges::add ( node  v, node  w, T  cost, int  capacity  )

inline

Add a temporary edge to the blowup graph.

Definition at line 85 of file Approximation.h.

Member Data Documentation

m_blowupGraph

template<typename T >

BlowupGraph<T>& ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges::m_blowupGraph

private

Definition at line 95 of file Approximation.h.

---

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

• include/ogdf/graphalg/steiner_tree/goemans/Approximation.h