Topological Stuff

Here's a quick and simple algorithm for topological ordering:
(examples to follow)

• Find a node with NO incoming edges, and order it first.
• Delete that node from the graph.
• Repeat.

Source:

• http://www.cs.umd.edu/class/sum2005/cmsc451/topology.pdf
• http://homes.cs.washington.edu/~jrl/421slides/lec5.pdf