Data Structures: Assignment 4 on weighted graphs


  1. Develop Java animation applets for
    1. Dijkstra's shortest path algorithm
    2. Kruskal's minimum spanning tree algorithm
  2. Create random vertices in a bounded region and insert edges randomly (with a coin-toss). Take the edge weights to be the Euclidean distances between the vertices. Change colours of the vertices and the edges to animate the algorithm.
  3. Submit the files and electronically by clicking here. Last date for submission is two days after the last major.
  4. dijkstra.html and and kruskal.html are the html files which will be used to test your applets.
  5. The assignment can be done in groups of two.

Subhashis Banerjee / Dept. Computer Science and Engineering / IIT Delhi / Hauz Khas/ New Delhi 110016 /