pr_bgl::lazysp_selector_sp_indicator_probability< Graph, WLazyMap, IsEvaledMap > Class Template Reference

Shortest-path indicator probability selector for pr_bgl::lazysp. More...

#include <lazysp_selector_sp_indicator_probability.h>

Public Types
typedef boost::graph_traits < Graph >::vertex_descriptor	Vertex
typedef boost::graph_traits < Graph >::edge_descriptor	Edge
typedef boost::graph_traits < Graph >::edge_iterator	EdgeIter

Public Member Functions
	lazysp_selector_sp_indicator_probability (WLazyMap w_lazy_map, IsEvaledMap is_evaled_map, int nsamps, Vertex v_start, Vertex v_goal, unsigned int seed)
void	get_to_evaluate (const Graph &g, const std::vector< std::pair< Edge, bool > > &path, std::vector< Edge > &to_evaluate)
template<class Edge , class WeightType >
void	update_notify (Edge e, WeightType e_weight_old)

Public Attributes
WLazyMap	w_lazy_map
IsEvaledMap	is_evaled_map
const int	nsamps
const Vertex	v_start
const Vertex	v_goal
boost::mt19937	rand_gen
boost::uniform_01	rand_dist
boost::variate_generator < boost::mt19937 &, boost::uniform_01<> >	rand_var

Detailed Description

template<class Graph, class WLazyMap, class IsEvaledMap>
class pr_bgl::lazysp_selector_sp_indicator_probability< Graph, WLazyMap, IsEvaledMap >

Shortest-path indicator probability selector for pr_bgl::lazysp.

This selector simply invalidates non-evaluated edges with some probability, runs a shortest-path search on the resulting graph, and scores edges based on how often they are on the resulting shortest path.

---

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

• pr_bgl/include/pr_bgl/lazysp_selector_sp_indicator_probability.h