vnode.h

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

//使用 by UNetwork::Prim
#ifndef VertexNode1_
#define VertexNode1_

template <class T> class UNetwork;
template <class T> class ModifiedMinHeap;

template <class T>
class VertexNode1 {
   friend UNetwork<T>;
   public:
      operator T () const {return distance;}
   private:
      T distance;    // 距离 to nearest tree vertex
      int nbr;       // 最靠近的树的顶点
};


template <class T>
class VertexNode2 {
   friend UNetwork<T>;
   friend ModifiedMinHeap<T>;
   public:
      operator T () const {return distance;}
   private:
      T distance;    // distance to nearest tree vertex
      int ID;        // vertex ID
};

#endif