Topological sorting
DAG == directed acyclic graph
pick an arbgitrary minimal element
delete minimal element and any edges incident on it
repeat until all vertices included
Return to CIS 350 Index Page
