LEMUR Packages: ompl_lemur or_lemur pr_bgl prpy_lemur
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Groups Pages
File List
Here is a list of all documented files with brief descriptions:
[detail level 1234]
\-pr_bgl
 \-include
  \-pr_bgl
   o*compose_property_map.hpp
   o*edge_indexed_graph.hContains pr_bgl::edge_indexed_graph
   o*flag_set_map.hContains pr_bgl::flag_set_map
   o*graph_io.hContains functions for working with graphio, a custom graph serialization format
   o*heap_indexed.hContains pr_bgl::heap_indexed
   o*incbi.hIncremental bidirectional Dijkstra's search (pr_bgl::incbi)
   o*lazysp.hLazy shortest path search (pr_bgl::lazysp)
   o*lazysp_incsp_astar.hAdaptor to use boost::astar_search as the inner sp algorithm for pr_bgl::lazysp
   o*lazysp_incsp_dijkstra.hAdaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp
   o*lazysp_incsp_incbi.hAdaptor to use pr_bgl::incbi as the inner sp algorithm for pr_bgl::lazysp
   o*lazysp_incsp_lpastar.hAdaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp
   o*lazysp_selector_partition_all.hAdaptors to use partition_all as a LazySP selector
   o*lazysp_selector_sp_indicator_probability.hIndicator probability selector (pr_bgl::lazysp_selector_sp_indicator_probability)
   o*lazysp_wmap_identity_map.hContains pr_bgl::lazysp_wmap_identity_map
   o*lpastar.hLifelong Planning A* (pr_bgl::lpastar)
   o*overlay_manager.hClass which maintains an overlay graph (pr_bgl::overlay_manager)
   o*pair_index_map.hProperty map for converting 2d matrix indices to a single int index (pr_bgl::pair_index_map)
   o*partition_all.hFunctions for calculate the edge-weight partition function over all paths between every pair of vertices on a graph
   o*partition_simple.hFunction (pr_bgl::partition_simple) for calculate the edge-weight partition function over all simple paths between every pair of vertices on a graph
   o*path_generator.hGenerates all simple paths in non-decreasing order of length (pr_bgl::path_generator)
   o*rev_edge_map.hProperty map which maps from reversed edges to original edges (pr_bgl::rev_edge_map)
   o*string_map.hWraps a property as a string map (pr_bgl::string_map)
   o*throw_map.hThrows instantly on access (pr_bgl::throw_map)
   o*vector_ref_property_map.hContains pr_bgl::edge_indexed_graph
   \*waste_edge_map.hWaste edge map (apply a vertex potential function to edge weights)