Which Of The Following Statements Is Are True O A Graph With Distinct Edge Weights Has A Unique Minimum Spanning Tree 1 (30.17 KiB) Viewed 56 times
Which of the following statements is/are True? O A graph with distinct edge weights has a unique minimum spanning tree. ("Distinct edge weights" means no two edges have the same weight) O Prim's Algorithm and Kruskal's Algorithm will always return the same Minimum Spanning Tree. OA Minimum Spanning Tree of a connected graph has exactly IV-1 edges, where [V] denotes the number of vertices in this graph.
Suppose we have an undirected graph as shown in the figure, and the circles represent the vertices while the numbers near the edges denote the weights. The edges marked as red form a Minimum Spanning Tree of this graph (may not be the only MST possible). Then what will be the most accurate range for the weight x of edge CF among all the choices? O x≤7 O x≤8 1 O 7≤x≤8 O x≤9 B A 9 5 E 3 8 6 F X 15 7
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!