postorder: Postorder of a Graph

Description Usage Arguments Details Value

View source: R/igraph.R

Description

Given a graph, this function returns the order the vertices are exited in a depth-first traversal.

Usage

1
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 July 17, 2018, 4:16 a.m.