1、图邻接矩阵相关算法 C+实现.cpp 部分#include#include“matrix.h“using namespace std;int main()int item;coutitem;graphmatrix gmatrix(item);coutch;while(ch!=0)switch(ch)case 1: int v1,v2;coutv1v2;coutv;coutv1v2;coutv;gmatrix.insertv(v);gmatrix.print();break;case 7:int v;coutv;gmatrix.delv(v);gmatrix.print();break;case
2、 8:int v1,v2,w;coutv1v2w;gmatrix.inserte(v1,v2,w);break;case 9: int v3,v4;coutv3v4;gmatrix.dele(v3,v4);break;coutch;if(ch=0)coutusing namespace std;templateclass graphmatrixprivate:int matrixmaxsize;int matrixsize;int maxweight;int edge256256;public:graphmatrix(int n);graphmatrix()coutmatrixmaxsize)
3、?1;-1);int getnumofV()return matrixsize;int getnumE();void insertv(int v);void delv(int v);void inserte(int v1,int v2,int w);void dele(int v1,int v2);templategraphmatrix:graphmatrix(int n)matrixmaxsize=256;maxweight=1000;if(nedgeij;templateint graphmatrix:getweight(intfor(int i=0;ivoid graphmatrix:RDFS(int v,int * visited)/针对有向图/coutint graphmatrix:getnumE()int num;for(int i=0;i0return ;edgev1-1v2-1=maxweight;
