Menu
I recently asked a question about one of the Dijkstra’s algorithms (shunting-yard). But almost everyone thought "Dijkstra's algorithm" meant his shortest path algorithm.
What other algorithms has Dijkstra developed?
884
Dijkstra's algorithm is the iterative algorithmic process to provide us with the shortest path from one specific starting node to all other nodes of a graph. It is different from the minimum spanning tree as the shortest distance among two vertices might not involve all the vertices of the graph.
Dijkstra's Algorithm finds the shortest path between a given node (which is called the "source node") and all other nodes in a graph. This algorithm uses the weights of the edges to find the path that minimizes the total distance (weight) between the source node and all other nodes.
One of these is known as Dijkstra's algorithm. It was designed by Dutch physicist Edsger Dijkstra in 1956, when he thought about how he might calculate the shortest route from Rotterdam to Groningen. Dijkstra's algorithm works on a weighted graph, such as the one shown above.
You can return distance between two nodes, distances between a node and all other nodes, distance and a path, distance and a previous node (which is enough to construct a path). So in the case of wikipedia article - it returns you distances to all vertices and what is the previous vertex in the path to get your path.
192
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
