第十二周项目4-利用遍历思想求解图问题(1-5)
来源:互联网 发布:139邮箱端口 编辑:程序博客网 时间:2024/05/17 23:23
(1)是否有简单路径:
源代码:
- int visited[MAXV];
- void ExistPath(ALGraph *G,int u,int v, bool &has)
- {
- int w;
- ArcNode *p;
- visited[u]=1;
- if(u==v)
- {
- has=true;
- return;
- }
- p=G->adjlist[u].firstarc;
- while (p!=NULL)
- {
- w=p->adjvex;
- if (visited[w]==0)
- ExistPath(G,w,v,has);
- p=p->nextarc;
- }
- }
-
- void HasPath(ALGraph *G,int u,int v)
- {
- int i;
- bool flag = false;
- for (i=0; i<G->n; i++)
- visited[i]=0;
- ExistPath(G,u,v,flag);
- printf(" 从 %d 到 %d ", u, v);
- if(flag)
- printf("有简单路径\n");
- else
- printf("无简单路径\n");
- }
主函数:
- int main()
- {
- ALGraph *G;
- int A[5][5]=
- {
- {0,0,0,0,0},
- {0,0,1,0,0},
- {0,0,0,1,1},
- {0,0,0,0,0},
- {1,0,0,1,0},
- };
- ArrayToList(A[0], 5, G);
- HasPath(G, 1, 0);
- HasPath(G, 4, 1);
- return 0;
- }
运行结果:(2)输出简单路径:
源代码:
- void FindAPath(ALGraph *G,int u,int v,int path[],int d)
- {
-
- int w,i;
- ArcNode *p;
- visited[u]=1;
- d++;
- path[d]=u;
- if (u==v)
- {
- printf("一条简单路径为:");
- for (i=0; i<=d; i++)
- printf("%d ",path[i]);
- printf("\n");
- return;
- }
- p=G->adjlist[u].firstarc;
- while (p!=NULL)
- {
- w=p->adjvex;
- if (visited[w]==0)
- FindAPath(G,w,v,path,d);
- p=p->nextarc;
- }
- }
-
- void APath(ALGraph *G,int u,int v)
- {
- int i;
- int path[MAXV];
- for (i=0; i<G->n; i++)
- visited[i]=0;
- FindAPath(G,u,v,path,-1);
- }
主函数:
- int main()
- {
-
- ALGraph *G;
- int A[5][5]=
- {
- {0,0,0,0,0},
- {0,0,1,0,0},
- {0,0,0,1,1},
- {0,0,0,0,0},
- {1,0,0,1,0},
- };
- ArrayToList(A[0], 5, G);
- APath(G, 1, 0);
- APath(G, 4, 1);
- return 0;
- }
运行结果:
(3)输出所有路径:
源代码:
- void FindPaths(ALGraph *G,int u,int v,int path[],int d)
-
- {
- int w,i;
- ArcNode *p;
- visited[u]=1;
- d++;
- path[d]=u;
- if (u==v && d>1)
- {
- printf(" ");
- for (i=0; i<=d; i++)
- printf("%d ",path[i]);
- printf("\n");
- }
- p=G->adjlist[u].firstarc;
- while(p!=NULL)
- {
- w=p->adjvex;
- if (visited[w]==0)
- FindPaths(G,w,v,path,d);
- p=p->nextarc;
- }
- visited[u]=0;
- }
-
-
- void DispPaths(ALGraph *G,int u,int v)
- {
- int i;
- int path[MAXV];
- for (i=0; i<G->n; i++)
- visited[i]=0;
- printf("从%d到%d的所有路径:\n",u,v);
- FindPaths(G,u,v,path,-1);
- printf("\n");
- }
主函数:
- int main()
- {
- ALGraph *G;
- int A[5][5]=
- {
- {0,1,0,1,0},
- {1,0,1,0,0},
- {0,1,0,1,1},
- {1,0,1,0,1},
- {0,0,1,1,0}
- };
- ArrayToList(A[0], 5, G);
- DispPaths(G, 1, 4);
- return 0;
- }
运行结果:(4)输出一些简单回路:
源代码:
- void SomePaths(ALGraph *G,int u,int v,int s, int path[],int d)
-
- {
- int w,i;
- ArcNode *p;
- visited[u]=1;
- d++;
- path[d]=u;
- if (u==v && d==s)
- {
- printf(" ");
- for (i=0; i<=d; i++)
- printf("%d ",path[i]);
- printf("\n");
- }
- p=G->adjlist[u].firstarc;
- while(p!=NULL)
- {
- w=p->adjvex;
- if (visited[w]==0)
- SomePaths(G,w,v,s,path,d);
- p=p->nextarc;
- }
- visited[u]=0;
- }
-
- void DispSomePaths(ALGraph *G,int u,int v, int s)
- {
- int i;
- int path[MAXV];
- for (i=0; i<G->n; i++)
- visited[i]=0;
- printf("从%d到%d长为%d的路径:\n",u,v,s);
- SomePaths(G,u,v,s,path,-1);
- printf("\n");
- }
主函数:
- int main()
- {
- ALGraph *G;
- int A[5][5]=
- {
- {0,1,0,1,0},
- {1,0,1,0,0},
- {0,1,0,1,1},
- {1,0,1,0,1},
- {0,0,1,1,0}
- };
- ArrayToList(A[0], 5, G);
- DispSomePaths(G, 1, 4, 3);
- return 0;
- }
运行结果:
(5)输出通过一个节点的所有简单回路:
源代码:
- void DFSPath(ALGraph *G,int u,int v,int path[],int d)
-
- {
- int w,i;
- ArcNode *p;
- visited[u]=1;
- d++;
- path[d]=u;
- p=G->adjlist[u].firstarc;
- while (p!=NULL)
- {
- w=p->adjvex;
- if (w==v && d>0)
- {
- printf(" ");
- for (i=0; i<=d; i++)
- printf("%d ",path[i]);
- printf("%d \n",v);
- }
- if (visited[w]==0)
- DFSPath(G,w,v,path,d);
- p=p->nextarc;
- }
- visited[u]=0;
- }
-
- void FindCyclePath(ALGraph *G,int k)
-
- {
- int path[MAXV],i;
- for (i=0; i<G->n; i++)
- visited[i]=0;
- printf("经过顶点%d的所有回路\n",k);
- DFSPath(G,k,k,path,-1);
- printf("\n");
- }
主函数:
- int main()
- {
- ALGraph *G;
- int A[5][5]=
- {
- {0,1,1,0,0},
- {0,0,1,0,0},
- {0,0,0,1,1},
- {0,0,0,0,1},
- {1,0,0,0,0}
- };
- ArrayToList(A[0], 5, G);
- FindCyclePath(G, 0);
- return 0;
- }
运行结果:知识点总结:
图的遍历。
0 0