UPatrasGreedy

Link(s)
http://students.ceid.upatras.gr/~papagel/project/kef5_2.htm
Topic(s)
Greedy Algorithms, Algorithmic Techniques



Recommendation
  
Lecture Aide Not Recommended
Self-study Supplement Not Recommended
Standalone Not Recommended
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Applet
Project
UPatras Collection
Project Relationship
Part of collection
Language(s)
English
Author(s)
Drossos Nikolaos, Papagelis Athanasios, Papaioannou Panagiotis
Institution(s)
University of Patras
Activity Level(s)
N/A
Source Code License
N/A
First Published
N/A
Last Modified
N/A

Description
This is a simple web page with a short description of greedy algorithms and a very basic weighted graph visualization that shows the difference between the path chosen by the greedy algorithm and the lowest cost path to the same destination. There are two buttons, one for each path. Clicking a button draws the a line following the given path.
Evaluation
This is only a single page out of a website discussing a number of ways to approach complex problems (greedy algorithms, dynamic programming, heuristics, etc.), and it not really intended to be taken out of the context of the site. Rather than properly examining greedy algorithms, this just shows one example when it doesn’t work. In truth, this could have been done better with a simple labeled graphic. The actual description of how a greedy algorithm works is minimal at best and the description of the specific example presented in the visualization is very poor. In order to motivate the problem, the metaphor of a city is used that has no relationship to the underlying graph and the weights given to it. To make matters worse, for the sake of the example, the greedy algorithm takes the path that leads directly to the “city center”, which is not only the highest cost path (the point of the visualization), but also the highest cost edge out of the start node. It is not made clear why the algorithm picks that edge, especially as it doesn’t continue to follow the shortest path. To make matters worse, the weight labels are all over the place and it is very hard to tell which edges they correspond to. In addition, the one label mentioned in the text doesn’t seem to agree with the label in the diagram. Taken in all, it is not obvious what this would offer to a student.
Usage Notes
Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
15