object2.h

贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题

#ifndef Object_
#define Object_

class Object {
   friend float Knapsack(int [], int [], int, int, float []);
   friend float Knapsack(int [], int [], int, int, int []);
   friend float Knapsack(int [], int [], int, int, int [] ,int );
   friend float Knapsack(int [], int [], int, int, int [] ,int, int );
   public:
      operator float() const
      {return d;}
   private:
      int ID;  // 物品id
      float d; // 密度系数
};

#endif