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.
Files | |
file | path.h |
Classes for representing paths in graphs. | |
Classes | |
class | DirPath |
A structure for representing directed paths in a graph. More... | |
class | UndirPath |
A structure for representing undirected path in a graph. More... |