![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
Stores the solution to a k-shortest path problem. paths contains up to k paths from source to destination (these nodes are arguments to the algorithm), each having a distance stored in distances.
The paths in paths start with origin and end at destination.
If the computations are unsuccessful for any reason, the vectors are empty.
Definition at line 97 of file k_shortest_paths.h.
#include <k_shortest_paths.h>
Public Attributes | |
std::vector< std::vector< typename GraphType::NodeIndex > > | paths |
std::vector< PathDistance > | distances |
std::vector<PathDistance> operations_research::KShortestPaths< GraphType >::distances |
Definition at line 105 of file k_shortest_paths.h.
std::vector<std::vector<typename GraphType::NodeIndex> > operations_research::KShortestPaths< GraphType >::paths |
The paths are stored as vectors of nodes, like the other graph algorithms.
Definition at line 104 of file k_shortest_paths.h.