getExtremeSolutions {mcMST}R Documentation

Compute extreme spanning trees of bi-criteria graph problem.

Description

Internally mcMSTPrim is called with weights set accordingly.

Usage

getExtremeSolutions(graph)

Arguments

graph

[grapherator]
Graph.

Value

[matrix(2, 2)] The i-th column contains the objective vector of the extreme i-th extreme solution


[Package mcMST version 1.1.1 Index]