ListUGraph Class Reference
[Graph Structures]

#include <lemon/list_graph.h>

List of all members.


Detailed Description

This is a simple and fast erasable undirected graph implementation.

It conforms to the UGraph concept.

See also:
concept::UGraph.
Todo:
Snapshot, reverseEdge(), changeTarget(), changeSource(), contract() haven't been implemented yet.


Public Member Functions

void changeTarget (UEdge e, Node n)
 Changes the target of e to n.
void changeSource (UEdge e, Node n)
void contract (Node a, Node b, bool r=true)
 Contract two nodes.


Member Function Documentation

void changeTarget UEdge  e,
Node  n
[inline]
 

Changes the target of e to n

Note:
The Edge's and OutEdge's referencing the changed edge remain valid. However InEdge's are invalidated.

void changeSource UEdge  e,
Node  n
[inline]
 

Changes the source of e to n

Changes the source of e to n

Note:
The Edge's and InEdge's referencing the changed edge remain valid. However OutEdge's are invalidated.

void contract Node  a,
Node  b,
bool  r = true
[inline]
 

This function contracts two nodes.

Node b will be removed but instead of deleting its neighboring edges, they will be joined to a. The last parameter r controls whether to remove loops. true means that loops will be removed.

Note:
The Edges referencing a moved edge remain valid.


The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:42:06 2006 for LEMON by  doxygen 1.4.6