Dijkstra's algorithm: Dijkstra’s algorithm is a graph search algorithm

Dijkstra’s algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge weights. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. In just 20 minutes, Dr. Dijkstra designed one of the most famous algorithms in the history of Computer Science. Basics of Dijkstra's Algorithm Dijkstra's Algorithm basically starts at the node that you choose (the source node) and it analyzes the graph to find the shortest path between that node and all the other nodes in the graph. Learn how to find the shortest path between two vertices of a graph using Dijkstras algorithm. See the algorithm, C code, and output example with a 6x6 graph. Learn how Dijkstra's algorithm finds the shortest path from one vertex to all other vertices in a graph. See examples, animations, code and a detailed run through of the algorithm.