Question

Please state the worst case run time for the following and when to use it!

1. Dijksta's Algorithm

2. Bellman-Ford Algorithm

3.DAG Algorithm

4. Prim's Algorithm

5. Kruskal's Algorithm

6. Baruvka's algorithm

Answer 1

PLEASE FIND THE ANSWER(S) and EXPLANATION BELOW.

Comparison of Algorithms

Algorithm	Worst Case Complexity	When to use
1. Dijkstra's Algorithm	O(E log V) where E=number of edges V = number of vertices	When we want to find the shortest path between two nodes from a start node to an end node, we use the Dijkstra algorithm.
2. Bellman-Ford Algorithm	O(V*E) where E=number of edges V = number of vertices	When we want to find the shortest path between a start vertex and all other vertices. We can use it for both directed and undirected graphs.
3. DAG Algorithm	O(E+V log V) where E=number of edges V = number of vertices	DAG means Directed Acyclic Graph. This is used for the Topological sorting of the nodes.
4. Prim's Algorithm	O(E+log V) where E=number of edges V = number of vertices	Prim's Algorithm is used to find the minimum spanning trees in a graph.
5. Kruskal's Algorithm	O(E log E) where E=number of edges V = number of vertices	Kruskal's Algorithm is used to find the minimum spanning trees of a graph.
6. Baruvka's algorithm	O(E log V) where E=number of edges V = number of vertices	Barukva's algorithm is a Greedy algorithm used for finding the Minimum Spanning Trees (MST) of a graph.

If there are any doubts, comment down here. We are right here to help you. Happy Learning..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. It really Boosts us..!! PLEASE give an UPVOTE I Have Put a lot of EFFORT in solving Your Problem. , It really Boosts us..!!