Path Structures
[Data Structures]


Detailed Description

LEMON provides flexible data structures to work with paths.

All of them have the same interface, especially they can be built or extended using a standard Builder subclass. This make is easy to have e.g. the Dijkstra algorithm to store its result in any kind of path structure.

See also:
lemon::skeleton::Path


Files

file  path.h
 Classes for representing paths in graphs.

Classes

class  DirPath
 A structure for representing directed paths in a graph. More...
class  DirPath::EdgeIt
 Iterator class to iterate on the edges of the paths. More...
class  DirPath::NodeIt
 Iterator class to iterate on the nodes of the paths. More...
class  DirPath::Builder
 Class to build paths. More...
class  UndirPath
 A structure for representing undirected path in a graph. More...
class  UndirPath::EdgeIt
 Iterator class to iterate on the edges of the paths. More...
class  UndirPath::NodeIt
 Iterator class to iterate on the nodes of the paths. More...
class  UndirPath::Builder
 Class to build paths. More...


Generated on Thu Sep 30 12:18:36 2004 for LEMON by doxygen 1.3.8