absvmatrix.java

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

JAVA
35
字号
/**
 * Description: provide a irregular matrix with integer values
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Mar 22, 2005
 */

package Global.basic.data.matrix;

import Global.basic.attrib.*;

public abstract class AbsVMatrix implements IIrregular2DEngine {

  public int getElementNumber() {
    return getNodeNumber();
  }

  public int getMaxCardinalityID() {
    int mcID = -1;
    int mcValue = -1;
    for (int i=0; i<this.getNodeNumber(); i++) {
      if (mcValue<getElementNumberAt(i)) {
        mcValue = getElementNumberAt(i);
        mcID = i;
      }
    }
    return mcID;
  }

  public int getMaxCardinality() {
    return this.getElementNumberAt(getMaxCardinalityID());
  }

}

⌨️ 快捷键说明

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