List of top Computer Science and IT Engineering Questions on Computer Networks asked in AP PGECET

The Bellman-Ford algorithm is preferred over Dijkstra's algorithm when the graph contains: