Stockhub

Dijkstra's algorithm (Q8548)

Item Discussion
Revision as of 22:33, 20 August 2022 by imported>Dj (‎Changed [hu] description: matematikai eljárás a gráf legrövidebb útjának megkeresésére)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
graph search algorithm English
edit
Language Label Description Also known as
British English
Dijkstra's algorithm
No description defined

    Statements

    instance of
    Q21595855 (Deleted Item)
    1 reference
    determination method
    Q1141518 (Deleted Item)
    Q30503704 (Deleted Item)
    1 reference
    determination method
    Q1141518 (Deleted Item)
    Q504353 (Deleted Item)
    1 reference
    determination method
    Q1141518 (Deleted Item)
    algorithm
    1 reference
    determination method
    Q1141518 (Deleted Item)
    Freebase ID
    /m/0cf7t
    1 reference
    stated in
    Q15241312 (Deleted Item)
    publication date
    28 October 2013
    computes solution to English
    Q1058754 (Deleted Item)
    0 references
    pathfinding English
    0 references
    Q105136353 (Deleted Item)
    0 references
    Commons gallery
    Dijkstra's algorithm
    0 references
    Quora topic ID
    Dijkstras-Algorithm-3
    0 references
    image
    Dijkstra Animation.gif
    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) lorsque il a terminé avec les voisins. (français)
    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. (English)
    戴克斯特拉算法运行演示（找到A，B之间的最短路），本算法每次取出未访问结点中距离最小的，用该结点更新其他结点的距离。在演示过程中访问过的结点会被标为红色。 (中文（中国大陆）)
    1 reference
    imported from Wikimedia project
    English Wikipedia
    worst-case time complexity English
    1 reference
    reference URL
    http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.4349&rep=rep1&type=pdf
    0 references
    Rosetta Code ID English
    Dijkstra's_algorithm
    0 references
    Dictionary of Algorithms and Data Structures ID English
    dijkstraalgo
    0 references
    topic's main category
    Q55331669 (Deleted Item)
    0 references
    Microsoft Academic ID
    173870130
    0 references
    based on
    Q325904 (Deleted Item)
    0 references
    derivative work
    Q277680 (Deleted Item)
    0 references
    link-state routing protocol English
    0 references
    Q220169 (Deleted Item)
    0 references
    Q1165964 (Deleted Item)
    0 references
    discovery date
    1959
    1 reference
    stated in
    Q21694527 (Deleted Item)
    GitHub topic English
    dijkstra-algorithm
    1 reference
    reference URL
    https://github.com/topics/dijkstra-algorithm
    title
    dijkstra-algorithm · GitHub Topics · GitHub (English)
    retrieved
    25 July 2021
    dijkstra
    1 reference
    reference URL
    https://github.com/topics/dijkstra
    title
    dijkstra · GitHub Topics · GitHub (English)
    retrieved
    25 July 2021
     
    Retrieved from ‘https://stockhub.co/index.php?title=Item:Q8548&oldid=185231’