Topological sort of a Bayesian network
Topological sort of a Bayesian network.
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 Bayesian network (or a DAG), NA will be returned.
Michail Tsagris.
R implementation and documentation: 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.
y <- pchc::rbn3(100, 20, 0.2) Gtrue <- y$G a <- pchc::pchc(y$x) G <- bnmat(a$dag) topological_sort(G)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.