[vtk-developers] Dijkstra class terminology and question

[Jeff Baumes]

Yes, this is an issue for a few older classes in VTK that use the word
"graph" like Graphics/vtkGraphLayoutFilter, which also works on vtkPolyData.
The Geodesic classes were being written just when vtkGraph was being
introduced to VTK and we did not coordinate this well. I'd suggest a new
class called vtkBoostDijkstraShortestPaths that uses

http://www.boost.org/doc/libs/1_34_0/libs/graph/doc/dijkstra_shortest_paths.html

Jeff

On Thu, Jun 2, 2011 at 6:52 PM, David Doria <daviddoria at gmail.com> wrote:

> The name of this class (vtkDijkstraGraphGeodesicPath) is very
> confusing. It is a subclass of vtkPolyDataAlgorithm, and operates on a
> vtkPolyData, not a vtkGraph. Could the name be changed to something
> more like vtkDijkstraPolyDataGeodesicPath? And could a function which
> accepts a vtkGraph be added (which then internally uses a
> vtkGraphToPolyData to do the conversion and then pass it along to the
> standard input function)? Or a separate class named
> vtkDijkstraGraphShortestPath introduced? Or is there an existing
> better way to find the shortest path on a vtkGraph?
>
> A limitation of using a PolyData is that you can't find the shortest
> path on a directed graph.
>
> Thanks,
>
> David
> _______________________________________________
> 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
>
>


-- 
Jeff Baumes, Ph.D.
Technical Lead, Kitware Inc.
(518) 881-4932
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://public.kitware.com/pipermail/vtk-developers/attachments/20110608/2279da92/attachment.html>