输出图中两点间的全部路径(可直接测试)
- 需要提前了解图以及图的存储和遍历的相关知识、回溯递归等要点,以下是具体代码实现
#include <iostream>
#include <stdio.h>
#include <stack>
#define null NULL
#define max_n 101
using namespace std;
typedef int vexType;
int visited[max_n];
typedef struct arcnode{
vexType vexid;
struct arcnode *nextarc;
}ArcNode,Vnode,vexList[max_n];
typedef struct {
int vexnum,edgenum;
vexList vexs;
}ALGraph;
void clear_visited(){
fill(visited,visited+max_n,false);
}
void init_g(ALGraph &g){
for(int i=0;i<=g.vexnum;i++){
g.vexs[i].vexid=i;
g.vexs[i].nextarc=null;
}
}
void show_g(ALGraph g){
for(int i=1;i<=g.vexnum;i++){
cout<<g.vexs[i].vexid<<"->";
ArcNode *p=g.vexs[i].nextarc;
while(p){
cout<<p->vexid<<"-";
p=p->nextarc;
}
cout<<"^"<<endl;
}
}
int my_index=0;
int my_path[max_n];
void GetAllPath(ALGraph g,int i,int j);
int main() {
ALGraph graph;
int m,n,u,v,ii,jj;
cin>>n>>m>>ii>>jj;
graph.vexnum=n;
graph.edgenum=m;
init_g(graph);
for(int i=0;i<m;i++){
cin>>u>>v;
ArcNode *p=(ArcNode *)malloc(sizeof(ArcNode));
ArcNode *q=(ArcNode *)malloc(sizeof(ArcNode));
p->vexid=u; p->nextarc=null;
q->vexid=v; q->nextarc=null;
p->nextarc=graph.vexs[v].nextarc;
graph.vexs[v].nextarc=p;
q->nextarc=graph.vexs[u].nextarc;
graph.vexs[u].nextarc=q;
}
show_g(graph);
GetAllPath(graph,ii,jj);
return 0;
}
void GetAllPath(ALGraph g,int i,int j){
if(i==j){
for(int k=0;k<my_index;k++){
printf("%d ",my_path[k]);
}
printf("\n");
my_index--;
visited[i]=false;
return;
}
if(!visited[i]){
visited[i]=true;
my_path[my_index++]=i;
}
ArcNode *p=g.vexs[i].nextarc;
while(p){
if(!visited[p->vexid]){
visited[p->vexid]=true;
my_path[my_index++]=p->vexid;
GetAllPath(g,p->vexid,j);
}
p=p->nextarc;
}
my_index--;
visited[i]=false;
}