第12周 项目3 - 图遍历算法实现

/* 
 * Copyright (c).2014, 烟台大学计算机学院 
 * All rights reserved. 
 *文件名称:cpp1.cpp 
 *作    者:董子宾 
 *完成日期:2015年 11月 30日 
 *版 本 号:v1.0 
 * 
 *问题描述：深度优先遍历，广度优先遍历。
 *输入描述：无
 *程序输出：测试结果
 */ 

深度优先遍历。

<code class="hljs perl has-numbering"><span class="hljs-comment">#include <stdio.h></span>
<span class="hljs-comment">#include <malloc.h></span>
<span class="hljs-comment">#include "graph.h"</span>
<span class="hljs-keyword">int</span> visited[MAXV];
void DFS(ALGraph <span class="hljs-variable">*G</span>, <span class="hljs-keyword">int</span> v)
{
    ArcNode <span class="hljs-variable">*p</span>;
    <span class="hljs-keyword">int</span> w;
    visited[v]=<span class="hljs-number">1</span>;
    <span class="hljs-keyword">printf</span>(<span class="hljs-string">"<span class="hljs-variable">%d</span> "</span>, v);
    p=G->adjlist[v].firstarc;
    <span class="hljs-keyword">while</span> (p!=NULL)
    {
        w=p->adjvex;
        <span class="hljs-keyword">if</span> (visited[w]==<span class="hljs-number">0</span>)
            DFS(G,w);
        p=p->nextarc;
    }
}

<span class="hljs-keyword">int</span> main()
{
    <span class="hljs-keyword">int</span> i;
    ALGraph <span class="hljs-variable">*G</span>;
    <span class="hljs-keyword">int</span> A[<span class="hljs-number">5</span>][<span class="hljs-number">5</span>]=
    {
        {<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>},
        {<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">0</span>},
        {<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">1</span>},
        {<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>},
        {<span class="hljs-number">0</span>,<span class="hljs-number">0</span>,<span class="hljs-number">1</span>,<span class="hljs-number">1</span>,<span class="hljs-number">0</span>}
    };
    ArrayToList(A[<span class="hljs-number">0</span>], <span class="hljs-number">5</span>, G);

    <span class="hljs-keyword">for</span>(i=<span class="hljs-number">0</span>; i<MAXV; i++) visited[i]=<span class="hljs-number">0</span>;
    <span class="hljs-keyword">printf</span>(<span class="hljs-string">" 由2开始深度遍历:"</span>);
    DFS(G, <span class="hljs-number">2</span>);
    <span class="hljs-keyword">printf</span>(<span class="hljs-string">"\n"</span>);

    <span class="hljs-keyword">for</span>(i=<span class="hljs-number">0</span>; i<MAXV; i++) visited[i]=<span class="hljs-number">0</span>;
    <span class="hljs-keyword">printf</span>(<span class="hljs-string">" 由0开始深度遍历:"</span>);
    DFS(G, <span class="hljs-number">0</span>);
    <span class="hljs-keyword">printf</span>(<span class="hljs-string">"\n"</span>);
    <span class="hljs-keyword">return</span> <span class="hljs-number">0</span>;
}</code><ul style="FILTER:  ; ZOOM: 1" class="pre-numbering"><li></li></ul>

问题及代码：

广度优先遍历

#include <stdio.h>
#include <malloc.h>
#include "graph.h"

void BFS(ALGraph *G, int v)
{
    ArcNode *p;
    int w,i;
    int queue[MAXV],front=0,rear=0; //定义循环队列
    int visited[MAXV];     //定义存放节点的访问标志的数组
    for (i=0; i<G->n; i++) visited[i]=0; //访问标志数组初始化
    printf("%2d",v);            //输出被访问顶点的编号
    visited[v]=1;                       //置已访问标记
    rear=(rear+1)%MAXV;
    queue[rear]=v;              //v进队
    while (front!=rear)         //若队列不空时循环
    {
        front=(front+1)%MAXV;
        w=queue[front];             //出队并赋给w
        p=G->adjlist[w].firstarc;   //找w的第一个的邻接点
        while (p!=NULL)
        {
            if (visited[p->adjvex]==0)
            {
                printf("%2d",p->adjvex); //访问之
                visited[p->adjvex]=1;
                rear=(rear+1)%MAXV; //该顶点进队
                queue[rear]=p->adjvex;
            }
            p=p->nextarc;       //找下一个邻接顶点
        }
    }
    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);

    printf(" 由2开始广度遍历:");
    BFS(G, 2);

    printf(" 由0开始广度遍历:");
    BFS(G, 0);
    return 0;
}