// Add neighborhood
TVertices neighbors = this->_GetNeighbors( node.Vertex );
typename TVertices::const_iterator neighIt = neighbors.begin( );
- for( ; neighIt != neighbors.end( ); ++neighIt )
+ bool coll = false;
+ while( neighIt != neighbors.end( ) && !coll )
{
TVertex neigh = *neighIt;
if( this->_IsMarked( neigh ) )
this->GetNumberOfSeeds( ) > 1 &&
nColl == 1
)
+ {
q.clear( );
+ coll = true;
+
+ } // fi
}
else
{
} // fi
} // fi
+ ++neighIt;
- } // rof
+ } // elihw
} // elihw
this->_FreeMarks( );
// Add neighborhood
TVertices neighbors = this->_GetNeighbors( node.first );
typename TVertices::const_iterator neighIt = neighbors.begin( );
- for( ; neighIt != neighbors.end( ); ++neighIt )
+ bool coll = false;
+ while( neighIt != neighbors.end( ) && !coll )
{
TVertex neigh = *neighIt;
if( this->_IsMarked( neigh ) )
this->GetNumberOfSeeds( ) > 1 &&
nColl == 1
)
+ {
while( q.size( ) > 0 )
q.pop( );
+ coll = true;
+
+ } // fi
}
else
q.push( _TNode( neigh, node.second ) );
+ ++neighIt;
- } // rof
+ } // elihw
} // elihw
this->_FreeMarks( );