Method Next

Common/DataModel/vtkEdgeListIterator.cxx:90–122

------------------------------------------------------------------------------

//------------------------------------------------------------------------------
vtkEdgeType vtkEdgeListIterator::Next()
{
  // First, determine the current item.
  vtkEdgeType e(this->Vertex, this->Current->Target, this->Current->Id);

  // Next, increment the iterator.
  this->Increment();
  // If it is undirected, skip edges that are non-local or
  // entirely-local edges whose source is greater than the target.
  if (!this->Directed)
  {
    int myRank = -1;
    vtkDistributedGraphHelper* helper = this->Graph->GetDistributedGraphHelper();

    if (helper)
    {
      myRank = this->Graph->GetInformation()->Get(vtkDataObject::DATA_PIECE_NUMBER());
    }

    while (this->Current != nullptr &&
      ( // Skip non-local edges.
        (helper && helper->GetEdgeOwner(this->Current->Id) != myRank)
        // Skip entirely-local edges where Source > Target
        || (((helper && myRank == helper->GetVertexOwner(this->Current->Target)) || !helper) &&
             this->Vertex > this->Current->Target)))
    {
      this->Increment();
    }
  }

  // Return the current item.
  return e;
}

//------------------------------------------------------------------------------
vtkGraphEdge* vtkEdgeListIterator::NextGraphEdge()