Path Structures
[Data Structures]

---

Detailed Description

This group describes the path structures implemented in LEMON.

LEMON provides flexible data structures to work with paths. All of them have similar interfaces and they can be copied easily with assignment operators and copy constructors. This makes it easy and efficient to have e.g. the Dijkstra algorithm to store its result in any kind of path structure.

See also:

lemon::concepts::Path

Classes
class	Path< _Graph >
	A structure for representing directed paths in a graph. More...
class	SimplePath< _Graph >
	A structure for representing directed paths in a graph. More...
class	ListPath< _Graph >
	A structure for representing directed paths in a graph. More...
class	StaticPath< _Graph >
	A structure for representing directed paths in a graph. More...
Files
file	path.h
	Classes for representing paths in graphs.
file	path_utils.h
	Classes for representing paths in graphs.