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.
getPathOnly(v1, v2, ig, geneal, silent = FALSE, isDirected = FALSE)the label of the first vertex of interest (in character string format)
the label of the second vertex of interest (in character string format)
the graph representation of the data genealogy (in igraph format)
the full genealogy (in data frame format)
whether or not to print output (defaults to false)
whether or not the graph is directed (defaults to false)