Saved Bookmarks
| 1. |
In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms.Match each algorithm with its time complexity.List-IList-II1.Bellman-Ford algorithmA.O(m log n)2.Kruskal's algorithmB.O(n3)3.Floyd-Warshall algorithmC.O(nm)4.Topological sortingD.O(n+m) |
|
Answer» In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. |
|