Trakla - DFS and BFS
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Ville Karavirta; Ari Korhonen; Lauri Malmi; Kimmo Stålnacke |
||||
Institution |
Helsinki University of Technology |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Exercises related to DFS and BFS in graphs. User clicks on nodes in order that they are visited. |
||||
Evaluation |
This is a great idea to have users show proficiency in the algorithm by processing the graph. But the implementation needs a lot of work. It is very difficult to keep track of what nodes are active and which are not. The exercise desperately needs to show the current state of the queue or recursion stack, as appropriate. The graphs used as examples are not well drawn, and it is often hard to see which nodes are connected to what others. |
||||
Canned Data; Predictions |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-29 |
||||
Last Visited |
2008-07-29 |
||||
Last Updated |
2006-01-25 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
