Hi all,

I need recommendation for a very fast shortest path algorithm. The

edges are all directed, positive weights. Dijkstra shortest path will

solve it just fine but the if the graph is not parse then it takes about

O(N^2) where N is the # of vertices, too much for large graphs.

Furthermore, I don't need to know the all the path from a start point to

every other single vertex as Dijkstra would provide. Just the shortest

path from a start point to a defined end point.

What other algorithms I can use ? Thanks in advance,