remove_duplicates

graph_list

If <code>TRUE</code> also organises isomorphic graphs (now disregarding leaf names)
next to each other.

organise

If <code>TRUE</code> and <code>organise</code> is also <code>TRUE</code>, the output will be a
list of lists of isomorphic graphs instead of one big list.

return_piles


Using <code><a rd-options="" href="/link/canonise_graph?package=admixturegraph&version=1.0.2" data-mini-rdoc="admixturegraph::canonise_graph">canonise_graph</a></code> to calculate unique characteristic logical vector for each
graph in a given list of graphs, then sorts the list according to this attribute and remove
repeated graphs.
Leaf names count so that graphs with permuted leaves are considered different.
Also organises similar graphs next to each other if <code>organise</code> is <code>TRUE</code>, but this
is extremely slow.


Implements tools for building and visualising admixture graphs
and for extracting equations from them. These equations can be compared to f-
statistics obtained from data to test the consistency of a graph against data --
for example by comparing the sign of f_4-statistics with the signs predicted by
the graph -- and graph parameters (edge lengths and admixture proportions) can
be fitted to observed statistics.

Thomas Mailund

admixturegraph

Admixture Graph Manipulation and Fitting

remove_duplicates function


Using <code><a rd-options='' href='canonise_graph'>canonise_graph</a></code> to calculate unique characteristic logical vector for each
graph in a given list of graphs, then sorts the list according to this attribute and remove
repeated graphs.
Leaf names count so that graphs with permuted leaves are considered different.
Also organises similar graphs next to each other if <code>organise</code> is <code>TRUE</code>, but this
is extremely slow.


remove_duplicates: Remove duplicate graphs from a list.

Description

Usage

Arguments

Value