Max
generates a maximal graph that induces the same
independence model from a nonmaximal graph.
1  Max(amat)

amat 
An adjacency matrix, or a graph that can be a 
Max
looks for nonadjacent pais of nodes that are connected by
primitive inducing paths, and connect such pairs by an appropriate edge.
A matrix that consists 4 different integers as an ijelement: 0 for a missing edge between i and j, 1 for an arrow from i to j, 10 for a full line between i and j, and 100 for a bidirected arrow between i and j. These numbers are added to be associated with multiple edges of different types. The matrix is symmetric w.r.t full lines and bidirected arrows.
Kayvan Sadeghi
Richardson, T.S. and Spirtes, P. (2002). Ancestral graph Markov models. Annals of Statistics, 30(4), 9621030.
Sadeghi, K. and Lauritzen, S.L. (2011). Markov properties for loopless mixed graphs. Submitted. http://arxiv.org/abs/1109.5909.
1 2 3 4 5 
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.