ibestcycleinfoengine.java

来自「用于求解TSP(Traveling salesman problem」· Java 代码 · 共 22 行

JAVA
22
字号
/**
 * Description: provide the interface for handling best information in a cycle
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Jul 19, 2006
 */

package maosKernel.infoIO;

import maosKernel.represent.*;

public interface IBestCycleInfoEngine {

  public EncodedState getBestState();

  public double getBestTime();

  public int getBestNCycle();

}

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?