Dijkstra algorithm

translation: choose every correct answer

Consider the following graph G We run it's algorithm for finding shortest paths from vortex a to vertone Labolo (c) and ple are the labels representing the length of the shortent path from a to w and the predecessor of on that path, respectively. Assume that in each step of the algorithm we check the neighbors in alphabetical ordering. By the time the algorythm stops (note that we stop at the moment, when we know that we have just discovered the shortest path from a to 2 b 10 8 3 2 d 1 3 f wytera wyke poprawye The shortest path from a to coven by the writhm is a, f.dic. B. The path from to found by the youth, ) d. oldal .. The path trom(a) to (e found by the algorithms 4,1) + The path from Wak) to Yel) found by the algorithm in (0.0.0 9 Mb)-81 th=10 The algorithm tops when we have considered all neighbors of vertex V) The algorithm stops when we have considered all neighbors of watex V)