图的邻接表存储及DFS，BFS遍历

最新推荐文章于 2021-11-17 19:01:57 发布

zhangjc9401

最新推荐文章于 2021-11-17 19:01:57 发布

阅读量797

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++ 数据结构文章标签：数据结构 bfs dfs 遍历存储

本文链接：https://blog.youkuaiyun.com/zhangjc9401/article/details/43450801

C/C++ 数据结构专栏收录该内容

3 篇文章

订阅专栏

本文介绍了如何使用邻接表存储图，并提供了C++实现的深度优先搜索(DFS)和广度优先搜索(BFS)遍历算法。通过创建邻接表，输入顶点和边，然后遍历展示图的结构，并应用DFS和BFS进行图的遍历操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<queue>
#include<algorithm>
#define Status int//为了与数据结构的类C语言对应，故用Status代替
#define OK 1
#define ERROR 0
#define Max_Vertex_Num 20
#define InfoType int
#define VertexType char
using namespace std;
bool visited[Max_Vertex_Num];
Status(*VisitFunc)(VertexType v);
typedef struct ArcNode{
    int adjvex;//该弧所指的向的顶点位置
    struct ArcNode *nextarc;
    InfoType *info;//权
}ArcNode;
typedef struct VNode{
    VertexType data;//顶点信息
    ArcNode *firstarc;
}VNode,AdjList[Max_Vertex_Num];
typedef struct{
    AdjList vertices;
    int vexnum, arcnum;//顶点数，弧数
    //char kind;
}ALGraph;
Status Get_LocateVex(ALGraph G,char t)
{
    for (int i = 0; i < G.vexnum;i++)
    if (G.vertices[i].data == t)
        return i;
    return ERROR;
}
Status Create_ALGraph(ALGraph& G)//UD
{
    cout << "顶点数 弧数:";
    cin >> G.vexnum >> G.arcnum;
    cout << "顶点:";
    for (int i = 0; i < G.vexnum; i++){
        cin >> G.vertices[i].data;
        G.vertices[i].firstarc = NULL;
    }
    cout << "边:" << endl;
    for (int i = 0; i < G.arcnum; i++){
        ArcNode* s = new ArcNode;
        ArcNode* t = new ArcNode;
        if (!s || !t) return ERROR;
        VertexType vi, vj;
        cin >> vi >> vj;
        int ti = Get_LocateVex(G, vi);
        int tj = Get_LocateVex(G, vj);
        s->adjvex = tj;
        s->nextarc = G.vertices[ti].firstarc;
        G.vertices[ti].firstarc = s;
        t->adjvex = ti;
        t->nextarc = G.vertices[tj].firstarc;
        G.vertices[tj].firstarc = t;
    }
    return OK;
}
Status Print_AdjList(ALGraph G)
{
    cout << "*********************" << endl;
    for (int i = 0; i < G.vexnum; i++){
        cout << G.vertices[i].data;
        ArcNode* p = G.vertices[i].firstarc;
        while (p){
            cout << "->" << G.vertices[p->adjvex].data;
            p = p->nextarc;
        }
        cout << endl;
    }
    cout <<"*********************"<< endl;
    return OK;
}
Status FirstAdjVex(ALGraph G, int i)
{
    return G.vertices[i].firstarc ? G.vertices[i].firstarc->adjvex : -1;
}
Status NextAdjVex(ALGraph G, int i, int j)
{
    ArcNode* p = G.vertices[i].firstarc;
    while (p){
        if (p->adjvex == j)
            break;
        p = p->nextarc;
    }
    if (!p->nextarc || p->adjvex != j) return -1;
    return p->nextarc->adjvex;
}
Status DFS(ALGraph& G, int i)
{
    visited[i] = true;
    if (!VisitFunc(G.vertices[i].data)) return ERROR;
    for (int v = FirstAdjVex(G, i); v >= 0; v = NextAdjVex(G, i, v))
    if (!visited[v]) DFS(G, v);
    return OK;
}
Status DFSTraverse(ALGraph& G, Status(*visit)(VertexType v))
{
    cout << "DFS:";
    VisitFunc = visit;
    for (int i = 0; i < G.vexnum; i++)
        visited[i] = false;
    for (int i = 0; i < G.vexnum;i++)
    if (!visited[i]) DFS(G, i);
    cout << endl;
    return OK;
}
Status BFSTraverse(ALGraph& G, Status(*visit)(VertexType v))
{
    cout << "BFS:";
    queue<int> Q;
    for (int i = 0; i < G.vexnum; i++)
        visited[i] = false;
    for (int i = 0; i < G.vexnum;i++)
    if (!visited[i]){
        visited[i] = true;
        visit(G.vertices[i].data);
        Q.push(i);
        while (!Q.empty()){
            int j = Q.front();
            Q.pop();
            for (int k = FirstAdjVex(G, j); k >= 0; k = NextAdjVex(G, j, k))
            if (!visited[k]){
                visited[k] = true;
                visit(G.vertices[k].data);
                Q.push(k);
            }
        }
    }
    cout << endl;
    return OK;
}
Status Print(VertexType e)
{
    cout << "->" << e;
    return OK;
}
void main()
{
    ALGraph G;
    Create_ALGraph(G);
    cout << "AdjList:" << endl;
    Print_AdjList(G);
    DFSTraverse(G, Print);
    BFSTraverse(G, Print);
    system("Pause");
}