iterates over vertex neighborhood
![]() | SM2VertexTopologyIterator (SM2VertexTopology& first, unsigned int nghSize) Builds a new iterator from first vertex for a nghSize neighborhood |
![]() | first (void) set iterator to first vertex |
![]() | isAtEnd (void) const is iterator at end of neighborhood? |
![]() | getCount (void) const returns neighborhood number of vertices |
![]() | operator) (void) returns current edge |
![]() | operator++ (void) set iterator on next vertex and returns it |
![]() | operator++ (int) returns current vertex then set iterator on next one |
![]() | operator-- (void) set iterator on previous vertex and returns it |
![]() | operator-- (int) returns current vertex then set iterator on previous one |
![]() | start first vertex |
![]() | it vertex neighborhood |
![]() | add (SM2VertexTopology& parent, unsigned int level) neighborhood construction recursive function |
iterates over vertex neighborhood
std::vector <SM2VertexTopology *> ::iterator it
void add(SM2VertexTopology& parent, unsigned int level)
level - recursion level (>=0) SM2VertexTopologyIterator(SM2VertexTopology& first, unsigned int nghSize)
nghSize - neighborhood size void first(void)
bool isAtEnd(void) const
unsigned int getCount(void) const
SM2VertexTopology* operator)(void)
SM2VertexTopology* operator++(void)
SM2VertexTopology* operator++(int)
SM2VertexTopology* operator--(void)
SM2VertexTopology* operator--(int)
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de