{"version":"1.0","type":"link","title":"Dijkstra's algorithm - Newikis","description":"Dijkstra's algorithm (/ˈdaɪk.strəz/, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/5/57/Dijkstra_Animation.gif","thumbnail_width":283,"thumbnail_height":222}