SymSmartGraph Class Reference
[Graph Structures]

#include <smart_graph.h>

Inheritance diagram for SymSmartGraph:

Inheritance graph
[legend]
Collaboration diagram for SymSmartGraph:

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 opposite.

Warning:
It shares the similarity with SmartGraph that it is not possible to delete edges or nodes from the graph.

Definition at line 321 of file smart_graph.h.

Public Member Functions

Edge addEdge (Node u, Node v)
 Adds 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 348 of file smart_graph.h.


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