Bellman-Ford Algorithm
Q1. What will be the average time complexity of the Bellman-ford algorithm if the time taken to realx an edge is O(log V)?
Q2. We can use Bellman-Ford algorithm to detect negative weight cycles in a graph.
Q3. The shortest distance between node 0 and 3 is :
Q4. The shortest distance between node 0 and 3 is :
Q5. The cost of the longest shortest-path between Node 0 and some Node v in an undirected graph with all edge costs being 2 will never be more than(|E| is the total number of edges)