Description Usage Arguments Value References Examples

Provides random walk procedure. Starting from the randomly selected node, choose a neighbour node uniformly randomly, until given number of terminals won't be found.

1 | ```
generate_st_samples(graph, ter_number, prob)
``` |

`graph` |
an igraph graph; should be undirected, otherwise it is converted to undirected. |

`ter_number` |
a numeric vector; each element indicates the number of terminals to be selected and length of vector indicates the number of terminal sets to be picked. |

`prob` |
a numeric vector of the same length as ter_number; prob[i] defines a probability with which each next node accepted or rejected while selecting ter_number[i] terminals. |

A list of the same length as ter_number. Each element of list contains a vector of ids of selected vertices.

1. Afshin Sadeghi and Holger Froehlich, "Steiner tree methods for optimal sub-network identification: an empirical study", BMC Bioinformatics 2013 14:144

1 2 3 | ```
generate_st_samples(graph = graph("Zachary"),
ter_number = c(3, 4),
prob = c(0.1, 0.2))
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.