andres::graph::Adjacency< T > Class Template Reference

The adjacency of a vertex consists of a vertex and a connecting edge. More...

#include <adjacency.hxx>

Public Types
typedef T	Value

Public Member Functions
	Adjacency (const Value=T(), const Value=T())
	Construct an adjacency.
Value	vertex () const
	Access the vertex.
Value &	vertex ()
	Access the vertex.
Value	edge () const
	Access the edge.
Value &	edge ()
	Access the edge.
bool	operator< (const Adjacency< Value > &) const
	Adjacencies are ordered first wrt the vertex, then wrt the edge.
bool	operator<= (const Adjacency< Value > &) const
	Adjacencies are ordered first wrt the vertex, then wrt the edge.
bool	operator> (const Adjacency< Value > &) const
	Adjacencies are ordered first wrt the vertex, then wrt the edge.
bool	operator>= (const Adjacency< Value > &) const
	Adjacencies are ordered first wrt the vertex, then wrt the edge.
bool	operator== (const Adjacency< Value > &) const
	Adjacencies are equal if both the vertex and the edge are equal.
bool	operator!= (const Adjacency< Value > &) const
	Adjacencies are unequal if either the vertex or the edge are unqual.

Detailed Description

template<class T = std::size_t>
class andres::graph::Adjacency< T >

The adjacency of a vertex consists of a vertex and a connecting edge.

Definition at line 10 of file adjacency.hxx.

Member Typedef Documentation

template<class T = std::size_t>

typedef T andres::graph::Adjacency< T >::Value

Definition at line 12 of file adjacency.hxx.

Constructor & Destructor Documentation

template<class T >

andres::graph::Adjacency< T >::Adjacency ( const Value  vertex = T(), const Value  edge = T()  )

inline

Construct an adjacency.

Parameters

vertex	Vertex.
edge	Edge.

Definition at line 38 of file adjacency.hxx.

Member Function Documentation

template<class T >

Adjacency< T >::Value andres::graph::Adjacency< T >::edge ( ) const

inline

Access the edge.

Definition at line 66 of file adjacency.hxx.

template<class T >

Adjacency< T >::Value & andres::graph::Adjacency< T >::edge ( )

inline

Access the edge.

Definition at line 74 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator!= ( const Adjacency< Value > &  in ) const

inline

Adjacencies are unequal if either the vertex or the edge are unqual.

Definition at line 164 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator< ( const Adjacency< Value > &  in ) const

inline

Adjacencies are ordered first wrt the vertex, then wrt the edge.

Definition at line 82 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator<= ( const Adjacency< Value > &  in ) const

inline

Adjacencies are ordered first wrt the vertex, then wrt the edge.

Definition at line 100 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator== ( const Adjacency< Value > &  in ) const

inline

Adjacencies are equal if both the vertex and the edge are equal.

Definition at line 154 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator> ( const Adjacency< Value > &  in ) const

inline

Adjacencies are ordered first wrt the vertex, then wrt the edge.

Definition at line 118 of file adjacency.hxx.

template<class T >

bool andres::graph::Adjacency< T >::operator>= ( const Adjacency< Value > &  in ) const

inline

Adjacencies are ordered first wrt the vertex, then wrt the edge.

Definition at line 136 of file adjacency.hxx.

template<class T >

Adjacency< T >::Value andres::graph::Adjacency< T >::vertex ( ) const

inline

Access the vertex.

Definition at line 50 of file adjacency.hxx.

template<class T >

Adjacency< T >::Value & andres::graph::Adjacency< T >::vertex ( )

inline

Access the vertex.

Definition at line 58 of file adjacency.hxx.