Template Function lvr2::Dijkstra

Function Documentation

template<typename BaseVecT>
bool lvr2::Dijkstra(const BaseMesh<BaseVecT> &mesh, const VertexHandle &start, const VertexHandle &goal, const DenseEdgeMap<float> &edgeCosts, std::list<VertexHandle> &path, DenseVertexMap<float> &distances, DenseVertexMap<VertexHandle> &predecessors, DenseVertexMap<bool> &seen, DenseVertexMap<float> &vertex_costs)

Dijkstra’s algorithm.

Parameters:

  • mesh – The mesh containing the vertices and edges of interest

  • start – Start vertex

  • goal – Goal vertex

  • path – Resulted path from search

Returns:

true if a path between start and goals exists