Kruskal's Minimum Spanning Tree Algorithm Assignment

Assignment Task

Consider the following Graph:

Figure 1: Graph for Problem 3(a) and 3(b)

a) Write Kruskal's algorithm and Prim's algorithm to find the minimum cost-spanning tree of the graph given in Figure 1. Show all the steps of computation. Also, compute the time complexity of both algorithms.

b) In Figure 1, find the shortest path from the vertex ‘a' using Dijkstra's shortest path algorithm. Show all the steps of computation. Also, find the time complexity of the algorithm.

This Engineering has been solved by our PHD Experts at My Uni Paper.