图算法

一、邻接矩阵

#include <iostream>

using namespace std;

#define MAX_VERTS 20

class Vertex
{
public:
	Vertex(int 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 adjMats[MAX_VERTS][MAX_VERTS]; //边矩阵
};

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

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

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

void Graph::addEdge(int start, int end)
{

	adjMats[start][end] = 1;
	adjMats[end][start] = 1;
}

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

int main()
{
	Graph g_;
	g_.addVertex('A');
	g_.addVertex('B');
	g_.addVertex('C');
	g_.addEdge(0,1);
	g_.printMatrix();
	return 0;
}