dijkstra.h File Reference

#include "igl_inline.h"
#include <Eigen/Core>
#include <vector>
#include <set>
#include "dijkstra.cpp"

Go to the source code of this file.

Namespaces
namespace	igl

Functions
template<typename IndexType , typename DerivedD , typename DerivedP >
int	igl::dijkstra (const IndexType &source, const std::set< IndexType > &targets, const std::vector< std::vector< IndexType > > &VV, const std::vector< double > &weights, Eigen::PlainObjectBase< DerivedD > &min_distance, Eigen::PlainObjectBase< DerivedP > &previous)
	Dijkstra's algorithm for vertex-weighted shortest paths, with multiple targets.
template<typename IndexType , typename DerivedV , typename DerivedD , typename DerivedP >
int	igl::dijkstra (const Eigen::MatrixBase< DerivedV > &V, const std::vector< std::vector< IndexType > > &VV, const IndexType &source, const std::set< IndexType > &targets, Eigen::PlainObjectBase< DerivedD > &min_distance, Eigen::PlainObjectBase< DerivedP > &previous)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename IndexType , typename DerivedD , typename DerivedP >
int	igl::dijkstra (const IndexType &source, const std::set< IndexType > &targets, const std::vector< std::vector< IndexType > > &VV, Eigen::PlainObjectBase< DerivedD > &min_distance, Eigen::PlainObjectBase< DerivedP > &previous)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
template<typename IndexType , typename DerivedP >
void	igl::dijkstra (const IndexType &vertex, const Eigen::MatrixBase< DerivedP > &previous, std::vector< IndexType > &path)
	Backtracking after Dijkstra's algorithm, to find shortest path.