算法与数据结构基础9 C++实现有向图——邻接矩阵存储

               

邻接矩阵的存储比邻接表实现起来更加方便，也更加容易理解。

邻接矩阵就是用一个二维数组matrix来存储每两个点的关系。如果两个点m，n之间有边，将数组matrix[]m[m]设为1，否则设为0。

如果有权，则将matrix[m]n[]设为权值，定义一个很大或者很小的数(只要不跟权值冲突即可)，表示不相连。

空间复杂度为O(V^2)，适合比较稠密的图。

邻接表O(V+E)，适合比较稀疏的图。

//GraphMatrix.h

#include <iostream>#include <cstdio>#include <iomanip>      // std::setw#define  NO_EDGE (-1)using namespace std;// 有向图class GraphMatrix{public: ~GraphMatrix(); void createGraph(); void printGraph();private: // 1. 输入定点数 void inputVertexCount(); // 2. 生成定点数组 void makeVertexArray(); // 3. 输入边数 void inputEdgeCount(); // 4. 输入边的起始点 void inputEdgeInfo(); // 5. 添加边节点至对应的链表中 void addEdgeToList(int vFrom, int weight, int vTo);private: int m_vCount; int m_eCount; int** m_vVertex;};GraphMatrix::~GraphMatrix(){ for (int i = 0; i < m_vCount; ++i){  delete m_vVertex[i]; } delete[] m_vVertex;}void GraphMatrix::inputVertexCount(){ cout << "please input count of vertex:"; cin >> m_vCount;}void GraphMatrix::makeVertexArray(){ m_vVertex = new int*[m_vCount]; for (int i = 0; i < m_vCount; ++i){  m_vVertex[i] = new int[m_vCount]; } for (int i = 0; i < m_vCount; ++i){  for (int j = 0; j < m_vCount; ++j){   m_vVertex[i][j] = NO_EDGE;  } }}void GraphMatrix::inputEdgeCount(){ cout << "please input count of edge:"; cin >> m_eCount;}void GraphMatrix::inputEdgeInfo(){ cout << "please input edge information:" << endl; for (int i = 0; i < m_eCount; ++i){  cout << "the edge " << i << ":" << endl;  // 起点  int from = 0;  cout << "From: ";  cin >> from;  // 权值  int weight = 0;  cout << "Weight:";  cin >> weight;  // 终点  int to = 0;  cout << "To: ";  cin >> to;  cout << endl;  addEdgeToList(from, weight, to); }}void GraphMatrix::addEdgeToList(int vFrom, int weight, int vTo){ m_vVertex[vFrom][vTo] = weight;}void GraphMatrix::printGraph(){ for (int i = 0; i < m_vCount; ++i){  for (int j = 0; j < m_vCount; ++j){   cout << setw(3) << m_vVertex[i][j] << " ";  }  cout << endl; }}// **************************************************************************// 流程控制// **************************************************************************void GraphMatrix::createGraph(){ inputVertexCount(); makeVertexArray(); inputEdgeCount(); inputEdgeInfo();}

// main.cpp

// test for GraphMartrix#include "GraphMatrix.h"#include <cstdlib> int main(){ GraphMatrix graph; graph.createGraph(); graph.printGraph(); system("pause"); return 0;}

假如有图如下

运行结果截图：