Question: data structure course a. Write the Weighted Adjacency Matrix of the following graph (3 Marks) A B -5 14 >75 3 V -2 6 3


![6 3 10 -12 F -8 K WM[0] A B D E](https://s3.amazonaws.com/si.experts.images/answers/2024/09/66e17a6dc0214_97366e17a6d71dfd.jpg)
data structure course
a. Write the Weighted Adjacency Matrix of the following graph (3 Marks) A B -5 14 >75 3 V -2 6 3 10 -12 F -8 K WM[0] A B D E F K L B D E F L b. Find the shortest path starting from node W (4 Marks) X 12 13 R Node From node W to other nodes X U K R M N Y Best c. Find the MST ( for the graph in b) starting from node W From node To node
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
