pr_bgl::lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction > Class Template Reference

Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp. More...

#include <lazysp_incsp_dijkstra.h>

Classes
class	throw_visitor
struct	throw_visitor_exception

Public Types
typedef boost::graph_traits < Graph >::vertex_descriptor	Vertex
typedef boost::graph_traits < Graph >::edge_descriptor	Edge
typedef boost::property_traits < DistanceMap >::value_type	weight_type

Public Member Functions
	lazysp_incsp_dijkstra (PredecessorMap predecessor_map, DistanceMap distance_map, CompareFunction compare, CombineFunction combine, weight_type inf, weight_type zero)
template<typename WMap >
weight_type	solve (const Graph &g, Vertex v_start, Vertex v_goal, WMap wmap, std::vector< Edge > &path)
void	update_notify (Edge e)

Public Attributes
PredecessorMap	predecessor_map
DistanceMap	distance_map
CompareFunction	compare
CombineFunction	combine
weight_type	inf
weight_type	zero

Detailed Description

template<class Graph, class PredecessorMap, class DistanceMap, typename CompareFunction, typename CombineFunction>
class pr_bgl::lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction >

Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp.

solve returns weight_type::max if a non-infinite path is found

solve is always called with the same g,v_start,v_goal

---

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

• pr_bgl/include/pr_bgl/lazysp_incsp_dijkstra.h