Graph Class Reference
[Graph Structure Concepts]

---

Detailed Description

This class describes the concept of the immutable directed graphs.

Note that actual graph implementation like ListGraph or SmartGraph may have several additional functionality.

See also:

Concepts

#include <lemon/concepts/graph.h>

List of all members.

Classes
class	Edge
	Class for identifying an edge of the graph. More...
class	EdgeIt
	This iterator goes through each edge. More...
class	EdgeMap
	Read write map of the edges to type T. More...
class	InEdgeIt
	This iterator goes trough the incoming edges of a node. More...
class	Node
	Class for identifying a node of the graph. More...
class	NodeIt
	This iterator goes through each node. More...
class	NodeMap
	Read write map of the nodes to type T. More...
class	OutEdgeIt
	This iterator goes trough the outgoing edges of a node. More...
Public Member Functions
	Graph ()
Node	target (Edge) const
Node	source (Edge) const
Node	baseNode (const InEdgeIt &) const
	The base node of the iterator.
Node	runningNode (const InEdgeIt &) const
	The running node of the iterator.
Node	baseNode (const OutEdgeIt &) const
	The base node of the iterator.
Node	runningNode (const OutEdgeIt &) const
	The running node of the iterator.
Node	oppositeNode (const Node &, const Edge &) const
	The opposite node on the given edge.
Private Member Functions
	Graph (const Graph &)
void	operator= (const Graph &)

---

Constructor & Destructor Documentation

Graph

(

const Graph &

)

[inline, private]

Graphs are not copy constructible. Use GraphCopy() instead.

Graph

(

)

[inline]

Defalult constructor. Defalult constructor.

---

Member Function Documentation

void operator=

(

const Graph &

)

[inline, private]

Assignment of Graphs to another ones are not allowed. Use GraphCopy() instead.

Node target

(

Edge

)

const [inline]

Gives back the target node of an edge.

Node source

(

Edge

)

const [inline]

Gives back the source node of an edge.

Node baseNode

(

const InEdgeIt &

)

const [inline]

Gives back the base node of the iterator. It is always the target of the pointed edge.

Node runningNode

(

const InEdgeIt &

)

const [inline]

Gives back the running node of the iterator. It is always the source of the pointed edge.

Node baseNode

(

const OutEdgeIt &

)

const [inline]

Gives back the base node of the iterator. It is always the source of the pointed edge.

Node runningNode

(

const OutEdgeIt &

)

const [inline]

Gives back the running node of the iterator. It is always the target of the pointed edge.

Node oppositeNode	(	const Node &	,
		const Edge &
	)			const [inline]

Gives back the opposite node on the given edge.