2.22 邻接矩阵

2️⃣2️⃣ 邻接矩阵

#include <iostream>
using namespace std;
#define MAX_VERTS 20

class Vertex //顶点
{
public:
	Vertex(char lab): Label(lab) {}
private:
	char Label;
};

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

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');//0
	g.addVertex('B');//1
	g.addVertex('C');//2
	g.addVertex('D');//3
	g.addVertex('E');//4
	g.addEdge(0,1);
	g.addEdge(0,3);
	g.addEdge(1,4);
	g.addEdge(2,4);
	g.addEdge(3,4);
	g.printMatrix();
	return 0;
}