Computes a topological ordering of the nodes, i.e., a number for each node such that every node's number is smaller than the one of all its descendants. Bidirected edges (<->) are ignored.
the input graph, a DAG
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.