ineighbor2dmatrix.java

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

JAVA
32
字号
/**
 * Description: provide the information for an irregular 2D matrix with no
 *   repeated elements and same with the node at a node
 *   --Unusally used by neigbhorhood
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Nov 21, 2005    Initial version, trans for VaryNeighborManager
 *
 */

package Global.basic.data.matrix;


public class INeighbor2DMatrix extends IIrregular2DVariedMatrix {

  public INeighbor2DMatrix(int nodeNumber) {
    super(nodeNumber, nodeNumber-1);
  }

  public boolean addNodeTo(int elemID, int nodeID) {
    if (elemID==nodeID) {
      return false;
    }
    return super.addNodeTo(elemID, nodeID);
  }

  public int[] getNNArrayAt(int index) {
    return super.getArrayAt(index);
  }
}

⌨️ 快捷键说明

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