Data Str & Algorithm HW Solutions 75

Data Str & Algorithm HW Solutions 75 - 75 11.23 If...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
75 11.23 If all of the edges are negative, then a smaller number is obtained by picking more edges than necessary to span the graph. It is not clear what the desired answer should be – (1) the smallest value that spans the graph, even if it is not a tree, or (2)the smallest value with the minimum number of edges required to span the tree. If (1), then neither algorithm works since both will give spanning trees, not the graph that spans but with least value. If (2), then the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online