operations_research::Edge Class Reference

#include <simple_graph.h>

Public Member Functions
	Edge (int64_t tail, int64_t head)
	Edge (const Arc &arc)
int64_t	tail () const
int64_t	head () const
bool	operator== (const Edge &other) const
bool	operator!= (const Edge &other) const

Friends
template<typename H >
H	AbslHashValue (H h, const Edge &a)

Detailed Description

Edge, undirected, between the head to the tail. With a few bells and whistles to allow its use within hash tables.

Definition at line 32 of file simple_graph.h.

Constructor & Destructor Documentation

Edge() [1/2]

operations_research::Edge::Edge ( int64_t tail, int64_t head )

inline

Definition at line 34 of file simple_graph.h.

Edge() [2/2]

operations_research::Edge::Edge ( const Arc & arc )

explicit

Definition at line 18 of file simple_graph.cc.

Member Function Documentation

head()

int64_t operations_research::Edge::head ( ) const

inline

Definition at line 38 of file simple_graph.h.

operator!=()

bool operations_research::Edge::operator!= ( const Edge & other ) const

inline

Definition at line 45 of file simple_graph.h.

operator==()

bool operations_research::Edge::operator== ( const Edge & other ) const

inline

Definition at line 40 of file simple_graph.h.

tail()

int64_t operations_research::Edge::tail ( ) const

inline

Definition at line 37 of file simple_graph.h.

Friends And Related Symbol Documentation

AbslHashValue

template<typename H >

H AbslHashValue ( H h, const Edge & a )

friend

This hash value should not depend on the direction of the edge, hence the use of min and max.

Definition at line 48 of file simple_graph.h.

---

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

• ortools/routing/parsers/simple_graph.h
• ortools/routing/parsers/simple_graph.cc