![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <k_shortest_paths.h>
Public Types | |
using | NodeIndex = typename GraphType::NodeIndex |
Public Member Functions | |
PathWithPriority (PathDistance priority, std::vector< NodeIndex > path) | |
bool | operator> (const PathWithPriority &other) const |
const std::vector< NodeIndex > & | path () const |
PathDistance | priority () const |
Stores a path with a priority (typically, the distance), with a comparison operator that operates on the priority.
Definition at line 215 of file k_shortest_paths.h.
using operations_research::internal::PathWithPriority< GraphType >::NodeIndex = typename GraphType::NodeIndex |
Definition at line 217 of file k_shortest_paths.h.
|
inline |
Definition at line 219 of file k_shortest_paths.h.
|
inline |
Definition at line 221 of file k_shortest_paths.h.
|
inlinenodiscard |
Definition at line 225 of file k_shortest_paths.h.
|
inlinenodiscard |
Definition at line 226 of file k_shortest_paths.h.