深度优先搜索树与广度优先搜索树

DFS使用c++中的stack，BFS使用c++中的queue

#include <iostream>
#define MAX_VERTS 20
#include <stack>
#include <queue>

using namespace std;

class Vertex
{
public:
    Vertex(char lab)
    {
        Label = lab;
        wasVisited = false;
    }

public:
    bool wasVisited;
    char Label;
};

class Graph
{
public:
    Graph();
    ~Graph();
    void addVertex(char lab);
    void addEdge(int start, int End);
    void printMatrix();
    void showVertex(int v);
    void DFS();
    void BFS();
private:
    Vertex *vertexList[MAX_VERTS];
    int nVerts;
    int adjMat[MAX_VERTS][MAX_VERTS];
    int getAdjUnivisitedVertex(int v);
};

void Graph::BFS()
{
    queue<int> gQueue;
    vertexList[0]->wasVisited = true;
    showVertex(0);
    gQueue.push(0);
    int vert1, vert2;
    while(gQueue.size()>0)
    {
        vert1 = gQueue.front();
        gQueue.pop();
        vert2 = getAdjUnivisitedVertex(vert1);
        while(vert2 != -1)
        {
            vertexList[vert2]->wasVisited = true;
            showVertex(vert2);
            gQueue.push(vert2);
            vert2 = getAdjUnivisitedVertex(vert1);
        }
    }
    cout << endl;
    for(int j=0; j<nVerts; j++)
        vertexList[j]->wasVisited = false;
}

void Graph::DFS()
{
    stack<int> gStack;
    vertexList[0]->wasVisited = true;
    showVertex(0);
    gStack.push(0);
    int v;
    while(gStack.size()>0)
    {
        v = getAdjUnivisitedVertex(gStack.top());
        if(v == -1)
            gStack.pop();
        else
        {
            vertexList[v]->wasVisited = true;
            showVertex(v);
            gStack.push(v);
        }
    }
    cout << endl;
    for(int j=0; j<nVerts; j++)
        vertexList[j]->wasVisited = false;
}

int Graph::getAdjUnivisitedVertex(int v)
{
    for(int j=0; j<nVerts; j++)
        if((adjMat[v][j]==1) && (vertexList[j]->wasVisited==false))
            return j;
    return -1;
}

void Graph::showVertex(int v)
{
    cout << vertexList[v]->Label << " ";
}

Graph::Graph()
{
    nVerts = 0;
    for(int i=0; i<MAX_VERTS; i++)
        for(int j=0; j<MAX_VERTS; j++)
            adjMat[i][j] = 0;
}

void Graph::addVertex(char lab)
{
    vertexList[nVerts++] = new Vertex(lab);
}

void Graph::addEdge(int start, int End)
{
    adjMat[start][End] = 1;
    adjMat[End][start] = 1;
}

void Graph::printMatrix()
{
    for(int i=0; i<nVerts; i++)
    {
        for(int j=0; j<nVerts; j++)
            cout << adjMat[i][j] << " ";
        cout << endl;
    }
}

Graph::~Graph()
{
    for(int i=0; i<nVerts; i++)
        delete vertexList[i];
}

int main()
{

    Graph g;
    g.addVertex('A');
    g.addVertex('B');
    g.addVertex('C');
    g.addVertex('D');
    g.addVertex('E');

    g.addEdge(0,1); // A-B
    g.addEdge(0,3); // A-D
    g.addEdge(1,0); // B-A
    g.addEdge(1,4); // B-E
    g.addEdge(2,4); // C-E
    g.addEdge(3,0); // D-A
    g.addEdge(3,4); // D-E
    g.addEdge(4,1);
    g.addEdge(4,2);
    g.addEdge(4,3);
    g.printMatrix();
    cout << endl;

    cout << "深度优先搜索：" ;
    g.DFS();
    cout << endl;
    cout << "广度优先搜索：" ;
    g.BFS();
    return 0;
}