Method TraceShortestPath

Filters/Modeling/vtkDijkstraGraphGeodesicPath.cxx:222–274

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

//------------------------------------------------------------------------------
void vtkDijkstraGraphGeodesicPath::TraceShortestPath(
  vtkDataSet* inData, vtkPolyData* outPoly, vtkIdType startv, vtkIdType endv)
{
  vtkPoints* points = vtkPoints::New();
  vtkCellArray* lines = vtkCellArray::New();

  // n is far to many. Adjusted later
  lines->InsertNextCell(this->NumberOfVertices);

  // trace backward
  vtkIdType v = endv;
  double pt[3];
  vtkIdType id;
  while (v != startv)
  {
    if (this->CheckAbort())
    {
      break;
    }
    if (v < 0)
    {
      // Invalid vertex. Path does not exist.
      break;
    }

    this->IdList->InsertNextId(v);

    inData->GetPoint(v, pt);
    id = points->InsertNextPoint(pt);
    lines->InsertCellPoint(id);

    v = this->Internals->Predecessors[v];
  }

  if (v >= 0)
  {
    this->IdList->InsertNextId(v);
    inData->GetPoint(v, pt);
    id = points->InsertNextPoint(pt);
    lines->InsertCellPoint(id);
    lines->UpdateCellCount(points->GetNumberOfPoints());
  }
  else
  {
    points->Reset();
    lines->Reset();
  }

  outPoly->SetPoints(points);
  points->Delete();
  outPoly->SetLines(lines);
  lines->Delete();
}

//------------------------------------------------------------------------------
void vtkDijkstraGraphGeodesicPath::Relax(const int& u, const int& v, const double& w)