/*
 * The MIT License
 *
 * Copyright 2017 Thibault Debatty.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
package spark.kmedoids.eval.tv;

import info.debatty.java.datasets.tv.Sequence;
import info.debatty.spark.kmedoids.neighborgenerator.SANeighborGenerator;

/**
 *
 * @author Thibault Debatty
 */
public class SimulatedAnnealingTest extends AbstractTest {

    /**
     * Return a test instance with a clarans neighbor generator.
     */
    public SimulatedAnnealingTest() {
        super(new SANeighborGenerator<Sequence>(20000, 0.992));
    }
}

@@ -1558,18 +1558,18 @@
 ce%3E(
-20
+64
 000, 0.9
 92))
@@ -1568,10 +1568,10 @@
  0.9
-92
+80
 ));%0A

Use new optimum parameters