graphmod_pavel | R Documentation |
generates new graphs from basegraph as follows:
generates all possible trees using addpops
(which are not in basegraph)
attaches trees to connection_edge, which is defined by two nodes in basegraph
adds edges originating above each edge in source_node
, to each node above addpops
graphmod_pavel(basegraph, addpops, connection_edge, source_nodes)
basegraph |
an admixture graph as igraph object. (convert from edge list using |
addpops |
a vector of population labels which are not in |
connection_edge |
edge in |
source_nodes |
nodes in |
## Not run:
graphlist = graphmod_pavel(example_igraph, addpops = c('pop1', 'pop2', 'pop3'),
connection_edge = c('N2N0', 'N1N'),
source_nodes = c('Denisova.DG', 'N2N2'))
results = tibble(graph = graphlist) %>%
mutate(res = map(graph, ~qpgraph(example_f2_blocks, .))) %>%
unnest_wider(res) %>%
mutate(worstz = map_dbl(f3, ~max(abs(.$z))))
## End(Not run)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.