SmartBpUGraph Class Reference
[Graph Structures]

---

Detailed Description

This is a simple and fast bipartite undirected graph implementation. It is also quite memory efficient, but at the price that it does not support node and edge deletions. Except from this it conforms to the BpUGraph concept.

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

See also:

concepts::BpUGraph.

#include <lemon/smart_graph.h>

Inheritance diagram for SmartBpUGraph:

[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
	SmartBpUGraph ()
Node	addANode ()
	Add a new ANode to the graph.
Node	addBNode ()
	Add a new BNode 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
	SmartBpUGraph (const SmartBpUGraph &)
void	operator= (const SmartBpUGraph &)

---

Constructor & Destructor Documentation

SmartBpUGraph

(

const SmartBpUGraph &

)

[inline, private]

SmartBpUGraph is not copy constructible.

SmartBpUGraph

(

)

[inline]

Constructor.

---

Member Function Documentation

void operator=

(

const SmartBpUGraph &

)

[inline, private]

Assignment of SmartBpUGraph to another one is not allowed.

Node addANode

(

)

[inline]

Returns:

the new node.

Reimplemented from BpUGraphExtender< BidirBpUGraphExtender< SmartBpUGraphBase > >.

Node addBNode

(

)

[inline]

Returns:

the new node.

Reimplemented from BpUGraphExtender< BidirBpUGraphExtender< SmartBpUGraphBase > >.

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 BpUGraphExtender< BidirBpUGraphExtender< SmartBpUGraphBase > >.

void clear

(

)

[inline]

Erase all the nodes and edges from the graph.

Reimplemented from BpUGraphExtender< BidirBpUGraphExtender< SmartBpUGraphBase > >.