Description Usage Arguments Value Author(s) References See Also Examples

Each time search two nodes with lowest weights in an iterative manner

1 | ```
mst.primm(gemat)
``` |

`gemat` |
standard graph square matrix |

return a matrix in edge form, the first column is the starting node, the second column is the ending node

Youhua Chen <haydi@126.com>

Chen Y (2012) loop: an R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting. Submitted.

Wang HY, Huang Q, Li CZ,Zhu BZ (2010) Graph algorithms and Matlab applications. BUAA Press, Beijing.

1 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.