Description Usage Arguments Value
Given a graph builds a unique logical vector depending only on the leaf names and the graph topology (not the inner node names, root position or the input order of edges or inner nodes). Can be used to detect graph isomorphism, that is, to weed out duplicates from a graph list. Only for comparison of graphs with the same leaf set!
1 | canonise_graph(graph)
|
graph |
An admixture graph. |
A logical vector coding the parental matrix of a canonised version of the input graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.