implement Dijkstra$$s shortest$-$path algorithm and Prim$$s minimum$-$spanning$-$tree algorithm.$$

Assume adjacency list representations of the input graphs.

Implement the fringe data structure as both a binary heap and a linked list. Compare the two methods.

Show each major iteration of the algorithms using animation. Save these animations as $.$gif or $.$png files and zip them into a folder with your project report.

Have a user interface in which you can incrementally add edges to the graph and update the trees accordingly.