getPathOnly

Determines the shortest path between the two inputted vertices, and takes into
account whether or not the graph is directed. If there is a path, the list of vertices of the
path will be returned. If there is not a path, a list of character(0) will be returned. Note:
For a directed graph, the direction matters. However, this function will check both directions
and return the path if it exists.

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

getPathOnly 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>
<dt>silent</dt>
<dd>whether or not to print output (defaults to false)</dd>
<dt>isDirected</dt>
<dd>whether or not the graph is directed (defaults to false)</dd></dl>

Arguments

Determine the path between two varieties — getPathOnly

<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>


<dt>silent</dt>
<dd>whether or not to print output (defaults to false)</dd>


<dt>isDirected</dt>
<dd>whether or not the graph is directed (defaults to false)</dd>

</dl>

getPathOnly: Determine the path between two varieties

Description

Usage

Arguments