ttk::Dijkstra Namespace Reference

Functions
template<typename T , typename triangulationType = ttk::AbstractTriangulation>
int	shortestPath (const SimplexId source, const triangulationType &triangulation, std::vector< T > &outputDists, const std::vector< SimplexId > &bounds=std::vector< SimplexId >(), const std::vector< bool > &mask=std::vector< bool >())
	Compute the Dijkstra shortest path from source.

Function Documentation

shortestPath()

template<typename T , typename triangulationType = ttk::AbstractTriangulation>

int ttk::Dijkstra::shortestPath	(	const SimplexId	source,
		const triangulationType &	triangulation,
		std::vector< T > &	outputDists,
		const std::vector< SimplexId > &	bounds = std::vector<SimplexId>(),
		const std::vector< bool > &	mask = std::vector<bool>()
	)

Compute the Dijkstra shortest path from source.

Parameters

[in]	source	Source vertex for the Dijkstra algorithm
[in]	triangulation	Access to neighbor vertices
[out]	outputDists	Distances to source for every mesh vertex
[in]	bounds	Stop the algorithm if all vertices are reached
[in]	mask	Vector masking the triangulation

Returns

0 in case of success

Definition at line 26 of file Dijkstra.h.