Let Tsp be the tree of shortest paths of the below graph (G1) starting from vertex A and let TMST be a minimum spanning tree of (G1). Circle the only assertion that is FALSE 24 18. A 14 19 30 15 20 16...

Extracted text: Let Tsp be the tree of shortest paths of the below graph (G1) starting from vertex A and let TMST be a minimum spanning tree of (G1). Circle the only assertion that is FALSE 24 18. A 14 19 30 15 20 16 Both Tsp and TMST Contain the two edges of weight 6 Tsp and TMST have the same number of edges O Tsp and TMST have six edges in common The shortest path between A and H uses exactly 4 edges


Extracted text: Both Tsp and TMST Contain the two edges of weight 6 Tsp and TMST have the same number of edges Tsp and TMST have six edges in common The shortest path between A and H uses exactly 4 edges For graph G1 and starting from vertex A, the order in which vertices join the cloud in Dijkstra algorithm and in Prim-Jarnik algorithm is NOT the same