用邻接矩阵实现的深度优先遍历和广度优先遍历

#include <stdio.h>
#include <stdlib.h>
#include <queue>
#include <algorithm>
using namespace std;

#define ERROR -1
#define MAXVEX 100      

typedef int VertexType;
typedef int VRType;
typedef int EdgeType;
bool visited[MAXVEX];    //访问标志数组

typedef struct ArcCell
{
    VRType adj;
}ArcCell, AdjMatrix[MAXVEX][MAXVEX];

typedef struct
{
    VertexType vexs[MAXVEX];    //顶点向量
    AdjMatrix arcs;    //邻接矩阵
    int vexnum;        //顶点数
    int arcnum;        //边数
}MGraph;

/********* 按照顶点的信息找下表 ********/
int LocateVex(MGraph G, int v){
    int i;
    for (i = 0; i < G.vexnum; ++i){
        if (G.vexs[i] == v)        //找到相匹配的
            break;
    }
    if (i<G.vexnum)        //如果存在就返回该下标
        return i;
    else
        return ERROR;    //否则返回错误
}

/********* 进行深搜 *********/
void DFS(MGraph G, int i)
{
    int j;
    visited[i] = true;    //标记为访问过
    printf("%d ", G.vexs[i]);    //打印出该顶点的名字
    for (j = 0; j<G.vexnum; j++)
    if (G.arcs[i][j].adj == 1 && !visited[j])
        DFS(G, j);
}

/********* 开始对图进行遍历 *********/
void DFSTraverse(MGraph G)
{
    int i;
    for (i = 0; i<G.vexnum; i++)
        visited[i] = false;
    for (i = 0; i<G.vexnum; i++)
    if (!visited[i])
        DFS(G, i);
}

/********* 建图 *********/
void SetGraph(MGraph &G){
    printf("请输入图的顶点数目: ");
    scanf("%d", &G.vexnum);
    for (int i = 0; i<G.vexnum; ++i)
    {
        printf("请输入第%d个顶点信息：", i + 1);
        scanf("%d", &G.vexs[i]);
    }
    printf("请输入图的边的数目: ");
    scanf("%d", &G.arcnum);
    //将矩阵进行初始化
    for (int i = 0; i < G.vexnum; i++){
        for (int j = 0; j < G.vexnum; j++){
            G.arcs[i][j].adj = 0;
        }
    }
    printf("输入格式为“顶点a 顶点b”
");
    for (int k = 0; k < G.arcnum; ++k)
    {
        int v1, v2, m, n;
        printf("请输入第 %d 条边的起始点和终端点: ", k + 1);
        scanf("%d%d", &v1, &v2);
        m = LocateVex(G, v1);    //找出所对应的下标
        n = LocateVex(G, v2);
        if (m >= 0 && n >= 0)    //满足情况的话
        {
            G.arcs[m][n].adj = 1;    //n--m 之间存在边
            G.arcs[n][m].adj = 1;
        }
        else
            printf("输入错误!
");
    }
}

/******** 广搜 ********/
void BFS(MGraph G, int i){
    queue<int>q;
    while (!q.empty()){
        q.pop();
    }
    q.push(i);
    while (!q.empty()){
        int u = q.front();
        q.pop();
        if (visited[u])
            continue;
        printf("%d ", G.vexs[u]);
        visited[u] = true;
        for (int j = 0; j < G.vexnum; j++){
            if (G.arcs[i][j].adj == 1 && !visited[j])
                q.push(j);
        }
    }
}

/******** 进行广搜 *******/
void BFSTraverse(MGraph G){
    for (int i = 0; i < G.vexnum; i++){
        visited[i] = false;
    }
    for (int i = 0; i<G.vexnum; i++)
    if (!visited[i])
        BFS(G, i);
}

int main()
{
    MGraph G;
    SetGraph(G);
    DFSTraverse(G);
    printf("



");
    BFSTraverse(G);
    printf("
");
    return 0;
}