Designar::Dijkstra< GT, Distance, Cmp, Plus > Class Template Reference

#include <graphalgorithms.H>

Public Types
using	NodeType = Node< GT >
using	ArcType = Arc< GT >

Public Member Functions
	Dijkstra (Distance &_distance, Cmp &_cmp, Plus &_plus)
	Dijkstra (Distance &&_distance=Distance(), Cmp &&_cmp=Cmp(), Plus &&_plus=Plus())
GT	build_min_path_tree (const GT &, Node< GT > *)
void	paint_min_path_tree (const GT &g, Node< GT > *start)
Path< GT >	search_min_path (const GT &g, Node< GT > *start, Node< GT > *end)
void	paint_min_path (const GT &g, Node< GT > *start, Node< GT > *end)

Member Typedef Documentation

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

using Designar::Dijkstra< GT, Distance, Cmp, Plus >::ArcType = Arc<GT>

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

using Designar::Dijkstra< GT, Distance, Cmp, Plus >::NodeType = Node<GT>

Constructor & Destructor Documentation

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

Designar::Dijkstra< GT, Distance, Cmp, Plus >::Dijkstra ( Distance &  _distance, Cmp &  _cmp, Plus &  _plus  )

inline

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

Designar::Dijkstra< GT, Distance, Cmp, Plus >::Dijkstra ( Distance &&  _distance = Distance(), Cmp &&  _cmp = Cmp(), Plus &&  _plus = Plus()  )

inline

Member Function Documentation

template<class GT , class Distance , class Cmp , class Plus >

GT Designar::Dijkstra< GT, Distance, Cmp, Plus >::build_min_path_tree	(	const GT &	g,
		Node< GT > *	start
	)

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

void Designar::Dijkstra< GT, Distance, Cmp, Plus >::paint_min_path ( const GT &  g, Node< GT > *  start, Node< GT > *  end  )

inline

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

void Designar::Dijkstra< GT, Distance, Cmp, Plus >::paint_min_path_tree ( const GT &  g, Node< GT > *  start  )

inline

template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>, class Plus = std::plus<typename Distance::Type>>

Path<GT> Designar::Dijkstra< GT, Distance, Cmp, Plus >::search_min_path ( const GT &  g, Node< GT > *  start, Node< GT > *  end  )

inline

---

The documentation for this class was generated from the following file:

• include/graphalgorithms.H