Estimate the running time of your algorithm. Estimate it also when it is known that d is an upper bound on the outdegree of the points of G and l is an upper bound on the number of edges on any shortest path in G.

True

Explanation:

Both algorithms are guaranteed to produce the same shortest-

path weight, but if there are multiple shortest paths, Dijkstra’s will choose the

shortest path according to the greedy strategy, and Bellman-Ford will choose the

shortest path depending on the order of relaxations, and the two shortest path

trees may be different.

answerfc- file compare;