# maIrreducible

From cooptrees v1.0
by Manuel Fontenla

##### Irreducible form for a minimum cost arborescence problem

Given a graph with at least one minimum cost arborescence
the `maIrreducible`

function obtains the irreducible
form.

##### Usage

`maIrreducible(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

`maIrreducible`

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

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

*Documentation reproduced from package cooptrees, version 1.0, License: GPL-3*

### Community examples

Looks like there are no examples yet.