43 namespace ompl
54 AdjacencyList(int n);
87 // Returns the weight of the edge between vertices v1 and v2. An exception is thrown when the edge does not exist
101 // Dijkstra's shortest path search from v1 to v2. If a path exists, the solution is stored in path and true is returned.
104 // Dijkstra's shortest path search starting from v1. The predecessors of each node are stored in predecessors.
106 // The total distance from vtx to each node is stored in distance. A value of double::max() indicates an unreachable node.