Edge iterator. Only forward iteration (operator++) is supported. More...

Public Member Functions
	TEdgeI ()
	TEdgeI (const TNodeI &NodeI, const TNodeI &EndNodeI, const int &EdgeN=0)
	TEdgeI (const TEdgeI &EdgeI)
TEdgeI &	operator= (const TEdgeI &EdgeI)
TEdgeI &	operator++ (int)
	Increment iterator.
bool	operator< (const TEdgeI &EdgeI) const
bool	operator== (const TEdgeI &EdgeI) const
int	GetId () const
	Gets edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.
int	GetSrcNId () const
	Gets the source of an edge. Since the graph is undirected this is the node with smaller ID of the edge endpoints.
int	GetDstNId () const
	Gets destination of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints.
Friends
class	TUNGraph

Detailed Description

Edge iterator. Only forward iteration (operator++) is supported.

Constructor & Destructor Documentation

TUNGraph::TEdgeI::TEdgeI ( ) [inline]

TUNGraph::TEdgeI::TEdgeI ( const TEdgeI & EdgeI ) [inline]

int TUNGraph::TEdgeI::GetDstNId ( ) const [inline]

Gets destination of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints.

int TUNGraph::TEdgeI::GetId ( ) const [inline]

Gets edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.

int TUNGraph::TEdgeI::GetSrcNId ( ) const [inline]

Gets the source of an edge. Since the graph is undirected this is the node with smaller ID of the edge endpoints.

TEdgeI& TUNGraph::TEdgeI::operator++ ( int ) [inline]

Increment iterator.

bool TUNGraph::TEdgeI::operator< ( const TEdgeI & EdgeI ) const [inline]

TEdgeI& TUNGraph::TEdgeI::operator= ( const TEdgeI & EdgeI ) [inline]

bool TUNGraph::TEdgeI::operator== ( const TEdgeI & EdgeI ) const [inline]

friend class TUNGraph [friend]

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