图邻接矩阵相关算法实现.docVIP

图邻接矩阵相关算法C++实现 .cpp部分 #includeiostream #includematrix.h using namespace std; int main(){ int item; cout输入矩阵大小: ; cinitem; graphmatrixint gmatrix(item); cout1:获取指定边权值endl; cout2:获取指定点的第一个邻接顶点endl; cout3:获取指定点相对于另一点的下一个临接点endl; cout4:深度优先遍历:endl; cout5:输出邻接矩阵:endl; cout6:插入一个顶点:endl; cout7:删除一个顶点:endl; cout8:插入一条边:endl; cout9:删除一条边:endl; int ch; cinch; while(ch!=0){ switch(ch){ case 1: {int v1,v2; cout输入v1 ，v2:endl; cinv1v2; cout权: gmatrix.getweight(v1,v2)endl; break;} case 2:{int v; cout输入指定点:endl; cinv; coutfirst 顶 点 : gmatrix.getfirstneighbor(v)endl; break;} case 3:{int v1,v2; cout输入v1,v2: endl; cinv1v2; coutv1 相对于v2的第一个邻接点:gmatrix.getnextneighbor(v1,v2)endl; break;} case 4:{gmatrix.DepthFS(); coutendl; break;} case 5:{gmatrix.print(); break;} case 6: {int v; cout输入欲插入顶点编号: ; cinv; gmatrix.insertv(v); gmatrix.print(); break;} case 7:{int v; cout输入欲删除节点编号: ; cinv; gmatrix.delv(v); gmatrix.print(); break; } case 8:{int v1,v2,w; cout输入v1,v2及其weight:endl; cinv1v2w; gmatrix.inserte(v1,v2,w); break;} case 9: {int v3,v4; cout输入v1,v2:endl; cinv3v4; gmatrix.dele(v3,v4); break;} } cout需要更多帮助吗?endl; cinch; } if(ch==0)cout**谢谢使用**endl; return 0; } .h部分 #includeiostream using namespace std; templateclass T class graphmatrix{ private: int matrixmaxsize; int matrixsize; int maxweight; int edge[256][256]; public: graphmatrix(int n); ~graphmatrix(){cout**set memory free, program ends**endl;} int getweight(int v1,int v2); int getfirstneighbor(int v); int getnextneighbor(int v1,int v2); void RDFS(int v,int * visited); void print(); void DepthFS(); int gmatrixempty(){return (matrixsize?1:-1);} int gmatrixfull(){return ((matrixsizematrixmaxsize)?1;-1);} int getnumofV(){return matrixsize;}