Fastest algorithm can find shortest pass in graph, where edges are equals weight ?

[nicopulse]

Hi,

I search the fastest algorithm can find shortest pass, in oriented graph, where edge are equals weight.

I know some algo : Dijkstra, Belman-Ford, Floyd-Warshall.

But I don't known what is the best when edges have equals weight.

Thanks for your help :)

Nico

[Smac89]

Use Breadth first search, simply iterate until you reach your goal node, that is the shortest path