|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <K_Shortest_Paths.H>
Public Attributes | |
| DynList< typename GT::Node * > | nodes |
| DynList< typename GT::Arc * > | arcs |
| Cost_Type | total_cost = Cost_Type{0} |
Definition at line 97 of file K_Shortest_Paths.H.
Definition at line 100 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::make_path_snapshot(), Aleph::k_shortest_paths_detail::path_to_state(), Aleph::k_shortest_paths_detail::same_path_sequence(), and Aleph::k_shortest_paths_detail::state_to_path().
Definition at line 99 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::compose_candidate(), Aleph::k_shortest_paths_detail::compose_general_candidate(), Aleph::k_shortest_paths_detail::make_path_snapshot(), Aleph::k_shortest_paths_detail::path_to_state(), Aleph::k_shortest_paths_detail::same_path_sequence(), and Aleph::k_shortest_paths_detail::state_to_path().
| Cost_Type Aleph::k_shortest_paths_detail::Path_State< GT, Cost_Type >::total_cost = Cost_Type{0} |
Definition at line 101 of file K_Shortest_Paths.H.
Referenced by Aleph::k_shortest_paths_detail::path_to_state().