Question

Convert the given graph with weighted edges to minimal spanning tree, by using Prim’s and Kruskal’s algorithm. A B C D E F A 0 4 4 0 0 0 B 4 0 0 2 2 0 0 0 0 C 4 2 0 3 4 2 D 0 0 3 0 3 0 E 0 0 4 3 0 3 F 0 3 0 Does the MST of a graph give the shortest distance between any two specified nodes? Justify your answer.

chahte kya ho tum mar jau tab khush ho jaoge ​

Answer 1

Answer:

first convey your message name