|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Functor to get arc potential for heap ordering. More...
#include <shortest_path_common.H>
Public Member Functions | |
| Get_Potential_Arc ()=default | |
| Get_Potential_Arc (Distance &d) noexcept | |
| Distance::Distance_Type | operator() (typename GT::Arc *a) const noexcept |
Public Member Functions inherited from Distance | |
| Distance_Type | operator() (Arc *a) const |
| Distance_Type | operator() (Arc *a) const |
Additional Inherited Members | |
Public Types inherited from Distance | |
| using | Distance_Type = double |
| using | Distance_Type = double |
Static Public Member Functions inherited from Distance | |
| static void | set_zero (Arc *a) |
| static void | set_zero (Arc *a) |
Functor to get arc potential for heap ordering.
Definition at line 230 of file shortest_path_common.H.
|
default |
|
inlinenoexcept |
Definition at line 234 of file shortest_path_common.H.
|
inlinenoexcept |
Definition at line 237 of file shortest_path_common.H.
References SP_POT.