Re: [jgrapht-users] Dijkstra, FloydWarshall or Edmonds?

[André <akr...@on...>]

First of all: thank you for answering. I was not aware of the answer as i
just sent the mail to the mailing list that time and never got any
feedback...

That time I even had not subsribed to the list. Don't know why it was
submitted to be honest...

Anyway: In the mean time I found the following aproach that works for me:

I use a ClosestFirstIterator and whenever it comes to an endVertex I find
the (shortest) path (edgeList) from that vertex to the source. I get the
average length (cost) of that path with
iterator.getShortestPathLength(endVertex) / edgeList.size().

When the iteration is done I keep the smallest avarage cost as the result...

I think this is more or less what you described with you hints.
BTW: It's not a school assingment :-)

André


-- 
View this message in context: http://n3.nabble.com/Dijkstra-FloydWarshall-or-Edmonds-tp696330p721340.html
Sent from the jgrapht-users mailing list archive at Nabble.com.