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

#include <graphalgorithms.H>

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

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::BellmanFord< GT, Distance, Cmp, Plus >::BellmanFord ( 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::BellmanFord< GT, Distance, Cmp, Plus >::BellmanFord ( Distance &&  _distance = Distance(), Cmp &&  _cmp = Cmp(), Plus &&  _plus = Plus()  )

inline

Member Function Documentation

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

std::tuple< bool, GT > Designar::BellmanFord< 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>>

bool Designar::BellmanFord< 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>>

bool Designar::BellmanFord< 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>>

std::tuple<bool, Path<GT> > Designar::BellmanFord< 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