Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

ompl
pr_bgl
compose_property_map
edge_indexed_graph	Graph wrapper which maintains an edge index
flag_set_map	Wrapper for a readable property map which sets a flag when accessed
heap_indexed	Binary min-heap with index lookups
incbi	This class implements incremental bidirectional Dijkstra's search for the single-pair shortest path problem
conn_key
incbi_visitor_null
incbi_balancer_distance	Balance expansions to the side with the shortest distance
incbi_balancer_cardinality	Balance expansions to the side with the smallest OPEN set cardinality
lazysp_visitor_null	Null visitor for pr_bgl::lazysp
lazysp_visitor_pair	Pair visitor for pr_bgl::lazysp
lazysp_selector_fwd	Forward selector for pr_bgl::lazysp
lazysp_selector_rev	Reverse selector for pr_bgl::lazysp
lazysp_selector_alt	Alternate selector for pr_bgl::lazysp
lazysp_selector_even	Even selector for pr_bgl::lazysp
lazysp_selector_bisect	Bisect selector for pr_bgl::lazysp
lazysp_selector_fwdexpand	FwdExpand selector for pr_bgl::lazysp
lazysp_incsp_astar	Adaptor to use boost::astar_search as the inner sp algorithm for pr_bgl::lazysp
map_heuristic
throw_visitor
throw_visitor_exception
lazysp_incsp_dijkstra	Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp
throw_visitor
throw_visitor_exception
lazysp_incsp_incbi_edge_index_adaptor
lazysp_incsp_incbi	Adaptor to use pr_bgl::incbi as the inner sp algorithm for pr_bgl::lazysp
lazysp_incsp_lpastar	Adaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp
map_heuristic
lazysp_incsp_rlpastar
map_heuristic
lazysp_selector_partition_all	Adaptor to use non-matrix partition_all functions as a selector for pr_bgl::lazysp
lazysp_partition_all_matrix	Adaptor to use matrix partition_all functions as a LazySP selector
lazysp_selector_sp_indicator_probability	Shortest-path indicator probability selector for pr_bgl::lazysp
lazysp_wmap_identity_map	Lazysp_wmap_identity_map
lpastar	Implements the Lifelong Planning A* incremental search algorithm
overlay_manager	Class which maintains an overlay graph
pair_index_map	Convert a master index to a row-major-order matrix index pair
partition_all_divergent_exception
partition_all_matrix
partition_simple_el
path_generator	Generates all simple paths in non-decreasing order of length
rev_edge_map	Readable boost property map which maps from reversed edges to original edges
string_map	Wraps a property as a string map
throw_map	Throws instantly on access
vector_ref_property_map	Readable property map adaptor for a vector
waste_edge_map
counting_visitor
grid_heuristic
grid_reader