图（二叉树）邻接矩阵（数组描述）

//结点类
//.h
#ifndef NODE
#define NODE

class node
{
   
public:
    node(char data=0);
    char m_cData; //顶点数据
    bool m_bIsVisited; //顶点是否被访问
};

#endif
//.cpp
#include"node.h"

node::node(char data)
{
    m_cData = data;
    m_bIsVisited = false;
}

//图类
//.h
#include<vector>
#include"node.h"
using namespace std; 



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 deepthFirstTraverse(