Dynamic Programming Perspective
From a dynamic programming point of view, Dijkstra's algorithm is a successive approximation scheme that solves the dynamic programming functional equation for the shortest path problem by the Reaching method.
In fact, Dijkstra's explanation of the logic behind the algorithm, namely
Problem 2. Find the path of minimum total length between two given nodes and .
We use the fact that, if is a node on the minimal path from to, knowledge of the latter implies the knowledge of the minimal path from to .
is a paraphrasing of Bellman's famous Principle of Optimality in the context of the shortest path problem.
Read more about this topic: Dijkstra's Algorithm
Famous quotes containing the words dynamic, programming and/or perspective:
“Magic is the envelopment and coercion of the objective world by the ego; it is a dynamic subjectivism. Religion is the coercion of the ego by gods and spirits who are objectively conceived beings in control of nature and man.”
—Richard Chase (b. 1914)
“If there is a price to pay for the privilege of spending the early years of child rearing in the driver’s seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in programming our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.”
—Melinda M. Marshall (20th century)
“I know that you, ladies and gentlemen, have a philosophy, each and all of you, and that the most interesting and important thing about you is the way in which it determines the perspective in your several worlds.”
—William James (1842–1910)