Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

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

Detailed Description

Definition at line 40 of file KuratowskiSubdivision.h.


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