Jump to content

Dijkstra's algorithm

Page contents not supported in other languages.

graph search algorithm

media legend: L'algorithme de Dijkstra pour trouver le chemin le plus court entre a et b. Il choisit le sommet non visité avec la distance la plus faible, calcule la distance à travers lui à chaque voisin non visité, et met à jour la distance du voisin si elle est plus petite. Il marque le sommet visité (en rouge) lorsqu'il a terminé avec les voisins., Dijkstra's algorithm to find the shortest path between a and b. It picks the unvisited vertex with the lowest distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller. Mark visited (set to red) when done with neighbors., 戴克斯特拉算法运行演示(找到A,B之间的最短路),本算法每次取出未访问结点中距离最小的,用该结点更新其他结点的距离。在演示过程中访问过的结点会被标为红色。

External resources

Freebase ID
Microsoft Academic ID
Dictionary of Algorithms and Data Structures ID
Quora topic ID
GitHub topic
OpenAlex ID
Rosetta Code page ID
MathWorld ID
Brilliant Wiki ID

instancë e

pathfinding algorithm[5]
graph algorithm[5]
greedy algorithm[5]

emëruar prej

Edsger W. Dijkstra

bazuar në

breadth-first search

punë rrjedhore

A* search algorithm
link-state routing protocol
Intermediate System to Intermediate System

zbulues

Edsger W. Dijkstra

koha e zbulimit apo shpikjes

1959[6]

computes solution to

shortest path problem
pathfinding
single-source shortest path problem

worst-case time complexity

[7]

përdorën

graph data structure

mirëmbahet nga WikiProjekti

WikiProject Mathematics

formë tjetër

Dykstra's projection algorithm[8]

Galeria në Commons

Dijkstra's algorithm

kategoria në Commons

Dijkstra's algorithm

kategoria kryesore

Category:Dijkstra's algorithm

Reference

  1. ^ Freebase Data Dumps, 28 tetor 2013
  2. ^ https://github.com/topics/dijkstra-algorithm, dijkstra-algorithm · GitHub Topics · GitHub, 25 korrik 2021
  3. ^ https://github.com/topics/dijkstra, dijkstra · GitHub Topics · GitHub, 25 korrik 2021
  4. ^ OpenAlex, 26 janar 2022, https://docs.openalex.org/download-snapshot/snapshot-data-format
  5. ^ a b c d Introduction to Algorithms
  6. ^ A note on two problems in connexion with graphs
  7. ^ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.4349&rep=rep1&type=pdf
  8. ^ Dykstra's projection algorithm