[Jung-support] [jung - Open Discussion] RE: DijkstraShortestPath && DirectedGraph

[SourceForge.net <no...@so...>]

Read and respond to this message at: 
https://sourceforge.net/forum/message.php?msg_id=2427046
By: e-flat

Vincent:

Are you saying that v.getSuccessors() _always_ returns an empty list when the
graph is directed?  Or does it depend on the graph?

v.getSuccessors() will return an empty list if the v is a sink, i.e., if it
has no out-edges.  In that case the distance from v to anything else is infinity,
by definition.

I would guess that in the case you describe, v is a sink.  

One more question: are you using the most recent release of JUNG?  

Thanks for your feedback--

Joshua

______________________________________________________________________
You are receiving this email because you elected to monitor this forum.
To stop monitoring this forum, login to SourceForge.net and visit: 
https://sourceforge.net/forum/unmonitor.php?forum_id=252062