C 16 5 10 d C 2 15 12 10 3 e 16 1 5 IZ

Let G be a graph, where each edge has a weight. A spanning tree is a set of edges that connects all the vertices together, so that there exists a path between any pair of vertices in the graph. A minimum-weight spanning tree is a spanning tree whose sum of edge weights is as small as possible. Last week we saw how Kruskal's Algorithm can be applied to any graph to generate a minimum-weight spanning tree. In this question, you will apply Prim's Algorithm on the graph below. You must start with vertex A. H 4 4 1 3 J 2 C 10 4 8 B 9 F 18 8 There are nine edges in the spanning tree produced by Prim's Algorithm, including AB, BC, and IJ. Determine the exact order in which these nine edges are added to form the minimum-weight spanning tree. 3.

Question 4: Find the Shortest Path Tree for the given graph using Dijkstra’s algorithm and writeall the steps. The source is from “Home”

Explain how one can check a graph’s acyclicity by using breadth-first search.