ESSENTIAL ALGORITHMS

Question 1 of 1

  Time Left


0
201977
0
120
block

greedy approach choices at each stage

Match the text (click and drag)   

(0/0)




Match the text

feasible solution

Optimal solution

(locally) optimal

Click and drag

Every sub-path to a particular vertex is a feasible solution

it has to be the best choice among all feasible choices.

sum of the lengths of all paths so far generated should be minimal


201978
0
120
none
201982
0
120
none