You can help the community by contributing reviews and ratings to the catalog.
Here is a detailed description for the catalog entry structure.
UPatrasGreedy
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
Drossos Nikolaos; Papagelis Athanasios; Papaioannou Panagiotis |
||||
Institution |
University of Patras |
||||
Project |
UPatras Collection |
||||
Works |
Yes |
||||
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. |
||||
|
|||||
Nothing |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2007 |
||||
Last Visited |
2008-04-24 |
||||
Last Updated |
1997 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
UPatrasOrdering
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
|
||||
License |
|
||||
Language |
English |
||||
Author |
|
||||
Institution |
University of Patras |
||||
Project |
UPatras Collection |
||||
Works |
|
||||
Description |
Greedy ordering of tasks. |
||||
Evaluation |
|
||||
|
|||||
|
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
|
||||
Last Visited |
|
||||
Last Updated |
|
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
ALVIE - First Fit
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
By Request |
||||
Language |
English |
||||
Author |
Pilu Crescenzi |
||||
Institution |
University of Florence |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Walkthrough showing the first-fit binpacking algorithm. |
||||
Evaluation |
Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
http://sites.google.com/site/alviehomepage/alvie3/downoads/firstFitDecreasing.swf |
||||
References |
|
||||
Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons. |
|||||
First Visited |
2010-01-29 |
||||
Last Visited |
2010-01-29 |
||||
Last Updated |
2009-12-20 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
ALVIE - Greedy Algorithm for Graph Coloring
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
By Request |
||||
Language |
English |
||||
Author |
Pilu Crescenzi |
||||
Institution |
University of Florence |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Walkthrough showing the greedy algorithm for coloring Interval Graphs. |
||||
Evaluation |
Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
http://sites.google.com/site/alviehomepage/alvie3/downoads/intervalGraphColoring.swf |
||||
References |
|
||||
Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons. |
|||||
First Visited |
2010-01-29 |
||||
Last Visited |
2010-01-29 |
||||
Last Updated |
2009-12-20 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
ALVIE - Greedy Algorithm for Independent Set
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
By Request |
||||
Language |
English |
||||
Author |
Pilu Crescenzi |
||||
Institution |
University of Florence |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Walkthrough showing the greedy algorithm for finding the independent set in an Interval Graph. |
||||
Evaluation |
Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
http://sites.google.com/site/alviehomepage/alvie3/downoads/intervalGraphIndependentSet.swf |
||||
References |
|
||||
Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons. |
|||||
First Visited |
2010-01-29 |
||||
Last Visited |
2010-01-29 |
||||
Last Updated |
2009-12-20 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |