i. Draw the graph with edge weightings enumerated on your assignment submission.
ii. Use Prim’s algorithm to find a minimum spanning tree. Specify your starting vertex.
iii. Use Kruskal’s algorithm to find a minimum spanning tree.
iv. Use Dijkstra’s algorithm to find the shortest path from the start to all the other
vertices. Give the full details of the path to the finish.
v. Write down the adjacency matrix, 𝐴𝐴, for the graph and then determine 𝐴𝐴3. How many
triangles does the graph contain?
and few simillar
