mstIrreducible: Irreducible form for a minimum cost spanning tree problem

In cooptrees: Cooperative aspects of optimal trees in weighted graphs

Description

Given a graph with at least one minimum cost spanning tree, the mstIrreducible function obtains the irreducible form.

Usage

mstIrreducible(nodes, arcs)

Arguments

nodes	vector containing the nodes of the graph, identified by a number that goes from 1 to the order of the graph.
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.

Value

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

Examples

# 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)

Example output

Loading required package: igraph

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

Loading required package: optrees
     ept1 ept2 weight
[1,]    1    2      6
[2,]    1    3      6
[3,]    1    4      6
[4,]    2    3      4
[5,]    2    4      4
[6,]    3    4      4

cooptrees documentation built on May 2, 2019, 3:59 p.m.