Homework problem P on Minimum Spanning Trees

Due Nov 13.

Weights, limited.

  1. (5 points) Exercise 23.2-4

  2. (5 points) Exercise 23.2-5
Hints: In these situations sorting can be done in linear time (cf. counting sort in section 8.2). The stronger analysis of Union-Find comes into play. A limited range of keys may allow the design of a faster priority queue, including decrease key.