| Contains pr_bgl::edge_indexed_graph | |
| Contains pr_bgl::flag_set_map | |
| Contains functions for working with graphio, a custom graph serialization format | |
| Contains pr_bgl::heap_indexed | |
| Incremental bidirectional Dijkstra's search (pr_bgl::incbi) | |
| Lazy shortest path search (pr_bgl::lazysp) | |
| Adaptor to use boost::astar_search as the inner sp algorithm for pr_bgl::lazysp | |
| Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp | |
| Adaptor to use pr_bgl::incbi as the inner sp algorithm for pr_bgl::lazysp | |
| Adaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp | |
| Adaptors to use partition_all as a LazySP selector | |
| Indicator probability selector (pr_bgl::lazysp_selector_sp_indicator_probability) | |
| Contains pr_bgl::lazysp_wmap_identity_map | |
| Lifelong Planning A* (pr_bgl::lpastar) | |
| Class which maintains an overlay graph (pr_bgl::overlay_manager) | |
| Property map for converting 2d matrix indices to a single int index (pr_bgl::pair_index_map) | |
| Functions for calculate the edge-weight partition function over all paths between every pair of vertices on a graph | |
| Function (pr_bgl::partition_simple) for calculate the edge-weight partition function over all simple paths between every pair of vertices on a graph | |
| Generates all simple paths in non-decreasing order of length (pr_bgl::path_generator) | |
| Property map which maps from reversed edges to original edges (pr_bgl::rev_edge_map) | |
| Wraps a property as a string map (pr_bgl::string_map) | |
| Throws instantly on access (pr_bgl::throw_map) | |
| Contains pr_bgl::edge_indexed_graph | |
| Waste edge map (apply a vertex potential function to edge weights) |
1.8.6
using