compute_m2sn6pt: Compute shortest m2sn for the six-point problem

Description Usage Arguments Examples

View source: R/compute_m2sn6pt.R

Description

Computes a shortest 2-connected Steiner network on six points with a given topology consisting of 2 cherries and 3 simple edges (if such a network exists).

Usage

1

Arguments

points

A data frame containing the (x, y) coordinates of the six points.

Examples

1

marcusvolz/steiner documentation built on April 25, 2018, 12:14 p.m.