在执行广度优先搜索过程中,将构造出一棵广度优先树。一开始,该树仅含有根结点,就是源结点s。在扫描已发现结点u的邻接链表时,每当发现一个白色结点v,就将该结点v加入该棵树中。在广度优先树中,称结点u是结点v的前驱或父结点。
在广度优先搜索树里从结点s到结点v的简单路径所对应的就是图G中从结点s到结点v的最短路径,即包含最少边数的路径。
文件Queue.h见队列篇中所写的。
#include "Queue.h"
#include <iostream>
using namespace std;
typedef enum Color
{
GRAY,
WHITE,
BLACK
}COLOR;
typedef struct Node
{
int count; //边的条数
int d; //与起始点的距离
int vertex; //顶点
struct Node* p; //父结点
COLOR color;
}NODE,*NODE_POINT;
typedef struct Graph
{
int value;//边的权值
struct Node* link;
}GRAPH,*GRAPH_POINT;
//最短路径(s到v的最短路径,此方法只适用于广度优先搜索的无权图)
void PRINT_PATH(NODE_POINT s,NODE_POINT v,char *str)
{
if(v==s)
{
printf("%d",s->vertex);
}
else if(v->p==NULL)
{
printf("no path from s to v\n");
}
else
{
PRINT_PATH(s,v->p,"->");
printf("%d",v->vertex);
}
printf("%s",str);
}
int _tmain(int argc, _TCHAR* argv[])
{
NODE node[5];
int i;
GRAPH **graph;
graph=(GRAPH**)malloc(5*sizeof(GRAPH*));
graph[0]=(GRAPH*)malloc(2*sizeof(GRAPH));
graph[1]=(GRAPH*)malloc(4*sizeof(GRAPH));
graph[2]=(GRAPH*)malloc(2*sizeof(GRAPH));
graph[3]=(GRAPH*)malloc(3*sizeof(GRAPH));
graph[4]=(GRAPH*)malloc(3*sizeof(GRAPH));
for(i=0;i<5;++i)
{
node[i].vertex=i+1;
node[i].color=WHITE;
node[i].d=-1;
node[i].p=NULL;
}
node[0].count=2;
node[1].count=4;
node[2].count=2;
node[3].count=3;
node[4].count=3;
graph[0][0].link=&node[1];
graph[0][1].link=&node[4];
graph[1][0].link=&node[0];
graph[1][1].link=&node[4];
graph[1][2].link=&node[2];
graph[1][3].link=&node[3];
graph[2][0].link=&node[1];
graph[2][1].link=&node[3];
graph[3][0].link=&node[1];
graph[3][1].link=&node[4];
graph[3][2].link=&node[2];
graph[4][0].link=&node[3];
graph[4][1].link=&node[0];
graph[4][2].link=&node[1];
Queue<Node> queue;
NODE * u;
node[0].color=GRAY;
node[0].d=0;
//将头结点入队列
queue.PUSH(node[0]);
while(!queue.QUEUE_EMPTY())
{
//取出队列里的元素
u=&queue.POP();
for(i=0;i<u->count;++i)
{
if(graph[u->vertex-1][i].link->color==WHITE)
{
graph[u->vertex-1][i].link->color=GRAY;
graph[u->vertex-1][i].link->d=u->d+1;
graph[u->vertex-1][i].link->p=&node[u->vertex-1];
//将与它相邻的结点入队列
queue.PUSH(*(graph[u->vertex-1][i].link));
}
}
node[u->vertex-1].color=BLACK;
}
PRINT_PATH(&node[0],&node[3]," \n");
for(i=0;i<5;++i)
{
free(graph[i]);
}
free(graph);
system("pause");
return 0;
}