#include <ogdf/basic/GraphList.h>

Inheritance diagram for ogdf::internal::GraphObjectContainer< GraphObject >:

Public Types
using	iterator = GraphIterator< GraphObject * >
	Provides a bidirectional iterator to an object in the container.

using	reverse_iterator = GraphReverseIterator< GraphObject * >
	Provides a bidirectional reverse iterator to an object in the container.

using	value_type = GraphObject *
	The value type (a pointer to a specific graph object)

Public Member Functions
iterator	begin () const
	Returns an iterator to the first element in the container.

iterator	end () const
	Returns an iterator to the one-past-last element in the container.

reverse_iterator	rbegin () const
	Returns a reverse iterator to the last element in the container.

reverse_iterator	rend () const
	Returns a reverse iterator to the one-before-first element in the container.

Friends
class	ogdf::ClusterGraph

class	ogdf::CombinatorialEmbedding

class	ogdf::ConstCombinatorialEmbedding

class	ogdf::Graph

Additional Inherited Members
Private Member Functions inherited from ogdf::internal::GraphList< GraphObject >
	GraphList ()
	Constructs an empty list.

	~GraphList ()
	Destruction: deletes all elements.

void	clear ()
	Removes all elements from the list and deletes them.

void	del (GraphObject *pX)
	Removes element `pX` from the list and deletes it.

void	delPure (GraphObject *pX)
	Only removes element `pX` from the list; does not delete it.

bool	empty () const
	Returns true iff the list is empty.

GraphObject *	head () const
	Returns the first element in the list.

void	insertAfter (GraphObject pX, GraphObject pY)
	Inserts element `pX` after element `pY`.

void	insertBefore (GraphObject pX, GraphObject pY)
	Inserts element `pX` before element `pY`.

void	move (GraphObject *pX, GraphList< GraphObject > &L)
	Moves element `pX` to list `L` and inserts it at the end.

void	move (GraphObject pX, GraphList< GraphObject > &L, GraphObject pY, Direction dir)
	Moves element `pX` to list `L` and inserts it before or after `pY`.

void	moveAfter (GraphObject pX, GraphObject pY)
	Moves element `pX` from its current position to a position after `pY`.

void	moveBefore (GraphObject pX, GraphObject pY)
	Moves element `pX` from its current position to a position before `pY`.

void	permute ()
	Permutes all list elements.

void	permute (RNG &rng)
	Permutes all list elements.

void	pushBack (GraphObject *pX)
	Adds element `pX` at the end of the list.

void	reverse ()
	Reverses the order of the list elements.

int	size () const
	Returns the size of the list.

void	sort (const T_LIST &newOrder)
	Sorts all elements according to `newOrder`.

void	swap (GraphObject pX, GraphObject pY)
	Exchanges the positions of `pX` and `pY` in the list.

GraphObject *	tail () const
	Returns the last element in the list.