The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
|Answer» B. false|
|Explanation: the number of iterations involved in bellmann ford algorithm is more than that of dijkstra’s algorithm.|
Login to Continue
It will take less than 2 minutes