rightHandNodes Class Reference
[Index sets]

Index sets representing all right-hand nodes of a bipartite graph. More...

#include <abstractBigraph.h>

Inheritance diagram for rightHandNodes:

Public Member Functions
	rightHandNodes (const abstractBiGraph &_G) throw ()
	~rightHandNodes () throw ()
unsigned long	Size () const throw ()
bool	IsMember (const TNode i) const throw (ERRange)
TNode	First () const throw ()
TNode	Successor (const TNode i) const throw (ERRange)

---

Detailed Description

Index sets representing all right-hand nodes of a bipartite graph.

Objects specify all bigraph nodes n1,n1+1,..,n-1

---

Constructor & Destructor Documentation

rightHandNodes (  const abstractBiGraph &  _G  )  throw ()

~rightHandNodes (   )  throw ()

---

Member Function Documentation

TNode First (   )  const throw () [virtual]

Query the smallest index in an index set. Returns: The smallest index contained by this set Reimplemented from indexSet< TNode >.

bool IsMember (  const TNode  i  )  const throw (ERRange) [virtual]

Test for indet set membership. Parameters: i  An index to test for indet set membership Return values: true  The indexed element is contained by this set Implements indexSet< TNode >.

unsigned long Size (   )  const throw () [virtual]

Implements indexSet< TNode >.

TNode Successor (  const TNode  i  )  const throw (ERRange) [virtual]

Enumeration of the indices contained in a set. Returns: The least upper bound index contained by this set Reimplemented from indexSet< TNode >.