getOrdPed: Orders a pedigree (parents before offspring) using Kahn's...
In BrnCPrz/PedyR: Handles genealogical structured data

Description Usage Arguments Details Value References Examples

Orders a pedigree (parents before offspring) using Kahn's Algorithm.

1	getOrdPed(pedigree, verbose = FALSE)

pedigree

data.frame with three columns: id, sire and dam

Kahn's algorithm is a topological sorting method commonly applied to networks. It's only feasible for acyclic directed graphs, so any cycles (ex. an individual that has itself as a parent) will return an error and must be corrected.

Integer vector

Kahn, Arthur B. (1962), "Topological sorting of large networks", Communications of the ACM

id = c("A","B","C","D","E","F","G","H","I","J","K")
sire = c("0","0","0","0","A","A","C","A","G","G","A")
dam = c("0","0","0","0","B","H","D","D","B","E","H")
ped = as.data.frame(cbind(id,sire,dam))
newOrd = getOrdPed(ped)
pedReord = ped[ped$id[c(newOrd)],]