Dijkstra's algorithm: Difference between revisions

Revision as of 20:36, 2 May 2004

Revision as of 09:51, 3 May 2004

Line 1:

[[de:Algorithmus von Dijkstra]] [[fr:Algorithme de Dijkstra]] [[ja:ダイクストラ法]]

[[pl:algorytm Dijkstry]]

'''Dijkstra's [[algorithm]]''', named after its inventor the Dutch [[computer science|computer scientist]] [[Edsger Dijkstra]], solves the [[shortest path problem]] for a directed [[graph theory|graph]] with nonnegative [[edge]] weights.