Lazy shortest path search (pr_bgl::lazysp). More...

Classes
class	pr_bgl::lazysp_visitor_null
	Null visitor for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_visitor_pair< A, B >
	Pair visitor for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_fwd
	Forward selector for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_rev
	Reverse selector for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_alt
	Alternate selector for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_even
	Even selector for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_bisect
	Bisect selector for pr_bgl::lazysp. More...

class	pr_bgl::lazysp_selector_fwdexpand
	FwdExpand selector for pr_bgl::lazysp. More...

Functions
template<class Graph , class WMap , class WLazyMap , class IsEvaledMap , class IncSP , class EvalStrategy , class LazySPVisitor >
bool	pr_bgl::lazysp (Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_start, typename boost::graph_traits< Graph >::vertex_descriptor v_goal, WMap wmap, WLazyMap wlazymap, IsEvaledMap isevaledmap, std::vector< typename boost::graph_traits< Graph >::edge_descriptor > &path, IncSP incsp, EvalStrategy evalstrategy, LazySPVisitor visitor)
	Invoke the Lazy Shortest Path graph search algorithm. More...

template<class A , class B >
lazysp_visitor_pair< A, B >	pr_bgl::make_lazysp_visitor_pair (A visA, B visB)

Detailed Description

Lazy shortest path search (pr_bgl::lazysp).

Classes