edgenode.h

来自「贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题」· C头文件 代码 · 共 28 行

// used by UNetwork::Kruskal
//Kruskal算法所需的数据类型
#ifndef EdgeNode_
#define EdgeNode_

#include<iostream>
using namespace std;

template <class T> class UNetwork;

template <class T>
class EdgeNode {
   friend ostream& operator<<(ostream&, EdgeNode<T>);
   friend UNetwork<T>;
   friend void main(void);
   public:
      operator T () const {return weight;}
   private:
      T weight;  //边的高度
      int u, v;  //边的端点
};

template<class T>
ostream& operator<<(ostream& out, EdgeNode<T> x)
   {out << x.u << ' ' << x.v << ' ' << x.weight; return out;}

#endif