edited by
840 views
0 votes
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)
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
4