break_cycles: Break cycles to produce a DAG Given a set of arcs of a...
In robertness/bninfo: Queries and information theoritic operations on Bayesian networks.
Description
Break cycles to produce a DAG
Given a set of arcs of a directed graph, if the arcs contain a cycle,
break the cycle by reversing low probability arcs.
Usage
1
break_cycles(arc_list, probabilities = NULL)
Arguments
arc_list
a list of arcs/edges from a directed graph structure
probabilities
associated with the arcs. The algorithm will prioritize
low probability edges for reversal.
white_list
a list of arcs/edges that are not to be broken.
robertness/bninfo documentation built on May 27, 2019, 10:32 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
Break cycles to produce a DAG Given a set of arcs of a directed graph, if the arcs contain a cycle, break the cycle by reversing low probability arcs.
Usage
1 | break_cycles(arc_list, probabilities = NULL)
|
Arguments
arc_list |
a list of arcs/edges from a directed graph structure |
probabilities |
associated with the arcs. The algorithm will prioritize low probability edges for reversal. |
white_list |
a list of arcs/edges that are not to be broken. |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.