[vtk-developers] New class: vtkGraphLargestConnectedComponent

[Wylie, Brian]

Just wanted to add that this sounds quite useful to us, would love to have it checked in. :)

-bri

  Brian Wylie - Org 1424
  Sandia National Laboratories
  MS 1323 - Building CSRI/242
  (505)844-2238 FAX(505)284-2518   
       _______ __
      /_  __(_) /_____ _____
       / / / / __/ __ `/ __ \
      / / / / /_/ /_/ / / / /
     /_/ /_/\__/\__,_/_/ /_/
            Informatics Toolkit


-----Original Message-----
From: vtk-developers-bounces at vtk.org [mailto:vtk-developers-bounces at vtk.org] On Behalf Of Jeff Baumes
Sent: Monday, May 24, 2010 6:38 AM
To: David Doria
Cc: VTK Developers
Subject: Re: [vtk-developers] New class: vtkGraphLargestConnectedComponent

> You said
>
> "Similarly, you should ShallowCopy() the output of
> the last filter into the real filter output object."
>
> Is that not what this is doing:?
> output->ShallowCopy(extractSelectedGraph->GetOutput());
>
> Do I have to, instead, do :
>
> vtkSmartPointer<vtkMutableUndirectedGraph> tempOutput =
>  vtkSmartPointer<vtkMutableUndirectedGraph>::New();
> tempOutput->ShallowCopy(extractSelectedGraph->GetOutput());
> output->ShallowCopy(tempOutput);

No, you had it right. I was just completing the thought in the email
to fully explain to others how to use an internal pipeline in an
algorithm.

Jeff
_______________________________________________
Powered by www.kitware.com

Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html

Follow this link to subscribe/unsubscribe:
http://www.vtk.org/mailman/listinfo/vtk-developers