Given a graph, this function returns the order the vertices are exited in a depth-first traversal.
(igraph) The graph.
(integer) A vertex where the traversal should start.
A postorder is not always unique. For an acyclic graph, reversed postorder is equivalent to a topological sort.
(integer) A postorder of the graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.