【数据结构·图论】邻接矩阵模板（C++)

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <unordered_map>
using namespace std;
template <class TypeOfVer, class TypeOfEdge>
class adjmatrix_graph {
public:
    int Vers;
    int Edges;
    TypeOfEdge noEdge;
    string GraphKind;
    vector<vector<TypeOfEdge>> edge;
    vector<TypeOfVer>  ver;
    bool DIRECTION = false, WEIGHT = false;
    adjmatrix_graph()
    {
        Vers = 0;
        Edges = 0;
        noEdge = 0;
        edge.clear();
        ver.clear();

    }

    bool GraphisEmpty() { return Vers == 0; }
    string GetGraphKind() { return GraphKind; }
    TypeOfVer GetVer(int u) {
        return ver[u];
    }
    int GetFirstAdjVex(int u) {
        for (int i = 0; i < Vers; ++i)if (edge[u][i] != noEdge)return i;
        return -1;

    }


    int GetNextAdjVex(int u, int v) {
        for (int i = v + 1; i < Vers; ++i)
            if (edge[u][i] != noEdge)return i;
        return -1;
    }

    int LocateVer(TypeOfVer data) {
        int u = 0;
        while (u < Vers && ver[u] != data)++u;
        if (u == Vers)return -1;
        return u;
    }
    bool PrintMatrix() {
        for (int i = 0; i < Vers; i++)
        {
            for (int j = 0; j < Vers - 1; j++)
                cout << edge[i][j] << " ";
            cout << edge[i][Vers - 1] << " ";
            cout << endl;
        }
        return 1;
    }
    void CreateGraph(bool need_emp)
    {
        cin >> GraphKind;//图的类型 
        cin >> Vers;//结点数
        ver.resize(Vers);
        for (int i = 0; i < Vers; i++)//结点集
            cin >> ver[i];

        if (need_emp)
            cin >> noEdge;//无边标记

        vector<TypeOfEdge> line;//邻接矩阵初始化
        for (int j = 0; j < Vers; j++)
        {
            for (int i = 0; i < Vers; i++)
                line.push_back(noEdge);
            edge.push_back(line);
        }

        cin >> Edges;//边数
        vector<int> x_p, y_p, w_p;
        for (int i = 0; i < Edges; i++)
        {
            int c_x, c_y;
            cin >> c_x >> c_y;
            x_p.push_back(c_x);
            y_p.push_back(c_y);
        }

        if (GraphKind == "DG")//DG（有向图）
            DIRECTION = true, WEIGHT = false;
        if (GraphKind == "DN")//DN（有向网）
            DIRECTION = true, WEIGHT = true;
        if (GraphKind == "UDG")//UDG（无向图）
            DIRECTION = false, WEIGHT = false;
        if (GraphKind == "UDN")//UDN（无向网）
            DIRECTION = false, WEIGHT = true;

        if (WEIGHT)
            for (int i = 0; i < Edges; i++)
            {
                int c_w;
                cin >> c_w;
                w_p.push_back(c_w);
            }

        for (int i = 0; i < Edges; i++)
        {
            if (DIRECTION == false)//无向图操作
            {
                if (WEIGHT == true)//带权值的网的操作
                    edge[x_p[i]][y_p[i]] = edge[y_p[i]][x_p[i]] = w_p[i];
                else//无权值操作
                    edge[x_p[i]][y_p[i]] = edge[y_p[i]][x_p[i]] = 1;
            }
            else
            {
                if (WEIGHT == true)//带权值的网的操作
                    edge[x_p[i]][y_p[i]] = w_p[i];
                else//无权值操作
                    edge[x_p[i]][y_p[i]] = 1;
            }
        }
    }
    bool InsertVer(const TypeOfVer& data) {

        ver.push_back(data);
        for (int i = 0; i < Vers; ++i) {
            edge[i].resize(Vers + 1);
        }
        vector<TypeOfEdge>tmp(Vers + 1);
        edge.push_back(tmp);
        ++Vers;
        return 1;
    }
    int GetVerNum() { return Vers; }
    int GetEdgeNum() { return Edges; }
    bool Insert_Edge(int u, int v) {
        if (edge[u][v] != noEdge)return false;
        edge[u][v] = 1;
        return true;
    }
    bool Insert_Edge(int u, int v, TypeOfEdge w) {
        if (edge[u][v] != noEdge)return false;
        edge[u][v] = w;
        return true;
    }
    bool DeleteVer(const TypeOfVer& data) {
        vector<vector<TypeOfEdge>> newedge;
        vector<TypeOfVer>  newver;
        int u = 0;
        while (u < Vers && ver[u] != data)++u;
        if (u == Vers)return false;

        for (auto i : ver)if (i != data)newver.push_back(i);

        for (int i = 0; i < Vers; ++i) {
            if (i == u)continue;
            vector<TypeOfEdge> row;
            for (int j = 0; j < Vers; ++j) {
                if (j == u)continue;
                row.push_back(edge[i][j]);
            }
            newedge.push_back(row);
        }
        ver = newver;
        edge = newedge;
        --Vers;
        return true;
    }
    bool Delete_Edge(int u, int v) {
        if (DIRECTION) {
            if (edge[u][v] == noEdge)return false;
            edge[u][v] = noEdge;
            --Edges;
            return true;
        }
        else {
            if (edge[u][v] == noEdge || edge[v][u] == noEdge)return false;
            edge[u][v] = edge[v][u] = noEdge;
            --Edges;
            return true;
        }
    }
    bool Delete_Edge(int u, int v, TypeOfEdge w) {
        if (DIRECTION) {
            if (edge[u][v] != w)return false;
            edge[u][v] = noEdge;
            --Edges;
            return true;
        }
        else {
            if (edge[u][v] != w || edge[v][u] != w)return false;
            edge[u][v] = edge[v][u] = noEdge;
            --Edges;
            return true;
        }
    }
    void DFS_Traverse(int u) {
        //todo
        for (int i = 0; i < Vers; ++i)if (edge[u][i] != noEdge)DFS_Traverse(i);
    }

    void BFS_Traverse(int u) {
        unordered_map<int, bool>vis;
        queue<int>q;
        q.push(u);
        while (q.size()) {
            int obj = q.front();
            q.pop();
            //todo
        }
        cout << endl;
    }
    ~adjmatrix_graph() {}
    void Print_Format(bool Type) {
        if (Type)cout << GetGraphKind() << endl;
        for (auto i : ver) {
            cout << i << " \n"[i == ver.back()];
        }
        cout << endl;
        PrintMatrix();
    }
};