Option 2 is talking about minimum spanning tree not the shortest path

Dark Mode

508 views

0 votes

How many of following are correct statements ?

(i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v

(ii)adding a number w on weight of every edge of graph might change the graph’s minimum spanning tree(Assume that all edge weights of graph are distinct)

(iii)multiplying all edge weights by a positive number might change the shortest path between two vertices u and v (Assume that all edge weights of graph are distinct)

(i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v

(ii)adding a number w on weight of every edge of graph might change the graph’s minimum spanning tree(Assume that all edge weights of graph are distinct)

(iii)multiplying all edge weights by a positive number might change the shortest path between two vertices u and v (Assume that all edge weights of graph are distinct)