有向图和无向图的数组C++实现

#pragma once
#ifndef NODE_H
#define NODE_H
#include<iostream>
using namespace std;

class Node
{
public:
    Node(char data = 0);
    char m_cData;
    bool m_IsVisited;
};

#endif // !NODE_H

#include"Node.h"

Node::Node(char data)
{
    m_cData = data;
    m_IsVisited = false;
}

#pragma once
#ifndef CMAP_H
#define CMAP_H
#include"Node.h"
#include<vector>
class cMap
{
public:
    cMap(int capacity);
    ~cMap();
    bool addNode(Node *pNode);//向图中加入顶点（结点）
    void resetNode();//重置顶点
    bool setValueToMatrixForDirectedGraph(int row, int col, int val = 1);//为有向图设置邻接矩阵
    bool setValueToMatrixForUndirectedGraph(int row, int col, int val = 1);//为无向图设置邻接矩阵

    void printMatrix();//打印邻接矩阵

    void depthFirstTraverse(int nodeIndex);//深度优先遍历
    void breadthFirstTraverse(int nodeIndex);//广度优先遍历
    void breathFirstTraverseImpl(vector<int> preVec);

private:
    bool getValueFromMatrix(int row,int col,int &val);//从矩阵中获取权值
    void breathFirstTraverse(int nodeIndex);//广度优先遍历实现函数

private:
    int m_iCapacity;//图中最多可以容纳的顶点数
    int m_iNodeCount;//已经添加的结点（顶点）个数
    Node *m_pNodeArray;//用来存放顶点数组
    int *m_pMatrix;//用来存放邻接矩阵
};

#endif // !CMAP_H

cMap::cMap(int capacity)
{
    m_iCapacity = capacity;
    m_iNodeCount = 0;
    m_pNodeArray = new Node[m_iCapacity];
    m_pMatrix = new int[m_iCapacity*m_iCapacity];
    for (int i = 0; i < m_iCapacity*m_iCapacity; i++)
    {
        m_pMatrix[i] = 0;
    }
}

cMap::~cMap()
{
    delete []m_pNodeArray;
    delete []m_pMatrix;
}

bool cMap::addNode(Node *pNode)
{
    if (pNode == NULL) 
    {
        return false;
    }
    m_pNodeArray[m_iNodeCount].m_cData = pNode->m_cData;
    m_iNodeCount++;
    return true;
}

void cMap::resetNode()
{
    for (int i = 0; i < m_iNodeCount; i++)
    {
        m_pNodeArray[i].m_IsVisited = false;
    }
}

bool cMap::setValueToMatrixForDirectedGraph(int row, int col, int val)
{
    if(row<0 || row>=m_iCapacity)
    {
        return false;
    }
    if (col < 0 || col >= m_iCapacity)
    {
        return false;
    }
    m_pMatrix[row*m_iCapacity + col] = val;
    return true;
}

bool cMap::setValueToMatrixForUndirectedGraph(int row, int col, int val)
{
    if (row<0 || row >= m_iCapacity)
    {
        return false;
    }
    if (col < 0 || col >= m_iCapacity)
    {
        return false;
    }
    m_pMatrix[row*m_iCapacity + col] = val;
    m_pMatrix[col*m_iCapacity + row] = val;
}