00:01
Which of the following statements are incorrect? and we've got four to analyze here.
00:13
So let's go through them one at a time.
00:17
The first one, in an undirected graph g, if all edges have different positive weights, then the minimum cost spanning tree of graph g is unique.
00:25
This is correct, so don't check it.
00:27
In an undirected graph with all edges having different positive weights, the minimum spanning tree is unique.
00:33
This property is known as the cut property.
00:36
Which states that if we sort the edges by weight, the edge of least weight that does not create a cycle in the spanning tree is always part of the minimum spanning tree.
00:44
Since all edge weights are unique, there can be only one such edge for each subset of vertices.
00:50
The second statement, if there is a cycle of weight 0 in an indirected graph g, then we cannot find the shortest path using the bellman -ford algorithm.
00:57
This is incorrect, so we will select the second one...