wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

topological_sorting (483B)


      1 # Topological sorting
      2 
      3 Problem on [directed_graphs]: find a [total_order] on the graph vertices such that whenever u has a path to v then u comes before v in the order
      4 - only possible, as stated, when the graph is a [DAG]
      5 
      6 https://en.wikipedia.org/wiki/Topological_sorting
      7 
      8 - [constrained_topological_sorting]
      9 
     10 Up: [graph_algorithm], [directed_acyclic_graph]
     11 
     12 See also: [strongly_connected_component_algorithm]
     13 
     14 Aliases: topological sort, topological ordering, topological orderings