SmartUGraph Class Reference
[Graph Structures]

---

Detailed Description

This is a simple and fast undirected graph implementation. It is also quite memory efficient, but at the price that it does support only limited (only stack-like) node and edge deletions. Except from this it conforms to the UGraph concept.

It also has an important extra feature that its maps are real reference maps.

See also:

concepts::UGraph.

#include <lemon/smart_graph.h>

Inheritance diagram for SmartUGraph:

[legend]

List of all members.

Classes
class	Snapshot
	Class to make a snapshot of the graph and to restrore to it later. More...
Public Member Functions
	SmartUGraph ()
Node	addNode ()
	Add a new node to the graph.
UEdge	addEdge (const Node &s, const Node &t)
	Add a new undirected edge to the graph.
void	clear ()
	Clear the graph.
Private Member Functions
	SmartUGraph (const SmartUGraph &)
void	operator= (const SmartUGraph &)

---

Constructor & Destructor Documentation

SmartUGraph

(

const SmartUGraph &

)

[inline, private]

SmartUGraph is not copy constructible. Use UGraphCopy() instead.

SmartUGraph

(

)

[inline]

Constructor.

---

Member Function Documentation

void operator=

(

const SmartUGraph &

)

[inline, private]

Assignment of SmartUGraph to another one is not allowed. Use UGraphCopy() instead.

Node addNode

(

)

[inline]

Returns:

the new node.

Reimplemented from UGraphExtender< SmartUGraphBase >.

UEdge addEdge	(	const Node &	s,
		const Node &	t
	)			[inline]

Add a new undirected edge to the graph with node s and t.

Returns:

the new undirected edge.

Reimplemented from UGraphExtender< SmartUGraphBase >.

void clear

(

)

[inline]

Erase all the nodes and edges from the graph.

Reimplemented from UGraphExtender< SmartUGraphBase >.