## Discussion Forum

Que. | Match the following:
a. Prim’s algorithm i. O(V^2E) b. Bellman-Ford algorithm ii. O(VE lgV) c. Floyd-Warshall algorithm iii. O(E lgV) d. Johnson’s algorithm iv. O(V^3) Where V is the set of nodes and E is the set of edges in the graph. Codes : a b c d |

a. | i iii iv ii |

b. | i iii ii iv |

c. | iii i iv ii |

d. | iii i ii iv |

Answer:iii i iv ii |