Description Usage Arguments Details Value Examples
View source: R/graph.utility.R
Nodes of a graph are sorted according to a lexicographical topological ordering.
1 |
g |
an object of class |
A topological sorting is a linear ordering of the nodes such that given an edge from
u
to v
, the node u
comes before node v
in the ordering.
Topological sorting is not possible if the graph g
is not a DAG.
To implement the topological sorting algorithm we applied the Kahn’s algorithm.
a vector in which the nodes of the graph g
are sorted according to a lexicographical topological order.
1 2 | data(graph);
T <- lexicographical.topological.sort(g);
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.