|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <K_Shortest_Paths.H>
Public Types | |
| using | Arc = typename GT::Arc |
| using | Distance_Type = typename Distance::Distance_Type |
Public Member Functions | |
| Distance_Type | operator() (Arc *rev_arc) const |
Static Public Attributes | |
| static thread_local const DynMapTree< Arc *, Arc * > * | map_ptr = nullptr |
| Context for reverse-graph Dijkstra in build_suffix_index_digraph(). | |
| static thread_local const Distance * | base_ptr = nullptr |
Definition at line 161 of file K_Shortest_Paths.H.
| using Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::Arc = typename GT::Arc |
Definition at line 163 of file K_Shortest_Paths.H.
| using Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::Distance_Type = typename Distance::Distance_Type |
Definition at line 164 of file K_Shortest_Paths.H.
|
inline |
Definition at line 181 of file K_Shortest_Paths.H.
References ah_runtime_error_if, Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::base_ptr, Aleph::blossom_maximum_cardinality_matching(), Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::map_ptr, and Aleph::DynMapTree< Key, Data, Tree, Compare >::search().
|
inlinestatic |
Definition at line 179 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::operator()().
|
inlinestatic |
Context for reverse-graph Dijkstra in build_suffix_index_digraph().
Definition at line 178 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::operator()().