#include "WEMTools/WEMToolsIncludes.h"
#include <algorithm>

Namespaces
namespace	ml
	Main documentation file for ML users and developers.

namespace	ml::WEMShortestPath
	The WEMShortestPath namespace implements Dijkstra's shortest path algorithm for a WEM.

Macros
#define	WEM_SHORTESTPATH_TRAVERSED_BIT 15
	Shortest path traversed bit.

Typedefs
typedef std::vector< WEMNode * >	ml::WEMShortestPath::WEMNodeVector
	Internal vector holds the temporary WEMNode front nodes.

Functions
MLWEM_EXPORT void	ml::WEMShortestPath::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`.

WEMNode *	ml::WEMShortestPath::_extractMin (WEMNodeVector &R, double *&distances)
	Helper method: searches for the shortest edge in the WEMNodeVector `R`, erases the according node from `R` and returns a pointer to this node.

WEMNode *	ml::WEMShortestPath::_extractMax (double &distances, WEMPatch wemPatch)
	Helper method: searches for the node with maximal distance, and returns a pointer to this node.

void	ml::WEMShortestPath::_addToBorder (WEMNodeVector &R, WEMNode node, double distances, WEMNode **previousNodes)
	Helper method: adds all unvisited nodes to `R`, and updates the `distances` array and the `previousNodes` array.

Macro Definition Documentation

◆ WEM_SHORTESTPATH_TRAVERSED_BIT

#define WEM_SHORTESTPATH_TRAVERSED_BIT 15

Shortest path traversed bit.

Definition at line 22 of file WEMShortestPath.h.