arcnode.java

来自「用分枝界限法找图的最短路径」· Java 代码 · 共 42 行

package graphic;

public class ArcNode {
    int point1;
    int point2;
    int value;

    public ArcNode()
    {
        point1=point2=value=0;
    }
    public ArcNode(int point1_,int point2_,int value_) {
        point1=point1_;
        point2=point2_;
        value=value_;
    }

   int getPoint1(){
        return point1;
    }

   int getPoint2(){
        return point2;
    }

  int getValue(){
        return value;
    }

    void  setPoint1(int point1_){
        point1=point1_;
    }

    void  setPoint2(int point2_){
        point2=point2_;
    }

    void  setValue(int value_){
        value=value_;
    }
}