The minimal spanning tree is a connected graph with n nodes and n-1 edges. This is a smaller class of possible partitions of a graph by pruning edges with high dissimilarity. If one edge is removed, the graph is partioned in two unconnected subgraphs. This function implements the algorithm due to Prim (1987).

mstree(nbw, ini = NULL)

## Arguments

nbw

An object of listw class returned by nb2listw function. See this help for details.

ini

The initial node in the minimal spanning tree.

## Details

The minimum spanning tree algorithm.

Input a connected graph.

Begin a empty set of nodes.

Add an arbitrary note in this set.

While are nodes not in the set, find a minimum cost edge connecting a node in the set and a node out of the set and add this node in the set.

The set of edges is a minimum spanning tree.

## Value

A matrix with n-1 rows and tree columns. Each row is two nodes and the cost, i. e. the edge and it cost.

## Author

Renato M. Assuncao and Elias T. Krainski

## Examples

### loading data
package="spdep"), quiet=TRUE)
st_crs(bh) <- "+proj=longlat +ellps=WGS84"

### neighboorhod list
bh.nb <- poly2nb(bh)

### calculing costs

### making listw
nb.w <- nb2listw(bh.nb, lcosts, style="B")

### find a minimum spanning tree
system.time(mst.bh <- mstree(nb.w,5))
#>    user  system elapsed
#>   0.003   0.000   0.003
dim(mst.bh)
#>  97  3
#>      [,1] [,2]      [,3]
#> [1,]    5   12 1.2951120
#> [2,]   12   13 0.6141101
#> [3,]   13   11 0.7913745
#> [4,]   13    6 0.9775650
#> [5,]   11   31 0.9965625
#> [6,]   31   39 0.6915158
tail(mst.bh)
#>       [,1] [,2]      [,3]
#> [92,]   89   90 2.5743702
#> [93,]   26   56 2.6235317
#> [94,]   86   87 2.6471303
#> [95,]   87   72 0.7874461
#> [96,]   49   36 2.8743677
#> [97,]   24   25 3.4675168
### the mstree plot
par(mar=c(0,0,0,0))
plot(st_geometry(bh), border=gray(.5))
plot(mst.bh, coordinates(as(bh, "Spatial")), col=2, 