getDegree

Returns the degree (distance between unweighted edges) between two varieties, where an edge
represents a parent-child relationship

Methods for searching through genealogical data and displaying the results. Plotting algorithms assist with data exploration and publication-quality image generation. Includes interactive genealogy visualization tools. Provides parsing and calculation methods for variables in descendant branches of interest. Uses the Grammar of Graphics.

Lindsay Rutter

ggenealogy

Visualization Tools for Genealogical Data

getDegree function

<dl><dt>v1</dt>
<dd>the label of the first vertex of interest (in character string format)</dd>
<dt>v2</dt>
<dd>the label of the second vertex of interest (in character string format)</dd>
<dt>ig</dt>
<dd>the graph representation of the data genealogy (in igraph format)</dd>
<dt>geneal</dt>
<dd>the full genealogy (in data frame format)</dd></dl>

Arguments

Determine the degree between two varieties — getDegree

<dl>

<dt>v1</dt>
<dd>the label of the first vertex of interest (in character string format)</dd>


<dt>v2</dt>
<dd>the label of the second vertex of interest (in character string format)</dd>


<dt>ig</dt>
<dd>the graph representation of the data genealogy (in igraph format)</dd>


<dt>geneal</dt>
<dd>the full genealogy (in data frame format)</dd>

</dl>

getDegree: Determine the degree between two varieties

Description

Usage

Arguments

References

Examples