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

图邻接矩阵相关算法C++#include<iostream>#include""usingnamespacestd;intmain(){ intitem; cout<<"输入矩阵大小:"<<""; cin>>item;graphmatrix<int>gmatrix(item);cout<<"1:获取指定边权值"<<endl; cout<<"2:获取指定点的第一个邻接顶点"<<endl; cout<<"3:获取指定点相对于另一点的下一个临接点"<<endl; cout<<"4:深度优先遍历:"<<endl; cout<<"5:输出邻接矩阵:"<<endl; cout<<"6:插入一个顶点:"<<endl; cout<<"7:删除一个顶点:"<<endl; cout<<"8:插入一条边:"<<endl; cout<<"9:删除一条边:"<<endl; intch; cin>>ch; while(ch!=0){ switch(ch){ case1:{intv1,v2; cout<<"输入v1,v2:"<<endl; cin>>v1>>v2; cout<<"权:"<<(v1,v2)<<endl; break;} case2:{intv; cout<<"输入指定点:"<<endl; cin>>v; cout<<"first 顶 点 :"<<(v)<<endl; break;} case3:{intv1,v2; cout<<"输入v1,v2:"<<endl; cin>>v1>>v2; cout<<"v1 相对于v2的第一个邻接点:"<<(v1,v2)<<endl; break;} case4:{(); cout<<endl; break;} case5:{(); break;} case6:{intv; cout<<"输入欲插入顶点编号:"<<""; cin>>v; (v); (); break;} case7:{intv; cout<<"输入欲删除节点编号:"<<""; cin>>v; (v); (); break; } case8:{intv1,v2,w; cout<<"输入v1,v2及其weight:"<<endl; cin>>v1>>v2>>w; (v1,v2,w); break;} case9:{intv3,v4; cout<<"输入v1,v2:"<<endl; cin>>v3>>v4; (v3,v4); break;} }cout<<"需要更多帮助吗?"<<endl; cin>>ch; } if(ch==0)cout<<"**谢谢使用**"<<endl; return0;}.h部分#include<iostream>usingnamespacestd;template<classT>classgraphmatrix{ private: intmatrixmaxsize; intmatrixsize; intmaxweight; intedge[256][256]; public: graphmatrix(intn); ~graphmatrix(){cout<<"**setmemoryfree,programends**"<<endl;} intgetweight(int&v1,int&v2); intgetfirstneighbor(int&v); intgetnextneighbor(int&v1,int&v2); voidRDFS(intv,int*visited); voidprint();voidDepthFS(); intgmatrixempty(){return(matrixsize?1:-1);} intgmatrixfull(){return((matrixsize>matrixmaxsize)?1;-1);} intgetnumofV(){returnmatrixsize;} intgetnumE(); voidinsertv(intv); voiddelv(intv); voidinserte(intv1,intv2,intw); voiddele(intv1,intv2); };template<classT>graphmatrix<T>::graphmatrix(intn){ matrixmaxsize=256; maxweight=