edgenode.h

常用算法与数据结构原代码

// used by LinkedWDigraph::Kruskal
#ifndef EdgeNode_
#define EdgeNode_

template <class T> class LinkedWGraph;

template <class T>
class EdgeNode 
{
	friend ostream& operator<<(ostream&, EdgeNode<T>);
	friend LinkedWGraph<T>;
	friend void main(void);
public:
	operator T () const 
	{
		return weight;
	}
private:
	T weight;  // edge weight
	int u, v;  // edge endpoints
};

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

#endif