Orders a pedigree (parents before offspring) using Kahn's Algorithm.
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.
Kahn, Arthur B. (1962), "Topological sorting of large networks", Communications of the ACM
1 2 3 4 5 6
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.