Description Usage Arguments Value Examples

View source: R/mstIrreducible.R

Given a graph with at least one minimum cost spanning tree,
the `mstIrreducible`

function obtains the irreducible
form.

1 | ```
mstIrreducible(nodes, arcs)
``` |

`nodes` |
vector containing the nodes of the graph,
identified by a number that goes from |

`arcs` |
matrix with the list of arcs of the graph. Each row represents one arc. The first two columns contain the two endpoints of each arc and the third column contains their weights. |

`mstIrreducible`

returns a matrix with the list of
arcs of the irreducible form.

1 2 3 4 5 6 | ```
# Graph
nodes <- 1:4
arcs <- matrix(c(1,2,6, 1,3,10, 1,4,6, 2,3,4, 2,4,6, 3,4,4),
byrow = TRUE, ncol = 3)
# Irreducible form
mstIrreducible(nodes, arcs)
``` |

cooptrees documentation built on May 30, 2017, 8:11 a.m.

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.