Description Usage Arguments Value Note Warning Author(s) See Also Examples
A topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge (u->v), u comes before v in the ordering. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering.
1 |
object |
A graph represented as a |
index |
If FALSE, an ordering is returned if it exists and
|
If FALSE, an ordering is returned if it exists and
character(0)
otherwise. If TRUE, the index of the variables
in an adjacency matrix is returned and -1
otherwise.
The workhorse is the topoSortMAT
function which takes an
adjacency matrix as input
Do not use index=TRUE
when the input is a graphNEL
object; the result is unpredictable.
S<f8>ren H<f8>jsgaard, sorenh@math.aau.dk
1 2 3 4 5 6 7 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.