Description Usage Arguments Value Author(s) Examples
Determines the number of differing edges for two t-cherry trees over the same universe and of the same order represented by adjacency matrices, i.e. the number of edges in each graph minus the number of edges common to both t-cherry trees.
1 | diff_edges_tch(adj_mat_1, adj_mat_2)
|
adj_mat_1, adj_mat_2 |
Adjacency matrices for the two graphs. |
The number of edges for which the two graphs differ.
Katrine Kirkeby, enir_tak@hotmail.com
Maria Knudsen, mariaknudsen@hotmail.dk
Ninna Vihrs, ninnavihrs@hotmail.dk
1 2 3 4 5 6 7 8 9 | m1 <- matrix(c(0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0),
nrow = 4, ncol = 4)
m2 <- matrix(c(0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0),
nrow = 4, ncol = 4)
colnames(m1) <- rownames(m1) <- letters[1:4]
colnames(m2) <- rownames(m2) <- letters[1:4]
diff_edges_tch(m1, m1)
diff_edges_tch(m1, m2)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.