数据结构课程设计题4： 判断有向图的连通性(4)

#include<iostream>#include<conio.h>#include<stdlib.h>using namespace std;const int MaxSize=20; //×î¶à¼¸¸ö½Úµãint i,j,k;struct ArcNode //±ß±í½Úµã{int adjivex;ArcNode * next;};struct VertexNode //¶¥µã±í½Úµã{int data;ArcNode * firstedge;ArcNode * nfirstedge;} ;struct ArcNode* s; //±ß±í½Úµã¹¤×÷Ö¸Õëclass Graph{public:Graph(int data[],int v,int a); //³õʼ»¯Í¼±í~Graph(); //ɾ³ýͼ±ívoid PrintGraph(); //ͼµÄÏÔʾvoid InsertArc(int v1,int v2);void InsertArc(int n); //²åÈë±ßvoid InsertVertex(int v,int data);void InsertVertex(int data); //²åÈë½Úµãbool DeleteArc(int v1,int v2); //ɾ³ý±ßvoid DeleteVertex(); //ɾ³ý½Úµãbool Isconect(); //Éî¶ÈÓÅÏȱéÀúÓëÁ¬Í¨ÐÔµÄÅж¨ void Scprint(); //Ç¿Á¬Í¨·ÖÁ¿void DFS(int v,int a[]);void DFS1(int v,int a[],int b[]);void NDFS(int i,int visited[],int b[]);void scPrint(int b[]);void BFS(int v,int visisted[]);void BFS(); //ȫͼ¹ã¶ÈÓÅÏȱéÀúprivate:VertexNode adjlist[MaxSize];int vertexNum, arcNum;} ;////////////////////////////////////////////////////////////////// ////////void Graph::InsertVertex(int v,int data){adjlist[v].data=data ;adjlist[v].firstedge=NULL ;adjlist[v].nfirstedge =NULL ;}void Graph::InsertArc(int v1,int v2){s=new ArcNode; s->adjivex=v2;s->next=adjlist[v1].firstedge;adjlist[v1].firstedge=s;s=new ArcNode; s->adjivex=v1;s->next=adjlist[v2].nfirstedge;adjlist[v2].nfirstedge=s;}Graph::Graph(int data[],int v,int a){if(a>v*v-v){/////+++++++rong chuo}vertexNum=v ; arcNum=a ;cout<<"Ä㽨Á¢ÁËÒ»¸ö"<<v<<"½Úµã"<<a<<"Ìõ±ßµÄͼ"<<endl;for(int w=0; w<vertexNum; w++) //½Úµã³õʼ»¯ InsertVertex(w,data[w]) ;for(int v1,v2,w=0;w<arcNum;w++) //±ßµÃ³õʼ»¯ {cout<<"ÇëÊäÈëµÚ"<<w+1<<"Ìõ±ß £º ";cin>>v1>>v2;////////////+++++++++rongcuoif(v1>=vertexNum||v1<0||v2>=vertexNum||v2<0){cout<<"´íÎó "; w--;continue;}InsertArc(v1,v2);}}Graph::~Graph(){for(i=0; i<vertexNum; i++){while(adjlist[i].firstedge!=NULL){s=adjlist[i].firstedge;adjlist[i].firstedge= (adjlist[i].firstedge)->next;delete s;}while(adjlist[i].nfirstedge!=NULL){s=adjlist[i].nfirstedge;adjlist[i].nfirstedge= (adjlist[i].nfirstedge)->next;delete s;}}}void Graph::InsertVertex(int data){vertexNum++;InsertVertex(vertexNum-1,data);}void Graph::InsertArc(int n){arcNum+=n;int v1,v2;for(int w=0;w<n;w++){cout<<"ÇëÊäÈëµÚ"<<w+1<<"Ìõ±ß £º ";cin>>v1>>v2;InsertArc( v1, v2);}}void Graph::BFS(int v,int visisted[]) //¹ã¶ÈÓÅÏȱéÀú {int Q[MaxSize],front,rear;front=rear=-1;int w ;struct ArcNode* p;cout<<v<<": "<<adjlist[v].data<<"\t";visisted[v]=1;Q[++rear]=v;while(front!=rear){v=Q[++front];p=adjlist[v].firstedge;while(p!=NULL){w=p->adjivex;if(visisted[w]==0){cout<<w<<": "<<adjlist[w].data<<"\t";visisted[w]=1;Q[++rear]=j;}p=p->next;}}}void Graph::BFS(){cout<<"¹ã¶ÈÓÅÏȱéÀú £º ";int n=vertexNum;int* visited=new int[n];for(int w=0;w<n;w++){visited[w]=0;}for(int w=0;w<n;w++){if(visited[w]==0){BFS(w,visited);}}delete []visited;cout<<endl;}bool Graph::DeleteArc(int v1,int v2){s=adjlist[v1].firstedge;if(s!=NULL){if(s->adjivex==v2){adjlist[v1].firstedge=s->next;delete s;arcNum--;}else{while(s->next!=NULL){if(s->next->adjivex==v2){struct ArcNode* q;q=s->next;s->next=q->next;delete q;arcNum--;break;}s=s->next;}}}s=adjlist[v2].nfirstedge;if(s!=NULL){if(s->adjivex==v1){adjlist[v2].nfirstedge=s->next;delete s;return true;}else{while(s->next!=NULL){if(s->next->adjivex==v1){struct ArcNode* q;q=s->next;s->next=q->next;delete q;return true;}s=s->next;}}}return false;}void Graph::DeleteVertex(){for(int w=0;w<vertexNum-1;w++){DeleteArc(w,vertexNum-1);DeleteArc(vertexNum-1,w);}vertexNum--;}void Graph::PrintGraph(){cout<<"\t"<<vertexNum<<" ¸ö½Úµã "<<arcNum<<" Ìõ±ß"<<endl;for(i=0; i<vertexNum; i++){cout<<i<<"; "<<adjlist[i].data<<"\t" ;}cout<<endl;for(i=0; i<vertexNum; i++){s=adjlist[i].firstedge ;while(s!=NULL){cout<<i<<"-->"<<s->adjivex<<endl;s=s->next ;}}cout<<"ÄæÏòͼ"<<endl;for(i=0; i<vertexNum; i++){s=adjlist[i].nfirstedge ;while(s!=NULL){cout<<i<<"-->"<<s->adjivex<<endl;s=s->next ;}}}bool Graph::Isconect(){cout<<"Éî¶ÈÓÅÏȱéÀúÓëÁ¬Í¨ÐÔÅж¨ £º"<<endl;int n=vertexNum;int* visited=new int[n];for(i=0;i<n;i++){visited[i]=0;}for(i=0,j=0;i<n;i++){if(visited[i]==0){DFS(i,visited);j++;}}delete []visited;cout<<endl;if(j>1){cout<<"²»ÊÇÁ¬Í¨Í¼"<<endl;return true;}else{cout<<"ÊÇÁ¬Í¨Í¼"<<endl;return false;}}void Graph::DFS(int v,int visited[]){struct ArcNode* p;cout<<v<<"£º "<<adjlist[v].data<<"\t";visited[v]=1;p=adjlist[v].firstedge;while(p!=NULL){k=p->adjivex;if(visited[k]==0) DFS(k,visited);p=p->next;}p=adjlist[v].nfirstedge;while(p!=NULL){k=p->adjivex;if(visited[k]==0) DFS(k,visited);p=p->next;}}void Graph::DFS1(int v,int visited[],int a[]) {struct ArcNode* p;visited[v]=1;p=adjlist[v].firstedge;while(p!=NULL){k=p->adjivex;if(visited[k]==0) DFS1(k,visited,a);p=p->next;}a[j++]=v;}void Graph::NDFS (int v,int visited[],int b[]) {struct ArcNode* p;visited[v]=1;p=adjlist[v].nfirstedge;while(p!=NULL){k=p->adjivex;if(visited[k]==0) NDFS(k,visited,b);p=p->next;}b[j++]=v;}void Graph::scPrint(int b[]){cout<<"Ç¿Á¬Í¨·ÖÁ¿°ü £º"<<endl;cout<<"½ÚµãºÅ £º";for(i=0;i<j;i++){cout<<b[i]<<" ";}cout<<endl;cout<<"±ß £º"<<endl;for(i=0;i<j;i++){s=adjlist[b[i]].firstedge;while(s!=NULL){for(int t=0;t<j;t++){if(s->adjivex==b[t]){cout<<b[i]<<"-->"<<b[t]<<"\t"<<endl;} }s=s->next;}}cout<<endl;}void Graph::Scprint(){int n=vertexNum ;int* a=new int[n];int* visited=new int[n];int* b=new int[n];cout<<"Ç¿Á¬Í¨Í¼·ÖÁ¿ £º"<<endl;for(i=0;i<n;i++){b[i]=-1;a[i]=-1;visited[i]=0;}for(i=0,j=0;i<n;i++){if(visited[i]==0){DFS1(i,visited,a);}}for(i=0;i<n;i++){visited[i]=0;}for(int w=n-1;w>=0;w--){j=0;//cout<<w;//cout<<a[w];if(visited[a[w]]==0){NDFS(a[w],visited,b);scPrint(b);}}delete []a;delete []visited;}///////////////////////////////////////////////////////////////// void printinfo(){cout<<"ÃüÁîÌáʾ£º"<<endl;cout<<"1 ÏÔʾͼÐÅÏ¢\t2 ²åÈë½Úµã\t3 ɾ³ý½Úµã\t4 ²åÈë±ß\t5 ɾ³ý±ß"<<endl;cout<<"6 ¹ã¶È±éÀú\t7 Á¬Í¨ÐÔ\t8 Ç¿Á¬Í¨·ÖÁ¿\t9 Ë¢ÐÂ\t esc Í˳ö"<<endl;}int main(){int a[20]={1,2,3,4,5,6,7,8,9,012,12,13,14,15,16,12,234,46,78};int v,a1;cout<<"ÊäÈë½ÚµãÊýºÍ±ßÊý £º";cin>>v>>a1;Graph mp(a,v,a1);mp.PrintGraph();printinfo();char m=0;while( m!=27){cout<<"ÇëÊäÈëÖ¸Áî"<<endl;m=getch();switch(m){case '1':mp.PrintGraph();break;case '2':cout<<"ÇëÊäÈëÊý¾Ý £º ";int data; cin>>data;mp.InsertVertex(data);break;case '3':mp.DeleteVertex();break;case '4':cout<<"²åÈ뼸Ìõ±ß£º";int n;cin>>n;mp.InsertArc (n);break;case '5':cout<<"ɾ³ý±ß ";int v1,v2;cin>>v1>>v2;mp.DeleteArc (v1,v2);break;case '6':mp.BFS();break;case '7':mp.Isconect();break;case '8':mp.Scprint();break;case '9':system("cls");mp.PrintGraph();printinfo();break;default:;}}return 0;}。