Question: data structure course QUESTION 3 Q3) (10 Marks - Suggested time: 35 minutes) a. Write the Weighted Adjacency Matrix of the following graph (3 Marks)
data structure course



QUESTION 3 Q3) (10 Marks - Suggested time: 35 minutes) a. Write the Weighted Adjacency Matrix of the following graph (3 Marks) B 14 >15 3 > -2 E 3 10 8 K 1 WM[] A B D E F L A B D E F L b. Find the shortest path starting from node W (4 Marks) 12 14 3 12 N Node From node W to other nodes U 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
