Dijkstra's algorithm
id:
dijkstra-s-algorithm-162-12969709
title:
Dijkstra's algorithm
text:
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Dijkstra's algorithm finds the shortest path from a given source node to every other node. It can also be used to find the shortest path to a specific destination node, by terminating the algorithm once the shortest path to the destination node is k
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for finding shortest paths
original url:
https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
date created:
2002-03-01T11:41:14Z
date modified:
2024-08-27T22:40:25Z
main entity:
{"identifier":"Q8548","url":"https://www.wikidata.org/entity/Q8548"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/57/Dijkstra_Animation.gif","width":283,"height":222}
fields total:
13
integrity:
16