ogdf::KuratowskiSubdivision Class Reference

#include <ogdf/planarity/KuratowskiSubdivision.h>

Inheritance diagram for ogdf::KuratowskiSubdivision:

Additional Inherited Members
Public Types inherited from ogdf::Array< List< edge > >
using	const_iterator = ArrayConstIterator< List< edge > >
	Provides a random-access iterator that can read a const element in an array.
using	const_reference = const List< edge > &
	Provides a reference to a const element stored in an array for reading and performing const operations.
using	const_reverse_iterator = ArrayConstReverseIterator< List< edge > >
	Provides a reverse random-access iterator that can read a const element in an array.
using	iterator = ArrayIterator< List< edge > >
	Provides a random-access iterator that can read or modify any element in an array.
using	reference = List< edge > &
	Provides a reference to an element stored in an array.
using	reverse_iterator = ArrayReverseIterator< List< edge > >
	Provides a reverse random-access iterator that can read or modify any element in an array.
using	value_type = List< edge >
	Represents the data type stored in an array element.
Public Member Functions inherited from ogdf::Array< List< edge > >
	Array ()
	Creates an array with empty index set.
	Array (Array< List< edge >, int > &&A)
	Creates an array containing the elements of A (move semantics).
	Array (const Array< List< edge >, int > &A)
	Creates an array that is a copy of A.
	Array (const ArrayBuffer< List< edge >, int > &A)
	Creates an array that is a copy of A. The array-size is set to be the number of elements (not the capacity) of the buffer.
	Array (int a, int b)
	Creates an array with index set [a..b].
	Array (int a, int b, const List< edge > &x)
	Creates an array with index set [a..b] and initializes each element with x.
	Array (int s)
	Creates an array with index set [0..s-1].
	Array (std::initializer_list< List< edge > > initList)
	Creates an array containing the elements in the initializer list initList.
	~Array ()
	Destruction.
int	low () const
	Returns the minimal array index.
int	high () const
	Returns the maximal array index.
int	size () const
	Returns the size (number of elements) of the array.
bool	empty () const
	Returns true iff there are no elements in the array.
const_reference	operator[] (int i) const
	Returns a reference to the element at position i.
reference	operator[] (int i)
	Returns a reference to the element at position i.
iterator	begin ()
	Returns an iterator to the first element.
const_iterator	begin () const
	Returns a const iterator to the first element.
const_iterator	cbegin () const
	Returns a const iterator to the first element.
iterator	end ()
	Returns an iterator to one past the last element.
const_iterator	end () const
	Returns a const iterator to one past the last element.
const_iterator	cend () const
	Returns a const iterator to one past the last element.
reverse_iterator	rbegin ()
	Returns an reverse iterator to the last element.
const_reverse_iterator	rbegin () const
	Returns a const reverse iterator to the last element.
const_reverse_iterator	crbegin () const
	Returns a const reverse iterator to the last element.
reverse_iterator	rend ()
	Returns an reverse iterator to one before the first element.
const_reverse_iterator	rend () const
	Returns a const reverse iterator to one before the first element.
const_reverse_iterator	crend () const
	Returns a const reverse iterator to one before the first element.
void	init ()
	Reinitializes the array to an array with empty index set.
void	init (int s)
	Reinitializes the array to an array with index set [0..s-1].
void	init (int a, int b)
	Reinitializes the array to an array with index set [a..b].
void	init (int a, int b, const List< edge > &x)
	Reinitializes the array to an array with index set [a..b] and sets all entries to x.
void	fill (const List< edge > &x)
	Sets all elements to x.
void	fill (int i, int j, const List< edge > &x)
	Sets elements in the intervall [i..j] to x.
void	grow (int add, const List< edge > &x)
	Enlarges the array by add elements and sets new elements to x.
void	grow (int add)
	Enlarges the array by add elements.
void	resize (int newSize, const List< edge > &x)
	Resizes (enlarges or shrinks) the array to hold newSize elements and sets new elements to x.
void	resize (int newSize)
	Resizes (enlarges or shrinks) the array to hold newSize elements.
Array< List< edge >, int > &	operator= (const Array< List< edge >, int > &A)
	Assignment operator.
Array< List< edge >, int > &	operator= (Array< List< edge >, int > &&A)
	Assignment operator (move semantics).
bool	operator== (const Array< List< edge >, int > &L) const
	Equality operator.
bool	operator!= (const Array< List< edge >, int > &L) const
	Inequality operator.
void	swap (int i, int j)
	Swaps the elements at position i and j.
void	permute (int l, int r)
	Randomly permutes the subarray with index set [l..r].
void	permute ()
	Randomly permutes the array.
void	permute (int l, int r, RNG &rng)
	Randomly permutes the subarray with index set [l..r] using random number generator rng.
void	permute (RNG &rng)
	Randomly permutes the array using random number generator rng.
int	binarySearch (const List< edge > &e) const
	Performs a binary search for element e.
int	binarySearch (int l, int r, const List< edge > &e) const
	Performs a binary search for element e within the array section [l, ..., r] .
int	binarySearch (const List< edge > &e, const COMPARER &comp) const
	Performs a binary search for element e with comparer comp.
int	binarySearch (int l, int r, const List< edge > &e, const COMPARER &comp) const
	Performs a binary search for element e within the array section [l, ..., r] with comparer comp.
int	linearSearch (const List< edge > &e) const
	Performs a linear search for element e.
int	linearSearch (const List< edge > &e, const COMPARER &comp) const
	Performs a linear search for element e with comparer comp.
void	quicksort ()
	Sorts array using Quicksort.
void	quicksort (int l, int r)
	Sorts subarray with index set [l, ..., r] using Quicksort.
void	quicksort (const COMPARER &comp)
	Sorts array using Quicksort and a user-defined comparer comp.
void	quicksort (int l, int r, const COMPARER &comp)
	Sorts the subarray with index set [l, ..., r] using Quicksort and a user-defined comparer comp.
void	leftShift (ArrayBuffer< int, int > &ind)
	Removes the components listed in ind by shifting the remaining components to the left.
void	leftShift (ArrayBuffer< int, int > &ind, const List< edge > &val)
	Removes the components listed in ind by shifting the remaining components to the left.
Static Public Attributes inherited from ogdf::Array< List< edge > >
static const int	maxSizeInsertionSort
	Threshold used by quicksort() such that insertion sort is called for instances smaller than maxSizeInsertionSort.

Detailed Description

Definition at line 39 of file KuratowskiSubdivision.h.

---

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

• include/ogdf/planarity/KuratowskiSubdivision.h