数据结构那点事-图的遍历

#define GRAPHMAT_H

#include <iostream>
using namespace std;

#define MAX_VERTEX_NUM  20                              //图的最大顶点
#define INF             10000                           //最大极值
typedef enum{ DG, DN, UDG, UDN } GraphKind;                  //图的种类
typedef int TYPE;                                       //数据的类型

class GraphMat
{
public:
    GraphMat(GraphKind k);
    ~GraphMat();
private:
    /*
    *图的邻接矩阵一般需要6个信息
    *1、图的种类。枚举类型:有向图DG，有向网DN，无向图UDG，无向网UDN。
    *2、图的顶点个数
    *3、顶点的数据值数组GraphMat(GraphKind k) :kind(k), vex_num(0);
    *4、图的边（弧）个数
    *5、邻接矩阵。对图：用1或0表示两顶点是否相邻；对网：表示两顶点之间的权值。
    *6、遍历标志
    */
    GraphKind kind;
    int vex_num;
    TYPE vexs[MAX_VERTEX_NUM];
    int arc_num;
    int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
    bool is_trav[MAX_VERTEX_NUM];
public:
    void CreateGraph();                                 //构造一个图
    void BFSTraverse();                                 //广度优先遍历
    void DFSTraverse();                                 //深度优先遍历
private:
    void BFSFunction(int);                              //广度优先
    void DFSFunction(int);                              //深度优先
};

GraphMat::GraphMat(GraphKind k = UDG)
    :kind(k), vex_num(0), arc_num(0)
{
    //清空矩阵
    for (int i = 0; i < MAX_VERTEX_NUM; i++)
    {
        for (int j = 0; j < MAX_VERTEX_NUM; j++)
            arcs[i][j] = INF;                           //设置矩阵中各元素的值为最大值  
    }
    //清空遍历标志
    for (int i = 0; i < MAX_VERTEX_NUM; i++){
        is_trav[i] = 0;
    }
}


GraphMat::~GraphMat()
{
}

void GraphMat::CreateGraph()
{
    cout << "输入顶点元素的个数" << endl;
    cin >> vex_num;
    cout << "输入顶点元素的类型值" << endl;
    for (int i = 0; i < vex_num; i++){
        cin >> vexs[i];
    }

    cout << "输入邻接矩阵的大小" << endl;
    cin >> arc_num;
    cout << "输入邻接矩阵" << endl;
    for (int i = 0; i < arc_num; i++){
        for (int j = 0; j < arc_num; j++){
            cin >> arcs[i][j];
        }
    }
}

//广度优先遍历
void GraphMat::BFSTraverse()
{
    //将标记清0
    for (int i = 0; i < vex_num; i++){
        is_trav[i] = 0;
    }
    //对顶点遍历
    for (int i = 0; i < vex_num; i++){
        //if (!is_trav[i]){
        //  BFSFunction(i);
        //}
        BFSFunction(i);
    }
}

void GraphMat::BFSFunction(int i)
{
    if (!is_trav[i]){
        is_trav[i] = 1;                                     //标记顶点
        cout << "->" << vexs[i];
    }
    for (int j = 0; j < vex_num; j++){
        if (arcs[i][j] != 0 && !is_trav[j]){
            cout << "->" << vexs[j];
            is_trav[j] = 1;
        }
    }
}

void GraphMat::DFSTraverse()
{
    //将标记清0
    for (int i = 0; i < vex_num; i++){
        is_trav[i] = 0;
    }
    //对顶点遍历
    for (int i = 0; i < vex_num; i++){
        if (!is_trav[i]){
            DFSFunction(i);
        }
    }
}

void GraphMat::DFSFunction(int i)
{
    is_trav[i] = 1;
    cout << "->" << vexs[i];
    for (int j = 0; j < vex_num; j++){
        if (arcs[i][j] != 0 && !is_trav[j]){
            DFSFunction(j);
        }
    }
}
int main()
{
    GraphMat graph(UDG);
    graph.CreateGraph();
    cout << "广度遍历效果 ： " << endl;
    graph.BFSTraverse();
    cout << endl;
    cout << "深度遍历效果 ： " << endl;
    graph.DFSTraverse();
    cout << endl;
    return 0;
}