TopologicalSort - Algoviz Wiki

Works

Yes

Description

From a choice of two graphs, user sees an animation showing queue-based topological sort. That is, the algorithm first counts the in-degree of each node, then starts pulling off and processing 0-degree nodes. User can select random graphs from one of two sizes.

Evaluation

Can view this as a straight animation (not recommended) or by steps. Unfortunately, it is a little tricky to figure out how to get it into step mode. No explanation of the process is given, so it is hard to tell what is going on.

Animation; Step Control; Random Data

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2006-09-01

Last Visited

2008-07-02

Last Updated

2006-04-05

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.animal.ahrgr.de/showAnimationDetails.php3?anim=55

Edit

You may edit this entry if you have an account.

Animal - Topological Sort

Recommendation

Has Potential

Link

Delivery Method

Animal Animation

License

Non-Commercial

Language

English; German

Author

Guido Rössling

Institution

TU Darmstadt, Darmstadt, Germany

Project

Animal

Works

Yes

Description

Presents a slideshow walking through an example of topological sort.

Evaluation

Rather minimal presentation, no pseuodcode. Gives brief description of major steps, and goes through an example highlighting nodes/edges in array. Will not be sufficient as standalone material, but might be useful as a lecture aid.

Animation; Step Control; Canned Data

Lecture Aid

Screenshots

Videos

References

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

First Visited

2007-07-21

Last Visited

2010-02-05

Last Updated

1999-05-11

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://research.cs.vt.edu/AVresearch/Swan/

Edit

You may edit this entry if you have an account.

Swan - Topological Sort

Recommendation

Has Potential

Link

Delivery Method

Windows Application

License

GPL

Language

English

Author

Jun Yang; Cliff Shaffer

Institution

Virginia Tech

Project

Swan

Works

Yes

Description

Demonstrates depth-first search-based topologoical sort algorithm. User steps through the algorithm, and is given some feedback on what is happening at each step.

Evaluation

The feedback could be more clear, to give the user a better idea of what is going on. This AV would be most useful as either a lecture aid, or self-study by somebody who has read about the algorithm and needs to solidify their understanding. In theory, you can add new graphs by creating files external to the program, but in practice most users will need to load one of the supplied data files (though how this is done is not sufficiently clear from the program). One very nice feature of this AV is the fact that you can see the adjacency list or adjacency matrix representations for the graphs. That doesn't help with understanding topological sort, but it does help with understanding those representations.

Step Control; Canned Data

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2006-11-08

Last Visited

2008-07-02

Last Updated

1996

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://users.uom.gr/~thanasis/JAVENGA.html

Edit

You may edit this entry if you have an account.

JAVENGA Topological Sort

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Baloukas Athanasios

Institution

University of Macedonia, Department of Applied Informatics, Thessaloniki, Greece

Project

JAVENGA

Works

Yes

Description

The software features static visualizations for Graph and Network Algorithms. More specifically it illustrates: BFS and DFS traversals; topological sorting; various shortest path algorithms; Minimum Spanning tree algorithms of Prim and Kruskal; and the Primal Network Simplex Algorithm for the balanced Minimum Cost Network Flow Problem.

Evaluation

Teaching the Concept; Exploring the Concept

Screenshots

Videos

References

You can use this as a Java Applet (click on link above) or get the Java .jar file at http://users.uom.gr/~thanasis/JAVENGA.html. When you open the applet, you must first enter a graph using the graphical editor (first 3 buttons at the top). You can view the graph representation (4th button). You can choose an algorithm to run (rightmost button at top). It doesn't appear that you can run an algorithm until you have actually created a graph using the editor.

First Visited

2009-09-02

Last Visited

2009-09-02

Last Updated

2009

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.