Re: [jgrapht-users] DijkstraShortestPath inefficient for (start, *) ?

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

kevin brintnall wrote:
> On Thu, Oct 22, 2009 at 07:37:15PM -0700, John V. Sichi wrote:
>> The Dijkstra API class is just a thin wrapper around 
>> ClosestFirstIterator, which already provides what you need (as well as 
>> the MST), though not perfectly wrapped.
> 
> John,
> 
> You're right; that's probably what I'll end up doing.
> 
> Do you think it makes sense to modify/augment JGraphT's existing Dijkstra
> module to do this?  Or add a second Dijkstra implementation to JGraphT?
> This seems like a common use case.

If someone wants to work out a clean interface for it, we can certainly 
add it in.

JVS