用鄰接矩陣和鄰接表創建圖

#include <iostream>
using namespace std;

#define INFINITY 65536//無窮大
#define    MAX_VERTEX_NUM 10//最大頂點個數
typedef enum{DG,DN,UDG,UDN}GraphKind;//有向圖，有向網，無向圖，無向網
struct Graph
{
    char vexs[MAX_VERTEX_NUM];//儲存頂點
    int arc[MAX_VERTEX_NUM][MAX_VERTEX_NUM];//鄰接矩陣
    int vexnum, arcnum;//頂點數和邊（弧）數
    GraphKind kind;//圖的種類
};
//確定頂點序號
int LocateVex(Graph *G, char ch)
{
    for (int i = 0; i < G->vexnum; i++)
        if (G->vexs[i] == ch)
        {
            return i;//返回頂點序號
            break;
        }
    return -1;
}
void CreateUDN(Graph *G)//創建無向網
{
    int i, j;
    char v1, v2;//記錄頂點名稱
    int w;//記錄權值
    cout << "請輸入頂點個數：" << endl;cin >> G->vexnum;
    cout << "請輸入邊的個數：" << endl;cin >> G->arcnum;
    cout << "構造頂點：" << endl;
    for (int i = 0; i < G->vexnum; i++)//構造頂點
        cin >> G->vexs[i];
    for (int i = 0; i < G->vexnum; i++)//初始化鄰接矩陣
        for (int j = 0; j < G->vexnum; j++)
            G->arc[i][j] = 0;
    cout << "構造鄰接矩陣：" << endl;
    for (int k = 0; k < G->arcnum; k++)
    {
        cin >> v1 >> v2 >> w;
        i = LocateVex(G, v1);
        j = LocateVex(G, v2);
        G->arc[j][i] = G->arc[i][j] = w;
    }
}
void CreateGraph(Graph *G)
{
    switch (G->kind)
    {
    //case DG:return CreateDG(G);
    //case DN:return CreateDN(G);
    //case UDG:return CreateUDG(G);
    case UDN:return CreateUDN(G);
    }
}
//遍歷鄰接矩陣
void PrintArc(Graph *G)
{
    int i, j;
    for (i = 0; i < G->vexnum; i++)
    {
        for (j = 0; j < G->vexnum; j++)
            cout << G->arc[i][j] << " ";
        cout << endl;
    }
}
//深度優先遍歷（鄰接矩陣儲存）
int visited[MAX_VERTEX_NUM] = { 0 };//初始化元素為0
void DFS_Arc(Graph *G,int v)//遞歸實現,v為某個頂點
{
    if(visited[v]==0)
        cout << G->vexs[v] << " ";
    visited[v] = 1;
    for (int j = 0; j < G->vexnum; j++)
    {
        if (G->arc[v][j] != 0 && visited[j] == 0)
            DFS_Arc(G,j);
    }
}


//鄰接表
struct ENode//邊結點
{
    int index;//邊所指向的點的序號
    int info;//記錄權值
    struct ENode* next;//指向下一條邊
};
struct VNode//頂點結點
{
    char data;//頂點名稱
    ENode* first;//指向頂點的第一個鄰邊
};
struct AGraph//記錄圖的信息
{
    int vexnum, arcnum;//頂點數和邊數
    VNode p[MAX_VERTEX_NUM];//頂點數組
    GraphKind kind;//圖的種類
};

int LocateVex(AGraph *G,char ch)
{
    for (int i = 0; i < G->vexnum; i++)
        if (ch == G->p[i].data)
        {
            return i;
            break;
        }
    return -1;
}
//創建鄰接表
void CreateAGraph(AGraph *G)
{
    int i, j, info;
    char v1, v2;
    cout << "請輸入頂點個數：" << endl; cin >> G->vexnum;
    cout << "請輸入邊的個數：" << endl; cin >> G->arcnum;
    cout << "構造頂點：" << endl;
    for (int i = 0; i < G->vexnum; i++)//構造頂點數組
    {
        cin >> G->p[i].data;
        G->p[i].first = NULL;
    }
    cout << "構造鄰接表：" << endl;
    for (int k = 0; k < G->arcnum; k++)
    {
        cin >> v1 >> v2 >> info;
        i = LocateVex(G, v1);
        j = LocateVex(G, v2);
        ENode *E = (ENode*)malloc(sizeof(ENode));
        E->index = j;
        E->info = info;
        E->next = G->p[i].first;//頭插法
        G->p[i].first = E;
    }
}
//打印鄰接表
void PrintAGraph(AGraph *G)
{
    for (int i = 0; i < G->vexnum; i++)
    {
        cout << G->p[i].data;
        if (G->p[i].first != NULL)
        {
            ENode *p = G->p[i].first;
            while (p->next != NULL)
            {
                cout << "->" << p->index;
                p = p->next;
            }
            cout << "->" << p->index;
        }
        cout << endl;
    }
}
//深度優先遍歷（鄰接表儲存）
int visited1[MAX_VERTEX_NUM] = { 0 };
void DFS_List(AGraph *G, int v)
{
    if (visited1[v] == 0)
        cout << G->p[v].data << " ";
    visited1[v] = 1;
    if (G->p[v].first != NULL)
    {
        ENode *p = G->p[v].first;
        DFS_List(G, p->index);
        while (p->next != NULL)
        {
            p = p->next;
            DFS_List(G, p->index);
        }
    }
}
int main()
{
    Graph *G=(Graph*)malloc(sizeof(Graph));
    G->kind = UDN;
    CreateGraph(G);
    PrintArc(G);
    cout << endl << "深度優先遍歷：" << endl;
    DFS_Arc(G, 0);
    cout << endl;
    cout << "-------------------------------------" << endl;
    cout << "鄰接表：" << endl;
    AGraph *AG=(AGraph*)malloc(sizeof(AGraph));
    CreateAGraph(AG);
    PrintAGraph(AG);
    cout << "深度優先遍歷：" << endl;
    DFS_List(AG, 0);
    system("pause");
    return 0;
}

運行結果：