#include <named_function_params.hpp>
template<class PriorityQueueTag , class KeyT , class ValueT , class Compare = std::less<KeyT>, class KeyMapTag = boost::graph::keywords::tag::distance_map, class IndexInHeapMapTag = boost::graph::keywords::tag::index_in_heap_map>
template<class PriorityQueueTag , class KeyT , class ValueT , class Compare = std::less<KeyT>, class KeyMapTag = boost::graph::keywords::tag::distance_map, class IndexInHeapMapTag = boost::graph::keywords::tag::index_in_heap_map>
template<class Graph , class ArgPack >
priority_queue_maker<Graph, ArgPack, KeyT, ValueT, PriorityQueueTag, KeyMapTag, IndexInHeapMapTag, Compare>::priority_queue_type boost::detail::make_priority_queue_from_arg_pack_gen< PriorityQueueTag, KeyT, ValueT, Compare, KeyMapTag, IndexInHeapMapTag >::operator() |
( |
const Graph & |
g, |
|
|
const ArgPack & |
ap |
|
) |
| const |
|
inline |
template<class PriorityQueueTag , class KeyT , class ValueT , class Compare = std::less<KeyT>, class KeyMapTag = boost::graph::keywords::tag::distance_map, class IndexInHeapMapTag = boost::graph::keywords::tag::index_in_heap_map>
The documentation for this struct was generated from the following file: