C++图的邻接矩阵模板类

• 简单实现图的邻接矩阵,头文件如下

#pragma once
#include <iostream>

using namespace std;

template<class T>
class MatriGraphx
{
public:
	MatriGraphx(size_t capacity = 20);
	~MatriGraphx();

	class Vertex//顶点
	{
	public:
		Vertex(T v) { val = v; }
		friend class MatriGraphx<T>;
	private:
		T val;
	};
public:
	void addVertex(T);//增加顶点
	void addEdge(int start, int end);//增加连线，增加边
	void printMatrix();//打印邻接矩阵

private:
	size_t m_size;  //顶点个数
	size_t m_capacity;   //最多可容纳顶点数

	Vertex** m_vArray; //顶点列表
	int** m_pMatrix; //邻接矩阵
};

template<class T>
inline MatriGraphx<T>::MatriGraphx(size_t c)
	:m_size(0),m_capacity(c)
{
	m_vArray = new Vertex* [c];
	m_pMatrix = new int* [c];

	for (size_t i = 0; i < c; i++)
	{
		m_pMatrix[i] = new int[c];
		memset(m_pMatrix[i], 0, c * sizeof(int)); //初始化为0
	}

}

template<class T>
inline MatriGraphx<T>::~MatriGraphx()
{
	delete[] m_vArray;
	delete[] m_pMatrix;
}

template<class T>
inline void MatriGraphx<T>::addVertex(T item)
{
	if (m_size == m_capacity)
		throw "超出容量";
	m_vArray[m_size++] = new Vertex(item);
}

template<class T>
inline void MatriGraphx<T>::addEdge(int start, int end)
{
	m_pMatrix[start][end] = m_pMatrix[end][start] = 1;
}

template<class T>
inline void MatriGraphx<T>::printMatrix()
{
	std::cout << "顶点个数为 " << m_size << " 个:" << std::endl;
	for (size_t i = 0; i < m_size; i++)
	{
		cout << m_vArray[i]->val << " ";
	}
	cout << endl;

	for (size_t i = 0; i < m_size; i++)
	{
		for (size_t j = 0; j < m_size; j++)
		{
			cout << m_pMatrix[i][j] << " ";
		}
		cout << endl;
	}
}