Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance > Struct Template Reference

#include <K_Shortest_Paths.H>

Collaboration diagram for Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >:

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

Detailed Description

template<class GT, class Distance>
struct Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >

Definition at line 154 of file K_Shortest_Paths.H.

Member Typedef Documentation

Arc

template<class GT , class Distance >

using Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::Arc = typename GT::Arc

Definition at line 156 of file K_Shortest_Paths.H.

Distance_Type

template<class GT , class Distance >

using Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::Distance_Type = typename Distance::Distance_Type

Definition at line 157 of file K_Shortest_Paths.H.

Member Function Documentation

operator()()

template<class GT , class Distance >

Distance_Type Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::operator() ( Arc *  rev_arc ) const

inline

Definition at line 174 of file K_Shortest_Paths.H.

References ah_runtime_error_if, Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::base_ptr, Aleph::divide_and_conquer_partition_dp(), Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::map_ptr, and Aleph::DynMapTree< Key, Data, Tree, Compare >::search().

Member Data Documentation

base_ptr

template<class GT , class Distance >

thread_local const Distance* Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::base_ptr = nullptr

inlinestatic

Definition at line 172 of file K_Shortest_Paths.H.

Referenced by Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::operator()().

map_ptr

template<class GT , class Distance >

thread_local const DynMapTree<Arc *, Arc *>* Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::map_ptr = nullptr

inlinestatic

Context for reverse-graph Dijkstra in build_suffix_index_digraph().

Warning

This struct uses static thread_local pointers to map reverse arcs back to original arcs. It is NOT re-entrant on the same thread: nested calls to algorithms using this struct will overwrite the global context. The Reset_Reverse_Distance RAII guard is used to restore state.

Definition at line 171 of file K_Shortest_Paths.H.

Referenced by Aleph::k_shortest_paths_detail::Reverse_Arc_Distance< GT, Distance >::operator()().

---

The documentation for this struct was generated from the following file:

• K_Shortest_Paths.H