![]() |
digiKam Developer Documentation
Professional Photo Management with the Power of Open Source
|
Helper class to find paths through the graph. More...
Public Member Functions | |
| bool | isReachable (const Vertex &v) const |
| template<class GraphType > | |
| void | longestPath (const GraphType &graph, const Vertex &v) |
| template<class GraphType > | |
| void | shortestPath (const GraphType &graph, const Vertex &v) |
Public Attributes | |
| VertexIntMap | distances |
| VertexVertexMap | predecessors |
Call one of the methods and then read the maps.
|
inline |
We provide a constant weight of 1.
Invert the default compare method: With greater, we get the longest path.
Will be returned if a node is unreachable.
Store distance and predecessors in QMaps, wrapped to serve as property maps.
|
inline |
we provide a constant weight of 1.
Store distance and predecessors in QMaps, wrapped to serve as property maps.