Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
Loading...
Searching...
No Matches
Public Member Functions
dsac::graph::Graph< V, E >::Edge Class Reference

Edge instance serves as a token for an underlying edge. More...

#include <graph.h>

Collaboration diagram for dsac::graph::Graph< V, E >::Edge:
Collaboration graph

Public Member Functions

 Edge ()
 
int weight () const
 
E & operator* () const
 
E * operator-> () const
 
bool operator== (Edge other) const
 
bool operator!= (Edge other) const
 
bool operator< (Edge other) const
 

Detailed Description

template<typename V, typename E>
class dsac::graph::Graph< V, E >::Edge

Edge instance serves as a token for an underlying edge.

Constructor & Destructor Documentation

◆ Edge()

template<typename V , typename E >
dsac::graph::Graph< V, E >::Edge::Edge ( )
inline

Member Function Documentation

◆ operator!=()

template<typename V , typename E >
bool dsac::graph::Graph< V, E >::Edge::operator!= ( Edge  other) const
inline

◆ operator*()

template<typename V , typename E >
E & dsac::graph::Graph< V, E >::Edge::operator* ( ) const
inline

◆ operator->()

template<typename V , typename E >
E * dsac::graph::Graph< V, E >::Edge::operator-> ( ) const
inline

◆ operator<()

template<typename V , typename E >
bool dsac::graph::Graph< V, E >::Edge::operator< ( Edge  other) const
inline

◆ operator==()

template<typename V , typename E >
bool dsac::graph::Graph< V, E >::Edge::operator== ( Edge  other) const
inline

◆ weight()

template<typename V , typename E >
int dsac::graph::Graph< V, E >::Edge::weight ( ) const
inline

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