Description Usage Arguments Value
Using canonise_graph
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 organise
is TRUE
, but this
is extremely slow.
1 | remove_duplicates(graph_list, organise = FALSE, return_piles = FALSE)
|
graph_list |
A list of graphs with the same leaf set. |
organise |
If |
return_piles |
If |
A list of graphs that are all different (or a list of lists of graphs if both organise
and return_piles
are TRUE
).
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.