邻接矩阵存储带权值的无向图

vertex.h

#pragma once

class vertex
{
   
public:
    char data;//节点用字符表示
    vertex(char c=' ');
    bool isVisited;//是否被访问过
    void visited();
};

vertex.cpp

#include"vertex.h"
# include<iostream>
using namespace std;
//构造函数，初始时未被访问，所以为false
vertex::vertex(char c) :data(c), isVisited(false)
{
}

void vertex::visited()
{
    cout << data << " ";
}

undiGraph(adjacent marix).h

#pragma once
# include"vertex.h"
//undigraph:无向图
//matrix: 矩阵
//adjacency: 邻接
# define MAX 65535

//带权无向图的邻接矩阵方式存储
class myUndiGraph
{
public:
    myUndiGraph(int vertex,int edge);//i：顶点个数,j:边数
    ~myUndiGraph();
    void create();