graph_distances: Pairwise distance estimates for graphs

graph_distancesR Documentation

Pairwise distance estimates for graphs

Description

Computes a distance estimate for each graph pair. Each graph is first summarized as a vector which counts for every leaf pair how many internal nodes reach that pair. The distance between two graphs is the Euclidean distance between the vectors of two graphs, and is scaled to fall between 0 and 1.

Usage

graph_distances(graphlist)

Arguments

graphlist

List of graphs

Value

A data frame with graph distances


uqrmaie1/admixtools documentation built on Nov. 3, 2024, 12:56 a.m.