实验：图的创建

6-1 jmu-ds-邻接矩阵实现图的操作集 ( 30分) 

1. 关键代码

void CreateMGraph(MGraph& g, int n, int e)
{
    int i, j;
    g.n = n;
    g.e = e;
    for (i = 1;i < MAXV;i++) 
    {
        for (j =1;j < MAXV;j++)
        {
            g.edges[i][j] = 0;
        }
    }
    int a, b;
    for (i = 0;i < e;i++)
    {
        cin >> a >> b;
        g.edges[a][b] = 1;
        g.edges[b][a] = 1;
    }
}
void DFS(MGraph g, int v)
{
    static int n = 0;
    if (visited[v] == 0)
    {
        if (n == 0)
        {
            cout << v;
            n++;
        }
        else
        {
            cout << " " << v;
            n++;
        }
        visited[v] = 1;
    }
        for (int j = 1;j <= g.n;j++)
        {
            if (g.edges[v][j] && visited[j] == 0)
            {
                DFS(g, j);
            }
        }
}
#include <queue>
void BFS(MGraph g, int v)
{
    int t;
    queue<int>q;
    if (visited[v] == 0)
    {
        cout << v;
        visited[v] = 1;
        q.push(v);
    }
    while (!q.empty())
    {
        t = q.front();
        q.pop();
        for (int j = 1;j <= g.n;j++)
        {
            if (g.edges[t][j] == 1 && visited[j] == 0)
            {
                cout << " " << j;
                visited[j] = 1;
                q.push(j);
            }
        }
    }
}

　　  2.运行截图

6-2 jmu-ds-图邻接表操作 (20 分) 

1. 关键代码

void CreateAdj(AdjGraph*& G, int n, int e)
{
    int i;
    G = new AdjGraph;
    G->e = e;
    G->n = n;
    for (i = 1;i <= n;i++) {
        G->adjlist[i].firstarc = NULL;
    }
    for (i = 1;i <= e;i++)
    {
        int a, b;
        cin >> a >> b;
        ArcNode* p, * q;
        p = new ArcNode;
        q = new ArcNode;
        p->adjvex = b;
        q->adjvex = a;
        p->nextarc = G->adjlist[a].firstarc;
        G->adjlist[a].firstarc= p;
        q->nextarc = G->adjlist[b].firstarc;
        G->adjlist[b].firstarc= q;
    }
}
void DFS(AdjGraph* G, int v)
{
    static int n = 0;
    ArcNode* p;
    visited[v] = 1;
    if (!n) 
    {
        cout << v;
        n++;
    }
    else
    {
        cout << " " << v;
        n++;
    }
    p = G->adjlist[v].firstarc;
    while (p != NULL)
    {
        if (visited[p->adjvex] == 0)
            DFS(G, p->adjvex);
        p = p->nextarc;
    }
    
}
void BFS(AdjGraph* G, int v)
{
    int w, i;ArcNode* p;
    queue<int>q;
    cout << v;
    visited[v] = 1;
    q.push(v);
    while (!q.empty())
    {
        w = q.front();
        q.pop();
        p = G->adjlist[w].firstarc;
        while (p != NULL)
        {
            if (visited[p->adjvex] == 0)
            {
                cout << " " << p->adjvex;
                visited[p->adjvex] = 1;
                q.push(p->adjvex);
            }
            p = p->nextarc;
        }
    }
    
}

　　  2.运行截图