Discussion Forum
Que.  The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively)
a. Bellman Ford algorithm 1. O (m log n) b. Kruskals algorithm 2. O (n3) c. Floyd Warshall algorithm 3. O(mn) d. Topological sorting 4. O(n + m) Codes : a b c d 
a.  3 1 2 4 
b.  2 4 3 1 
c.  3 4 1 2 
d.  2 1 3 4 
Answer:3 1 2 4
