For all pairs shortest paths you could use Floyd Warshall. For single source shortest paths, you can use Dijkstra's Algorithm, or even Bellman Ford algorithm if negative cost cycles are allowed. ----- Original Message ----- From: "TheTravellingSalesman" <[EMAIL PROTECTED]> To: "Algorithm Geeks" <[email protected]> Sent: Monday, August 20, 2007 10:50 AM Subject: [algogeeks] Fastest known implementation and algorithm for the shortest path
> > I'm trying to implement this in java. > > Given N nodes and M arcs, whats the fastest known implementation for > the shortest path. > > I'm currently making use of the jgrapht library for java. The link is > given below. > > http://jgrapht.sourceforge.net/ > > Any suggestion will be much appreciated. > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
