A set of functions to randomly generate euler triangulation on Sphere.
1 | my.EulTriSph(n.step)
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | library(igraph)
n.step <- 20
euler.out <- my.EulTriSph(n.step)
el <- my.dir.graph(euler.out[[1]],euler.out[[2]])
plot(graph.edgelist(el))
root.e <- el[1,]
euler.tree.out <- my.euler.tree(euler.out[[1]],euler.out[[2]],root.e)
g.tree <- graph.edgelist(euler.tree.out[[1]])
is.connected(g.tree)
g.tree
sum(euler.out[[2]])
nrow(euler.out[[1]])
sh.dist <- shortest.paths(graph.edgelist(euler.tree.out[[2]]),root.e[1],mode="out")
plot(graph.edgelist(euler.tree.out[[1]]),vertex.label=sh.dist)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.