I read in Wikipedia about Dijkstra's algorithm. And I have a question: is this algorithm considered as dynamic programming?
Kromster
9,781 7 golden marks 31 silver badge 59 bronze marks
hyperbolator hyperbolator
7 1 bronze sign
|
1 answer
Not. In dynamic programming algorithms, the order of calculation of intermediate results is fixed - here the vertices of the graph are bypassed in an unknown order in advance.
But Dijkstra's algorithm belongs to the class of "Greedy" algorithms.
Pavel Mayorov Pavel Mayorov
48.9k 5 gold signs 51 silver badge 110 bronze marks
|