Open Graph Drawing Framework  v.2007.11

Overview Class Hierarchy Class Index Class List Members Namespaces Source Files Search for:

ogdf::NodeElement Class Reference

Class for the representation of nodes. More...

#include <Graph_d.h>

Inheritance diagram for ogdf::NodeElement:

List of all members.

Public Member Functions
int	index () const
	Returns the (unique) node index.
int	indeg () const
	Returns the indegree of the node.
int	outdeg () const
	Returns the outdegree of the node.
int	degree () const
	Returns the degree of the node (indegree + outdegree).
adjEntry	firstAdj () const
	Returns the first entry in the adjaceny list.
adjEntry	lastAdj () const
	Returns the last entry in the adjacency list.
node	succ () const
	Returns the successor in the list of all nodes.
node	pred () const
	Returns the predecessor in the list of all nodes.
void *	operator new (size_t nBytes)
void *	operator new (size_t, void *p)
void	operator delete (void *p, size_t nBytes)
Private Member Functions
	NodeElement (int id)
Private Attributes
GraphList< AdjElement >	m_adjEdges
	The adjacency list of the node.
int	m_indeg
	The indegree of the node.
int	m_outdeg
	The outdegree of the node.
int	m_id
	The (unique) index of the node.
Friends
class	Graph
class	GraphList< NodeElement >

---

Detailed Description

Class for the representation of nodes.

Definition at line 451 of file Graph_d.h.

---

Constructor & Destructor Documentation

ogdf::NodeElement::NodeElement

(

int

id

)

[inline, private]

Definition at line 477 of file Graph_d.h.

---

Member Function Documentation

int ogdf::NodeElement::index

(

)

const [inline]

Returns the (unique) node index.

Definition at line 483 of file Graph_d.h.

int ogdf::NodeElement::indeg

(

)

const [inline]

Returns the indegree of the node.

Definition at line 486 of file Graph_d.h.

int ogdf::NodeElement::outdeg

(

)

const [inline]

Returns the outdegree of the node.

Definition at line 488 of file Graph_d.h.

int ogdf::NodeElement::degree

(

)

const [inline]

Returns the degree of the node (indegree + outdegree).

Definition at line 490 of file Graph_d.h.

adjEntry ogdf::NodeElement::firstAdj

(

)

const [inline]

Returns the first entry in the adjaceny list.

Definition at line 493 of file Graph_d.h.

adjEntry ogdf::NodeElement::lastAdj

(

)

const [inline]

Returns the last entry in the adjacency list.

Definition at line 495 of file Graph_d.h.

node ogdf::NodeElement::succ

(

)

const [inline]

Returns the successor in the list of all nodes.

Definition at line 498 of file Graph_d.h.

node ogdf::NodeElement::pred

(

)

const [inline]

Returns the predecessor in the list of all nodes.

Definition at line 500 of file Graph_d.h.

void* ogdf::NodeElement::operator new

(

size_t

nBytes

)

[inline]

Reimplemented from ogdf::GraphElement.

Definition at line 507 of file Graph_d.h.

void* ogdf::NodeElement::operator new	(	size_t	,
		void *	p
	)			[inline]

Reimplemented from ogdf::GraphElement.

Definition at line 507 of file Graph_d.h.

void ogdf::NodeElement::operator delete	(	void *	p,
		size_t	nBytes
	)			[inline]

Reimplemented from ogdf::GraphElement.

Definition at line 507 of file Graph_d.h.

---

Friends And Related Function Documentation

friend class Graph [friend]

Reimplemented from ogdf::GraphElement.

Definition at line 452 of file Graph_d.h.

friend class GraphList< NodeElement > [friend]

Definition at line 453 of file Graph_d.h.

---

Member Data Documentation

GraphList<AdjElement> ogdf::NodeElement::m_adjEdges [private]

The adjacency list of the node.

Definition at line 455 of file Graph_d.h.

int ogdf::NodeElement::m_indeg [private]

The indegree of the node.

Definition at line 456 of file Graph_d.h.

int ogdf::NodeElement::m_outdeg [private]

The outdegree of the node.

Definition at line 457 of file Graph_d.h.

int ogdf::NodeElement::m_id [private]

The (unique) index of the node.

Definition at line 458 of file Graph_d.h.

---

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

• ogdf/basic/Graph_d.h

---