greedy_point_matching: Greedy point matching

Description Usage Arguments Value

Description

Pairs of cities are matched in a greedy fashion for morphing, first the closest pair w.r.t. euclidean distance, then the clostest pair of the remaining cities, and so on.

Usage

1

Arguments

x

[tsp_instance]
First TSP instance.

y

[tsp_instance]
Second TSP instance.

Value

[matrix] Numeric matrix of point indices with shortest distance.


berndbischl/tspmeta documentation built on May 12, 2019, 7:24 p.m.