StaticGraph Class Reference
[Skeletons]

#include <graph.h>

Inheritance diagram for StaticGraph:

Inheritance graph
[legend]
List of all members.

Detailed Description

This class provides all the common features of a graph structure, however completely without implementations and real data structures behind the interface. All graph algorithms should compile with this class, but it will not run properly, of course.

It can be used for checking the interface compatibility, or it can serve as a skeleton of a new graph structure.

Also, you will find here the full documentation of a certain graph feature, the documentation of a real graph imlementation like ListGraph or SmartGraph will just refer to this structure.

Definition at line 48 of file graph.h.

Public Member Functions

 StaticGraph ()
 Defalult constructor.
NodeItfirst (NodeIt &i) const
 First node of the graph.
InEdgeItfirst (InEdgeIt &i, Node) const
 The first incoming edge.
OutEdgeItfirst (OutEdgeIt &i, Node) const
 The first outgoing edge.
EdgeItfirst (EdgeIt &i) const
 The first edge of the Graph.
Node head (Edge) const
 Gives back the head node of an edge.
Node tail (Edge) const
 Gives back the tail node of an edge.
int id (const Node &) const
 Gives back the id of a node.
int id (const Edge &) const
 Gives back the id of an edge.
int nodeNum () const
 
int edgeNum () const
 


Constructor & Destructor Documentation

StaticGraph  )  [inline]
 

Defalult constructor. Definition at line 55 of file graph.h.


Member Function Documentation

NodeIt& first NodeIt i  )  const [inline]
 

Return values:
i the first node.
Returns:
the first node.
Definition at line 343 of file graph.h.

InEdgeIt& first InEdgeIt i,
Node 
const [inline]
 

The first incoming edge. Definition at line 349 of file graph.h.

OutEdgeIt& first OutEdgeIt i,
Node 
const [inline]
 

The first outgoing edge. Definition at line 354 of file graph.h.

EdgeIt& first EdgeIt i  )  const [inline]
 

The first edge of the Graph. Definition at line 359 of file graph.h.

Node head Edge   )  const [inline]
 

Gives back the head node of an edge. Definition at line 365 of file graph.h.

References lemon::INVALID.

Node tail Edge   )  const [inline]
 

Gives back the tail node of an edge. Definition at line 370 of file graph.h.

References lemon::INVALID.

int id const Node  )  const [inline]
 

Warning:
Not all graph structures provide this feature.
Todo:
Should each graph provide id?
Definition at line 377 of file graph.h.

int id const Edge  )  const [inline]
 

Warning:
Not all graph structures provide this feature.
Todo:
Should each graph provide id?
Definition at line 383 of file graph.h.

int nodeNum  )  const [inline]
 

Todo:
Should it be in the concept?
Definition at line 389 of file graph.h.

int edgeNum  )  const [inline]
 

Todo:
Should it be in the concept?
Definition at line 394 of file graph.h.


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