Dijkstra's algorithm

Show Summary Details

Quick Reference

A method, developed by E. W. Dijkstra in 1959, to find the shortest path from a specified vertex in a weighted graph to all other vertices in the graph.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.