1.广度优先搜索
#include<bits/stdc++.h>
using namespace std;
typedef int vrtype;
typedef int infotype;
typedef char vertextype;
#define infinity 10000
#define max_vertex_num 20
#define error 0
#define ok 1
typedef int qelemtype;
typedef struct qnode
{
qelemtype data;
struct qnode *next;
}qnode,*queueptr;
typedef struct{
queueptr front;
queueptr rear;
}linkqueue;
typedef int status;
typedef int graphkind;
typedef struct arccell{
vrtype adj;
infotype info;
}arccell,adjmatrix[max_vertex_num][max_vertex_num];
typedef struct{
vertextype vexs[max_vertex_num];
adjmatrix arcs;
int vexnum,arcnum;
graphkind kind;
}mgraph;
bool visited[max_vertex_num];
int locatevex(mgraph g,vertextype v)
{
int i;
for(i=0;i<g.vexnum;i++)
if(g.vexs[i]==v)
return i;
return -1;
}
status createdn(mgraph &g)
{
vertextype v1,v2;
int w,i,j,k;
cin>>g.kind>>g.vexnum>>g.arcnum;
for(i=0;i<g.vexnum;i++)
cin>>g.vexs[i];
for(i=0;i<g.vexnum;i++)
for(j=0;j<g.vexnum;j++)
g.arcs[i][j].adj=infinity;
for(k=0;k<g.arcnum;k++)
{
cin>>v1>>v2;
cin>>w;
i=locatevex(g,v1);
j=locatevex(g,v2);
g.arcs[i][j].adj=w;
}
return ok;
}
int firstadjvex(mgraph g,int v)
{
if(v<0||v>g.vexnum-1) return -1;
for(int j=0;j<=g.vexnum-1;j++)
if(g.arcs[v][j].adj!=0) return j;
return -1;
}
int nextadjvex(mgraph g,int v,int w)
{
for(int j=w+1;j<=g.vexnum-1;j++)
if(g.arcs[v][j].adj!=0) return j;
return -1;
}
status initqueue(linkqueue &q)
{
q.front=q.rear=(queueptr)malloc(sizeof(qnode));
if(!q.front) return error;
q.front->next=NULL;
return ok;
}
status enqueue(linkqueue &q,qelemtype e)
{
queueptr p;
p=(queueptr)malloc(sizeof(qnode));
if(!p) return error;
p->data=e;
p->next=NULL;
q.rear->next=p;
q.rear=p;
return ok;
}
bool queueempty(linkqueue q)
{
if(q.front==q.rear) return true;
else return false;
}
status dequeue(linkqueue &q,qelemtype &e)
{
queueptr p;
if(q.front==q.rear)
return error;
p=q.front->next;
e=p->data;
q.front->next=p->next;
if(q.rear==p)
q.rear=q.front;
free(p);
return ok;
}
void bfstraverse(mgraph g)
{
linkqueue q;
qelemtype u;
for(int v=0;v<g.vexnum;v++)
visited[v]=false;
initqueue(q);
for(int v=0;v<g.vexnum;v++)
if(!visited[v])
{
visited[v]=true;
cout<<g.vexs[v];
enqueue(q,u);
while(!queueempty(q))
{
dequeue(q,u);
for(int w=firstadjvex(g,u);w>=0;w=nextadjvex(g,u,w))
if(!visited[w])
{
visited[w]=true;
cout<<g.vexs[w];
enqueue(q,w);
}
}
}
}
int main()
{
mgraph g;
createdn(g);
cout<<"bfs:";
bfstraverse(g);
cout<<endl;
return 0;
}
2.深度优先搜索
#include<bits/stdc++.h>
using namespace std;
typedef int vrtype;
typedef int infotype;
typedef char vertextype;
#define infinity 10000
#define max_vertex_num 20
#define error 0
#define ok 1
typedef int status;
typedef int graphkind;
typedef struct arccell{
vrtype adj;
infotype info;
}arccell,adjmatrix[max_vertex_num][max_vertex_num];
typedef struct{
vertextype vexs[max_vertex_num];
adjmatrix arcs;
int vexnum,arcnum;
graphkind kind;
}mgraph;
bool visited[max_vertex_num];
int locatevex(mgraph g,vertextype v)
{
int i;
for(i=0;i<g.vexnum;i++)
if(g.vexs[i]==v)
return i;
return -1;
}
status createdn(mgraph &g)
{
vertextype v1,v2;
int w,i,j,k;
cin>>g.kind>>g.vexnum>>g.arcnum;
for(i=0;i<g.vexnum;i++)
cin>>g.vexs[i];
for(i=0;i<g.vexnum;i++)
for(j=0;j<g.vexnum;j++)
g.arcs[i][j].adj=infinity;
for(k=0;k<g.arcnum;k++)
{
cin>>v1>>v2;
cin>>w;
i=locatevex(g,v1);
j=locatevex(g,v2);
g.arcs[i][j].adj=w;
}
return ok;
}
int firstadjvex(mgraph g,int v)
{
if(v<0||v>g.vexnum-1) return -1;
for(int j=0;j<=g.vexnum-1;j++)
if(g.arcs[v][j].adj!=0) return j;
return -1;
}
int nextadjvex(mgraph g,int v,int w)
{
for(int j=w+1;j<=g.vexnum-1;j++)
if(g.arcs[v][j].adj!=0) return j;
return -1;
}
void dfs(mgraph g,int v)
{
visited[v]=true;
cout<<g.vexs[v];
for(int w=firstadjvex(g,v);w>=0;w=nextadjvex(g,v,w))
if(!visited[w])
dfs(g,w);
}
void dfstraverse(mgraph g)
{
for(int v=0;v<g.vexnum;v++)
visited[v]=false;
for(int v=0;v<g.vexnum;v++)
if(!visited[v])
dfs(g,v);
}
int main()
{
mgraph g;
createdn(g);
cout<<"dfs:";
dfstraverse(g);
cout<<endl;
return 0;
}