nwfsort) and for
making a network family unique (see nwfunique) are available.networkfamily(data,nw=network(data), prior=jointprior(nw),
trylist=rep(list(NULL),nw$n), timetrace=TRUE)
## S3 method for class 'networkfamily':
print(x,...)
## S3 method for class 'networkfamily':
plot(x,layout=rep(min(1+floor(sqrt(length(nwf))),5),2),
cexscale=5,arrowlength=0.1,scale=10,sscale=.7*scale,...)jointprior.maketrylist.plot.networkplot.networkplot.networkplot.networkplot.network.networkfamily returns list with two componentsmaketrylist).networkfamily generates and learns all possible networks with
the nodes given as in the initial network nw. This is done by
successively trying to generate the networks with all possible arrows
to/from each node (see addarrows). If there is a ban list
present in nw (see network), then this is
respected.
After generation of all possible networks, a test for cycles (see
cycletest) is performed and only networks with directed
acyclic graphs are returned and learned.network,
genlatex,
heuristic,
nwfsort,
nwfunique,
elementin,
addarrows,
cycletestdata(rats)
allrats <- networkfamily(rats)$nw
plot(allrats)
print(allrats)Run the code above in your browser using DataLab