Recommendation: Has Potential.
Description: User clicks on nodes of the graph in order that they are processed.
Evaluation: (Note that there is also a 'heap version' for this exercise, but that one is incomprehensible.) This is a great idea to have users show proficiency in the algorithm by processing the graph. But the implementation does not quite work out. The big problem is that the edge distances are not shown on the graph. They are shown in an adjacency list, but it is extremely difficult for users to integrate that information to pick the next vertex. The graph layouts are poor, and it would not be a simple thing to label the edges with their distances.