SymListGraph Class Reference
[Graph Structures]

#include <list_graph.h>

Inheritance diagram for SymListGraph:

Inheritance graph
[legend]
Collaboration diagram for SymListGraph:

Collaboration graph
[legend]
List of all members.

Detailed Description

The purpose of this graph structure is to handle graphs having bidirectional edges. Here the function addEdge(u,v) adds a pair of oppositely directed edges. There is a new edge map type called SymEdgeMap that complements this feature by storing shared values for the edge pairs. The usual EdgeMap can be used as well.

The oppositely directed edge can also be obtained easily using lemon::SymListGraph::opposite() "opposite()" member function.

Here erase(Edge) deletes a pair of edges.

Todo:
this date structure need some reconsiderations. Maybe it should be implemented independently from ListGraph.

Definition at line 442 of file list_graph.h.

Public Member Functions

Edge addEdge (Node u, Node v)
 Adds a pair of oppositely directed edges to the graph.
void erase (Edge e)
 Removes a pair of oppositely directed edges to the graph.

Static Public Member Functions

Edge opposite (Edge e)
 The oppositely directed edge.


Member Function Documentation

Edge opposite Edge  e  )  [inline, static]
 

Returns the oppositely directed pair of the edge e. Definition at line 471 of file list_graph.h.


The documentation for this class was generated from the following file:
Generated on Thu Sep 30 12:18:37 2004 for LEMON by doxygen 1.3.8