greedy_partition: Uses the estimated posteriors for each sibgroup to come up...

Description Usage Arguments

Description

Used internally. This is a quick and dirty greedy thing. It basically orders sibships by posterior and then by size, and then it goes through and calls them sibships starting with the highest posterior ones. If it reaches one that includes someone that is already in a sibship it discards it and continues. At the end, any one not assigned to a sibship is made a singleton.

Usage

1

Arguments

VS

A vector of counts of the number of times each sibship was visited. The sibships are named according to who is in them via the hashable_sibships function.


eriqande/fullsniplings documentation built on May 16, 2019, 8:45 a.m.