7511.23If all of the edges are negative, then a smaller number is obtained by pickingmore edges than necessary to span the graph. It is not clear what the desiredanswer should be – (1) the smallest value that spans the graph, even if it is nota tree, or (2)the smallest value with the minimum number of edges requiredto span the tree. If (1), then neither algorithm works since both will givespanning trees, not the graph that spans but with least value. If (2), then the
This is the end of the preview. Sign up
access the rest of the document.