#include <abstractBigraph.h>
Inheritance diagram for leftHandNodes:
Public Member Functions | |
leftHandNodes (const abstractBiGraph &_G) throw () | |
~leftHandNodes () 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) |
Objects specify all bigraph nodes 0,1,..,n1-1
|
|
|
|
|
Query the smallest index in an index set.
Reimplemented from indexSet< TNode >. |
|
Test for indet set membership.
Implements indexSet< TNode >. |
|
Implements indexSet< TNode >. |
|
Enumeration of the indices contained in a set.
Reimplemented from indexSet< TNode >. |