[jgrapht-users] Null endVertex for DijkstraShortestPath?

[James D. <dem...@ho...>]

Hello there,
I had a question about the implementation of DijkstraShortestPath. It appears from the code that an endVertex is required. However, I was hoping that I could use Dijkstra's without giving it an end vertex. The idea being that i want to give it a startVertex and then have it return to me the shortest path that traverses all nodes. The idea being that I'd want to find the shortest path from each starting vertex.
Let me know if this is possible with JGraphT. Thanks!
-JamesD