DSA Lab 8 Fall 2009, 10/21/09

This lab is about Greedy Algorithm.
  1. 5.14 (DG)
  2. 5.21 (DG) - (Hint: The Feedback edge set in an undirected graph is the set of edges not in the spanning tree. Therefore, the sum of costs of the feedback edge set will be the smallest cost when the sum of tree edges have the highest value. )
  3. 5.18 a (DG) - For this you can use the code Huffman Code and have the appropriate input. (b-d are Home Work 8 problems.)
  4. Spanning Tree Game problem to get an intuition how to build spanning tree.