ogdf::GraphList< T > Class Template Reference

Lists of graph objects (like nodes, edges, etc.). More...

#include <ogdf/basic/Graph_d.h>

Inheritance diagram for ogdf::GraphList< T >:

List of all members.

Public Member Functions
	GraphList ()
	Constructs an empty list.
	~GraphList ()
T *	begin () const
	Returns the first element in the list.
void	clear ()
	Removes all elements from the list and deletes them.
bool	consistencyCheck ()
	Checks consistency of graph list; returns true if ok.
void	del (T *pX)
	Removes element pX from the list and deletes it.
void	delPure (T *pX)
	Only removes element pX from the list; does not delete it.
bool	empty ()
	Returns true iff the list is empty.
void	insertAfter (T *pX, T *pY)
	Inserts element pX after element pY.
void	insertBefore (T *pX, T *pY)
	Inserts element pX before element pY.
void	move (T *pX, GraphList< T > &L, T *pY, Direction dir)
	Moves element pX to list L and inserts it before or after pY.
void	move (T *pX, GraphList< T > &L)
	Moves element pX to list L and inserts it at the end.
void	moveAfter (T *pX, T *pY)
	Moves element pX from its current position to a position after pY.
void	moveBefore (T *pX, T *pY)
	Moves element pX from its current position to a position before pY.
void	pushBack (T *pX)
	Adds element pX at the end of the list.
T *	rbegin () const
	Returns the last element in the list.
void	reverse ()
	Reverses the order of the list elements.
template<class T_LIST >
void	sort (const T_LIST &newOrder)
	Sorts all elements according to newOrder.
void	swap (T *pX, T *pY)
	Exchanges the positions of pX and pY in the list.

Additional Inherited Members
Protected Member Functions inherited from ogdf::GraphListBase
	GraphListBase ()
	Constructs an empty list.
	~GraphListBase ()
void	del (GraphElement *pX)
	Removes element pX from the list.
void	insertAfter (GraphElement *pX, GraphElement *pY)
	Inserts element pX after element pY.
void	insertBefore (GraphElement *pX, GraphElement *pY)
	Inserts element pX before element pY.
void	pushBack (GraphElement *pX)
	Adds element pX at the end of the list.
template<class LIST >
void	sort (const LIST &newOrder)
	Sorts the list according to newOrder.
void	swap (GraphElement *pX, GraphElement *pY)
	Exchanges the positions of pX and pY in the list.

---

Detailed Description

template<class T>
class ogdf::GraphList< T >

Lists of graph objects (like nodes, edges, etc.).

The template type T must be a class derived from GraphElement.

Definition at line 257 of file Graph_d.h.

---

Constructor & Destructor Documentation

template<class T>

ogdf::GraphList< T >::GraphList ( )

inline

Constructs an empty list.

Definition at line 260 of file Graph_d.h.

template<class T>

ogdf::GraphList< T >::~GraphList ( )

inline

Definition at line 262 of file Graph_d.h.

---

Member Function Documentation

template<class T>

T* ogdf::GraphList< T >::begin ( ) const

inline

Returns the first element in the list.

Definition at line 268 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::clear ( )

inline

Removes all elements from the list and deletes them.

Definition at line 329 of file Graph_d.h.

template<class T>

bool ogdf::GraphList< T >::consistencyCheck ( )

inline

Checks consistency of graph list; returns true if ok.

Reimplemented from ogdf::GraphListBase.

Definition at line 355 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::del ( T *  pX )

inline

Removes element pX from the list and deletes it.

Definition at line 318 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::delPure ( T *  pX )

inline

Only removes element pX from the list; does not delete it.

Definition at line 324 of file Graph_d.h.

template<class T>

bool ogdf::GraphList< T >::empty ( )

inline

Returns true iff the list is empty.

Definition at line 273 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::insertAfter ( T *  pX, T *  pY  )

inline

Inserts element pX after element pY.

Definition at line 281 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::insertBefore ( T *  pX, T *  pY  )

inline

Inserts element pX before element pY.

Definition at line 286 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::move ( T *  pX, GraphList< T > &  L, T *  pY, Direction  dir  )

inline

Moves element pX to list L and inserts it before or after pY.

Definition at line 291 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::move ( T *  pX, GraphList< T > &  L  )

inline

Moves element pX to list L and inserts it at the end.

Definition at line 300 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::moveAfter ( T *  pX, T *  pY  )

inline

Moves element pX from its current position to a position after pY.

Definition at line 306 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::moveBefore ( T *  pX, T *  pY  )

inline

Moves element pX from its current position to a position before pY.

Definition at line 312 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::pushBack ( T *  pX )

inline

Adds element pX at the end of the list.

Definition at line 276 of file Graph_d.h.

template<class T>

T* ogdf::GraphList< T >::rbegin ( ) const

inline

Returns the last element in the list.

Definition at line 270 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::reverse ( )

inline

Reverses the order of the list elements.

Reimplemented from ogdf::GraphListBase.

Definition at line 344 of file Graph_d.h.

template<class T>

template<class T_LIST >

void ogdf::GraphList< T >::sort ( const T_LIST &  newOrder )

inline

Sorts all elements according to newOrder.

Definition at line 338 of file Graph_d.h.

template<class T>

void ogdf::GraphList< T >::swap ( T *  pX, T *  pY  )

inline

Exchanges the positions of pX and pY in the list.

Definition at line 349 of file Graph_d.h.

---

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

• ogdf/basic/Graph_d.h