#include <WEMShortestPath.h>
Public Types | |
| typedef std::vector< WEMNode * > | WEMNodeVector |
| Internal vector holds the temporary WEMNode front nodes. | |
Public Member Functions | |
| WEMShortestPath () | |
| Default constructor. | |
| ~WEMShortestPath () | |
| Default destructor. | |
Static Public Member Functions | |
| static void | shortestPath (WEMPatch *wemPatch, WEMNode *startNode, WEMNode *destNode, std::vector< unsigned int > &pathNodesEntryNumbers) |
Computes the shortest path along edges of the wemPatch, from the startNode to the destNode. | |
If a start and a destination node is given, the shortest path is returned as a vector of the entry numbers of the nodes on the shortest path (including the start and destination node). Running time is O(n2) in the worst case, but the algorithm terminates if the destination node is reached.
Definition at line 34 of file WEMShortestPath.h.
| typedef std::vector<WEMNode*> ml::WEMShortestPath::WEMNodeVector |
Internal vector holds the temporary WEMNode front nodes.
Definition at line 46 of file WEMShortestPath.h.
| ml::WEMShortestPath::WEMShortestPath | ( | ) |
Default constructor.
| ml::WEMShortestPath::~WEMShortestPath | ( | ) |
Default destructor.
| static void ml::WEMShortestPath::shortestPath | ( | WEMPatch * | wemPatch, | |
| WEMNode * | startNode, | |||
| WEMNode * | destNode, | |||
| std::vector< unsigned int > & | pathNodesEntryNumbers | |||
| ) | [static] |
Computes the shortest path along edges of the wemPatch, from the startNode to the destNode.
The path is stored in pathNodesEntryNumbers, as the entry numbers of visited nodes including the start node and destination node. If for destNode a NULL pointer is provided, the path to the most distant geodetic point is calculated.
1.5.8