Changes the names of the nodes of a graph.
Capable of giving new standard names to the inner nodes in a way that only depends on the graph topology
(without the root) and the leaf names. This is necessary when detecting when graphs are identical up to inner
node and admixture proportion names, see
The graph to be renamed.
A list of new names, given in the form
A graph with new node names.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.