TBPGraph::TEdgeI Class Reference

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

List of all members.

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 ('left' side) of an edge. Since the graph is undirected this is the node with smaller ID of the edge endpoints.
int	GetDstNId () const
	Gets destination ('right' side) of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints.
int	GetLNId () const
	Gets the id of the node on the 'left' side of the edge.
int	GetRNId () const
	Gets the id of the node on the 'right' side of the edge.
Friends
class	TBPGraph

---

Detailed Description

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

---

Constructor & Destructor Documentation

TBPGraph::TEdgeI::TEdgeI

(

)

[inline]

TBPGraph::TEdgeI::TEdgeI	(	const TNodeI &	NodeI,
		const TNodeI &	EndNodeI,
		const int &	EdgeN = 0
	)		[inline]

TBPGraph::TEdgeI::TEdgeI

(

const TEdgeI &

EdgeI

)

[inline]

---

Member Function Documentation

int TBPGraph::TEdgeI::GetDstNId

(

)

const [inline]

Gets destination ('right' side) of an edge. Since the graph is undirected this is the node with greater ID of the edge endpoints.

int TBPGraph::TEdgeI::GetId

(

)

const [inline]

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

int TBPGraph::TEdgeI::GetLNId

(

)

const [inline]

Gets the id of the node on the 'left' side of the edge.

int TBPGraph::TEdgeI::GetRNId

(

)

const [inline]

Gets the id of the node on the 'right' side of the edge.

int TBPGraph::TEdgeI::GetSrcNId

(

)

const [inline]

Gets the source ('left' side) of an edge. Since the graph is undirected this is the node with smaller ID of the edge endpoints.

TEdgeI& TBPGraph::TEdgeI::operator++

(

int

)

[inline]

Increment iterator.

bool TBPGraph::TEdgeI::operator<

(

const TEdgeI &

EdgeI

)

const [inline]

TEdgeI& TBPGraph::TEdgeI::operator=

(

const TEdgeI &

EdgeI

)

[inline]

bool TBPGraph::TEdgeI::operator==

(

const TEdgeI &

EdgeI

)

const [inline]

---

Friends And Related Function Documentation

friend class TBPGraph [friend]

---

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

• snap-core/graph.h