graph.h

一个图的学习程序

//带权无向图
const int maxWeight = 80;
const int DefaultVertices = 30;
template<class T,class E>
class Graph
{
public:
	Graph(int sz = DefaultVertices);
	~Graph();
	bool Graphempty()const
	{
		if(numedges == 0)return true;
		else return false;
	}
	bool GraphFull()const
	{
		if(numVertices == maxVertices || numedges == maxVertices*(maxVertices-1)/2)
			return true;
		else return false;
	}
	int NumberOfVertices()
	{
		return numVertices;
	}
	int NumberOfedges()
	{
		return numEdges;
	}
	virtual T getValue(int i);
	virtual E getWeight(int v1,int v2);
	virtual int getFirstNeighbor(int v);
	virtual int getNextNeighbor(int v,int w);
	virtual bool insertVertex(const T vintrtintx);
	virtual bool insertedge(int v1,int v2,E cost);
	virtual bool removeVertex(int v);
	virtual bool removeedge(int v1,int v2);
protected:
	int maxVertices;
	int numedges;
	int numVertices;
	int getVertexPos(T vertex);
};