iencoder.java

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

JAVA
22
字号
/**
 * Description: Evaluate two states (A, B) based on their goodness, if A is
 * not worse than B, then return true; else return false
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Apr 28, 2006    MAOS-TSP Beta 1.1.002
 *
 * @version 1.0
 * @Since MAOS1.0
 */


package maosKernel.represent;

import maosKernel.represent.encode.*;
import maosKernel.represent.space.*;

public interface IEncoder {
  public OEncodeData getNullOEncodeData();
  public void encodeGlobalCost(SearchState state, OEncodeData encodeData);
}

⌨️ 快捷键说明

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