Given the following adjacency matrix a. b. C. ABCDEFGH A09800000 B|90|0|50 460 C|80|0|0|81|0|0 DO 5000000 E00800060 F|04

[answerhappygod]

Given The Following Adjacency Matrix A B C Abcdefgh A09800000 B 90 0 50 460 C 80 0 0 81 0 0 Do 5000000 E00800060 F 04 1 (45.5 KiB) Viewed 28 times

Given the following adjacency matrix a. b. C. ABCDEFGH A09800000 B|90|0|50 460 C|80|0|0|81|0|0 DO 5000000 E00800060 F|04|1|0|0|0|80 G0600 6805 0 5 0 H00 0 0 0 (5 points) Draw the undirected graph based on the adjacency matrix above. (5 points) Find the Minimum Spanning Tree (MST) by using Prim's algorithm. Show the each step by step process of selecting the edges and draw the resulting spanning tree. (5 points) Find the shortest path from node A to node H by using Dijkstra algorithm. Please show the step by step process by completing the table below. Write down the resulting shortest distance and shortest path. Vertex Cost Previous Path A B с D E F G H