spanningtreenode.java

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

/**
 * Description: provide a node for a spanning tree: a spannng tree of a graph G
  * with n nodes is a tree with n-1 edgs from G.
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    May 21, 2005
 * Xiaofeng Xie    Apr 28, 2006    MAOS-TSP Beta 1.1.002
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * Please acknowledge the author(s) if you use this code in any way.
 *
 */

package implement.TSP.knowledge;

import Global.basic.data.collection.*;

public class SpanningTreeNode {
  public static final int NULL_NODE = -1;
  protected int parentID = NULL_NODE;
  protected IVector childIDs = new IVector();

  public SpanningTreeNode(){ }

  public void clear() {
    parentID = -1;
    childIDs.clear();
  }
  public int getParentID() {
    return parentID;
  }

  public void setParentID(int id) {
    this.parentID = id;
  }

  public int getChildSize() {
    return childIDs.size();
  }

  public int get_V_Value() {
    return getDegree()-2;
  }

  public int getDegree() {
    int degree = getChildSize();
    if (this.parentID != NULL_NODE) {
      degree ++;
    }
    return degree;
  }

  public int getChildIDAt(int index) {
    return childIDs.elementAt(index);
  }

  public void addChild(int childID) {
    childIDs.add(childID);
  }

  public void removeChildbyIndex(int index) {
    childIDs.removeElementAt(index);
  }
}