View source: R/topological_sort.R
Topological sort of a DAG | R Documentation |
Topological sort of a DAG.
topological_sort(dag)
dag |
A square matrix representing a directed graph which contains 0s and 1s. If G[i, j] = 1 it means there is an arrow from node i to node j. When there is no edge between nodes i and j if G[i, j] = 0. |
The function is an R translation from an old matlab code.
A vector with numbers indicating the sorting. If the matrix does not correspond to a DAG, NA will be returned.
Ioannis Tsamardinos and Michail Tsagris
R implementation and documentation: Ioannis Tsamardinos <tsamard@csd.uoc.gr> and Michail Tsagris mtsagris@uoc.gr
Chickering, D.M. (1995). A transformational characterization of equivalent Bayesian network structures. Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, Montreal, Canada, 87-98.
plotnetwork, nei, pc.or
# simulate a dataset with continuous data # simulate a dataset with continuous data G = rdag(100, 10, 0.3)$G G[G == 2] <- 1 G[G == 3] <- 0 topological_sort(G)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.