engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Consider an undirected graph with the distinct edge weight having 6 vertices A, B, C, D, E, and F respectively. The minimum cost spanning tree consist of cost from A to B is 9, cost from B to C is 4, cost from F to D is 8, cost from D to E is 6, and cost from C to D is 10. There exists an edge between A and C, B and F, F and E of unknown cost. The total weight of the described graph is ________
1
64
2
37
3
73
4
51