|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <K_Shortest_Paths.H>
Public Types | |
| using | Node = typename GT::Node |
| using | Arc = typename GT::Arc |
Public Attributes | |
| Cost_Type | inf = std::numeric_limits<Cost_Type>::max() |
| DynMapTree< Node *, Cost_Type > | dist_to_target |
| DynMapTree< Node *, Node * > | tree_next |
| DynMapTree< Node *, Arc * > | tree_arc |
Definition at line 106 of file K_Shortest_Paths.H.
Definition at line 109 of file K_Shortest_Paths.H.
Definition at line 108 of file K_Shortest_Paths.H.
| DynMapTree<Node *, Cost_Type> Aleph::k_shortest_paths_detail::Suffix_Index< GT, Cost_Type >::dist_to_target |
Definition at line 112 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::build_suffix_index_digraph(), Aleph::k_shortest_paths_detail::build_suffix_index_with_itor(), and Aleph::k_shortest_paths_detail::get_dist_to_target().
| Cost_Type Aleph::k_shortest_paths_detail::Suffix_Index< GT, Cost_Type >::inf = std::numeric_limits<Cost_Type>::max() |
Definition at line 111 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::build_suffix_index_digraph(), Aleph::k_shortest_paths_detail::build_suffix_index_with_itor(), Aleph::k_shortest_paths_detail::build_suffix_state(), Aleph::k_shortest_paths_detail::generate_general_deviation_candidates(), and Aleph::k_shortest_paths_detail::get_dist_to_target().
| DynMapTree<Node *, Arc *> Aleph::k_shortest_paths_detail::Suffix_Index< GT, Cost_Type >::tree_arc |
Definition at line 114 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::build_suffix_index_digraph(), Aleph::k_shortest_paths_detail::build_suffix_index_with_itor(), and Aleph::k_shortest_paths_detail::get_tree_arc().
| DynMapTree<Node *, Node *> Aleph::k_shortest_paths_detail::Suffix_Index< GT, Cost_Type >::tree_next |
Definition at line 113 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::build_suffix_index_digraph(), Aleph::k_shortest_paths_detail::build_suffix_index_with_itor(), and Aleph::k_shortest_paths_detail::get_tree_next().