operations_research::KShortestPaths< GraphType > Struct Template Reference

#include <k_shortest_paths.h>

Public Attributes
std::vector< std::vector< typename GraphType::NodeIndex > >	paths
std::vector< PathDistance >	distances

Detailed Description

template<class GraphType>
struct operations_research::KShortestPaths< GraphType >

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 86 of file k_shortest_paths.h.

Member Data Documentation

distances

template<class GraphType>

std::vector<PathDistance> operations_research::KShortestPaths< GraphType >::distances

Definition at line 94 of file k_shortest_paths.h.

paths

template<class GraphType>

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.

Todo

(user): what about vectors of arcs? That might be faster (potentially, add a function to transform it into a vector of nodes if the user really needs it). It would also have the nice benefit of removing the need for distances (compute it on the fly), with a reference to the graph and the costs.

Definition at line 93 of file k_shortest_paths.h.

---

The documentation for this struct was generated from the following file:

• ortools/graph/k_shortest_paths.h