postorder: Postorder of a Graph
In nick-ulle/ast: Low-level Static Analysis Tools for R Code
postorder R Documentation
Postorder of a Graph
Description
Given a graph, this function returns the order the vertices are exited in a
depth-first traversal.
Usage
postorder(g, root)
Arguments
g
(igraph) The graph.
root
(integer) A vertex where the traversal should start.
Details
A postorder is not always unique. For an acyclic graph, reversed postorder
is equivalent to a topological sort.
Value
(integer) A postorder of the graph.
nick-ulle/ast documentation built on May 14, 2024, 7:40 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| postorder | R Documentation |
Postorder of a Graph
Description
Given a graph, this function returns the order the vertices are exited in a depth-first traversal.
Usage
postorder(g, root)
Arguments
g |
(igraph) The graph. |
root |
(integer) A vertex where the traversal should start. |
Details
A postorder is not always unique. For an acyclic graph, reversed postorder is equivalent to a topological sort.
Value
(integer) A postorder of the graph.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.