Data Structures: Assignment 4 on weighted graphs
Assignment
- Develop Java animation applets for
- Dijkstra's shortest path algorithm
- Kruskal's minimum spanning tree algorithm
- 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.
- Submit the files dijkstra.java and kruskal.java
electronically by
clicking here. Last date for submission is two days
after the last major.
-
dijkstra.html and
and
kruskal.html
are the html files which will be used to test your applets.
- The assignment can be done in groups of two.
Subhashis Banerjee / Dept. Computer Science and Engineering / IIT Delhi /
Hauz Khas/ New Delhi 110016 / suban@cse.iitd.ac.in