edge.h

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

#ifndef Edge_
#define Edge_
//用于寻找深度优先生成树函数
class Edge
{
	friend ostream& operator<<(ostream&, Edge);
	friend class Undirected;
	friend void main(void);
private:
	int u, v;  //边的端点
};

ostream& operator<<(ostream& out, Edge x)
   {out << x.u << ' ' << x.v; return out;}

#endif