operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance Struct Reference

#include <bidirectional_dijkstra.h>

Public Member Functions
bool	operator< (const NodeDistance &other) const
std::string	DebugString () const

Public Attributes
NodeIndex	node
DistanceType	distance

Detailed Description

template<typename GraphType, typename DistanceType>
struct operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance

Represents a node with a distance (typically from one end of the search, either the source or the destination).

Definition at line 61 of file bidirectional_dijkstra.h.

Member Function Documentation

DebugString()

template<typename GraphType , typename DistanceType >

std::string operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance::DebugString ( ) const

inline

Definition at line 69 of file bidirectional_dijkstra.h.

operator<()

template<typename GraphType , typename DistanceType >

bool operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance::operator< ( const NodeDistance & other ) const

inline

We inverse the < operator to easily use this node within priority queues where the closest node comes first.

Definition at line 66 of file bidirectional_dijkstra.h.

Member Data Documentation

distance

template<typename GraphType , typename DistanceType >

DistanceType operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance::distance

Definition at line 63 of file bidirectional_dijkstra.h.

node

template<typename GraphType , typename DistanceType >

NodeIndex operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance::node

Definition at line 62 of file bidirectional_dijkstra.h.

---

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

• ortools/graph/bidirectional_dijkstra.h