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.
Files | |
file | path.h |
Classes for representing paths in graphs. | |
file | path_utils.h |
Classes for representing paths in graphs. | |
Classes | |
class | Path |
A structure for representing directed paths in a graph. More... | |
class | SimplePath |
A structure for representing directed paths in a graph. More... | |
class | ListPath |
A structure for representing directed paths in a graph. More... | |
class | StaticPath |
A structure for representing directed paths in a graph. More... |