TSPEdgeDistance (Chips-n-Salsa - A Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms)

Computes the distance between two cities in the TSP as an integer. Some of the commonly used
distance functions in TSP benchmark problem sets assume integer costs, such as Euclidean
distance between the end points of an edge rounded to the nearest integer. The default
implementation of this method rounds the result of a call to distance(i, j) to the nearest
integer.

Parameters:

x1 - The x coordinate of the first city.

y1 - The y coordinate of the first city.

x2 - The x coordinate of the second city.

y2 - The y coordinate of the second city.

Returns:

The distance between the two cities as an integer.