`msTreeBoruvka`

computes a minimum cost spanning tree
of an undirected graph with Boruvka's algorithm.

1 | ```
msTreeBoruvka(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. |

Boruvka's algorithm was firstly published in 1926 by the mathematician Otakar Boruvka. This algorithm works in a connected, weighted and undirected graph, checking each component and adding the minimum weight arcs that connect the component to other components until one minimum spanning tree is complete.

`msTreeBoruvka`

returns a list with:

`tree.nodes` |
vector containing the nodes of the minimum cost spanning tree. |

`tree.arcs` |
matrix containing the list of arcs of the minimum cost spanning tree. |

`stages` |
number of stages required. |

`stages.arcs` |
stages in which each arc was added. |

Boruvka, Otakar (1926). "O jistem problemu minimalnim (About a certain minimal problem)". Prace mor. prirodoved. spol. v Brne III (in Czech, German summary) 3: 37-58.

A more general function getMinimumSpanningTree.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.