Dijkstra.h File Reference

#include <Geometry.h>
#include <Triangulation.h>
#include <array>
#include <functional>
#include <limits>
#include <queue>

Go to the source code of this file.

Namespaces
namespace	ttk
	The Topology ToolKit.
namespace	ttk::Dijkstra

Functions
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.