Question 2.97
67. Would there ever be a reason to find a minimum-cost spanning tree for a weighted graph in which the weights on some of the edges were negative? Would Kruskal’s algorithm still apply?
67.
Yes; yes
67. Would there ever be a reason to find a minimum-cost spanning tree for a weighted graph in which the weights on some of the edges were negative? Would Kruskal’s algorithm still apply?
67.
Yes; yes