whichGraphsNotNeighbours: Identify neighbouring graphs.

Description Usage Arguments Value See Also

View source: R/mcmc-mj.R

Description

Finds which of the supplied graphs are not neighbours. Neighbouring graphs are removed according to a heuristic involving scores.

Usage

1
  whichGraphsNotNeighbours(x, logScores, verbose = F, head)

Arguments

x

A list of graphs

logScores

A numeric vector containing the log score of the corresponding graph in x

verbose

Should verbose output be shown. A logical of length 1.

head

The rank of the worst graph to return.

Value

A numeric vector, giving the indicies x which are not neighbours.

See Also

BNSamplerMJ


rjbgoudie/structmcmc documentation built on Nov. 3, 2020, 3:41 a.m.