Re: [jgrapht-users] All shortest paths problem

[John V. S. <js...@gm...>]

Daniel Bell wrote:
> Is it possible to use DijkstraShortestPath to calculate the shortest 
> paths to all destinations from a specified vertex? If not, is there a 
> way that you would recommend extending the framework to accommodate this 
> use case? I’d be happy to contribute the code if that’s the case.

Yes, you can use an instance of 
org.jgrapht.traverse.ClosestFirstIterator for this purpose.  The 
DijkstraShortestPath class is actually just a wrapper for it.

JVS