node.java

算法中一个经典问题：背包问题的优先队列算法实现。

public class node {
     int id;
     int weigh;
     int value;
     public node()
     {
         id=weigh=value=0;
     }
     public node(int id_,int weigh_,int value_) {
         id=id_;
         weigh=weigh_;
         value=value_;
     }

     void setId(int id_)
     {
         id=id_;
     }

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

     void setWeigh( int weigh_)
     {
         weigh=weigh_;
     }
 }