operations_research::NodeEntry< NodeIndex, kNilNode > Class Template Reference

Priority queue node entry in the boundary of the Dijkstra algorithm. More...

#include <shortest_paths.h>

Public Member Functions
	NodeEntry ()
bool	operator< (const NodeEntry &other) const
void	SetHeapIndex (int h)
int	GetHeapIndex () const
void	set_distance (PathDistance distance)
PathDistance	distance () const
void	set_node (NodeIndex node)
NodeIndex	node () const
void	set_settled (bool settled)
bool	settled () const
void	set_is_destination (bool is_destination)
bool	is_destination () const

Detailed Description

template<class NodeIndex, NodeIndex kNilNode>
class operations_research::NodeEntry< NodeIndex, kNilNode >

Priority queue node entry in the boundary of the Dijkstra algorithm.

Definition at line 559 of file shortest_paths.h.

Constructor & Destructor Documentation

NodeEntry()

template<class NodeIndex, NodeIndex kNilNode>

operations_research::NodeEntry< NodeIndex, kNilNode >::NodeEntry ( )

inline

Definition at line 561 of file shortest_paths.h.

Member Function Documentation

distance()

template<class NodeIndex, NodeIndex kNilNode>

PathDistance operations_research::NodeEntry< NodeIndex, kNilNode >::distance ( ) const

inline

Definition at line 576 of file shortest_paths.h.

GetHeapIndex()

template<class NodeIndex, NodeIndex kNilNode>

int operations_research::NodeEntry< NodeIndex, kNilNode >::GetHeapIndex ( ) const

inline

Definition at line 574 of file shortest_paths.h.

is_destination()

template<class NodeIndex, NodeIndex kNilNode>

bool operations_research::NodeEntry< NodeIndex, kNilNode >::is_destination ( ) const

inline

Definition at line 584 of file shortest_paths.h.

node()

template<class NodeIndex, NodeIndex kNilNode>

NodeIndex operations_research::NodeEntry< NodeIndex, kNilNode >::node ( ) const

inline

Definition at line 578 of file shortest_paths.h.

operator<()

template<class NodeIndex, NodeIndex kNilNode>

bool operations_research::NodeEntry< NodeIndex, kNilNode >::operator< ( const NodeEntry< NodeIndex, kNilNode > & other ) const

inline

Definition at line 567 of file shortest_paths.h.

set_distance()

template<class NodeIndex, NodeIndex kNilNode>

void operations_research::NodeEntry< NodeIndex, kNilNode >::set_distance ( PathDistance distance )

inline

Definition at line 575 of file shortest_paths.h.

set_is_destination()

template<class NodeIndex, NodeIndex kNilNode>

void operations_research::NodeEntry< NodeIndex, kNilNode >::set_is_destination ( bool is_destination )

inline

Definition at line 581 of file shortest_paths.h.

set_node()

template<class NodeIndex, NodeIndex kNilNode>

void operations_research::NodeEntry< NodeIndex, kNilNode >::set_node ( NodeIndex node )

inline

Definition at line 577 of file shortest_paths.h.

set_settled()

template<class NodeIndex, NodeIndex kNilNode>

void operations_research::NodeEntry< NodeIndex, kNilNode >::set_settled ( bool settled )

inline

Definition at line 579 of file shortest_paths.h.

SetHeapIndex()

template<class NodeIndex, NodeIndex kNilNode>

void operations_research::NodeEntry< NodeIndex, kNilNode >::SetHeapIndex ( int h )

inline

Definition at line 570 of file shortest_paths.h.

settled()

template<class NodeIndex, NodeIndex kNilNode>

bool operations_research::NodeEntry< NodeIndex, kNilNode >::settled ( ) const

inline

Definition at line 580 of file shortest_paths.h.

---

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

• ortools/graph/shortest_paths.h