operations_research::internal::PathWithPriority< GraphType > Class Template Reference

Detailed Description

template<class GraphType>
class operations_research::internal::PathWithPriority< GraphType >

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.

#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

Member Typedef Documentation

NodeIndex

template<class GraphType>

using operations_research::internal::PathWithPriority< GraphType >::NodeIndex = typename GraphType::NodeIndex

Definition at line 217 of file k_shortest_paths.h.

Constructor & Destructor Documentation

PathWithPriority()

template<class GraphType>

operations_research::internal::PathWithPriority< GraphType >::PathWithPriority ( PathDistance priority, std::vector< NodeIndex > path )

inline

Definition at line 219 of file k_shortest_paths.h.

Member Function Documentation

operator>()

template<class GraphType>

bool operations_research::internal::PathWithPriority< GraphType >::operator> ( const PathWithPriority< GraphType > & other ) const

inline

Definition at line 221 of file k_shortest_paths.h.

path()

template<class GraphType>

const std::vector< NodeIndex > & operations_research::internal::PathWithPriority< GraphType >::path ( ) const

inlinenodiscard

Definition at line 225 of file k_shortest_paths.h.

priority()

template<class GraphType>

PathDistance operations_research::internal::PathWithPriority< GraphType >::priority ( ) const

inlinenodiscard

Definition at line 226 of file k_shortest_paths.h.

---

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

• ortools/graph/k_shortest_paths.h