[vtk-developers] Dijkstra class terminology and question

[David Doria]

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