FullGraph Class Reference
[Graph Structures]

---

Detailed Description

This is a simple and fast directed full graph implementation. It is completely static, so you can neither add nor delete either edges or nodes. Thus it conforms to the Graph concept and it also has an important extra feature that its maps are real reference maps.

See also:

concepts::Graph.

FullUGraph

Author:

Alpar Juttner

#include <lemon/full_graph.h>

Inheritance diagram for FullGraph:

[legend]

List of all members.

Public Member Functions
	FullGraph ()
	Constructor.
	FullGraph (int n)
	Constructor.
void	resize (int n)
	Resize the graph.
Node	operator() (int ix) const
	Returns the node with the given index.
int	index (const Node &node) const
	Returns the index of the node.
Edge	edge (const Node &u, const Node &v) const
int	nodeNum () const
	Number of nodes.
int	edgeNum () const
	Number of edges.

---

Member Function Documentation

void resize

(

int

n

)

[inline]

Resize the graph. The function will fully destroy and build the graph. This cause that the maps of the graph will reallocated automatically and the previous values will be lost.

Node operator()

(

int

ix

)

const [inline]

Returns the node with the given index. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to nodeNum()-1 and the index of the node can accessed by the index() member.

int index

(

const Node &

node

)

const [inline]

Returns the index of the node. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to nodeNum()-1 and the index of the node can accessed by the index() member.

Edge edge	(	const Node &	u,
		const Node &	v
	)			const [inline]

Returns the edge connects the given nodes.