Topological sorting - related articles and key terms

Related articles: Directed acyclic graph   Depth-first search   Make (software)

Key terms: if   nodes   edges   order   graph   visit   set   algorithm   list   dag   must   topological sort   cycles   unix   note   call   directed   remove   output   empty   example   each node   exists   node n   linear   unique   insert   vertices   list l   already   section   program   depends   solution   possible   described   least one   all nodes   hamiltonian path   scheduling   been visited   partial order   incoming edges


Search external links cited by footnotes on Wikipedia page Topological sorting: