graph using djacency matrix c 2b 2b

1// Adjacency Matrix representation in C++
2
3#include <iostream>
4using namespace std;
5
6class Graph {
7   private:
8  bool** adjMatrix;
9  int numVertices;
10
11   public:
12  // Initialize the matrix to zero
13  Graph(int numVertices) {
14    this->numVertices = numVertices;
15    adjMatrix = new bool*[numVertices];
16    for (int i = 0; i < numVertices; i++) {
17      adjMatrix[i] = new bool[numVertices];
18      for (int j = 0; j < numVertices; j++)
19        adjMatrix[i][j] = false;
20    }
21  }
22
23  // Add edges
24  void addEdge(int i, int j) {
25    adjMatrix[i][j] = true;
26    adjMatrix[j][i] = true;
27  }
28
29  // Remove edges
30  void removeEdge(int i, int j) {
31    adjMatrix[i][j] = false;
32    adjMatrix[j][i] = false;
33  }
34
35  // Print the martix
36  void toString() {
37    for (int i = 0; i < numVertices; i++) {
38      cout << i << " : ";
39      for (int j = 0; j < numVertices; j++)
40        cout << adjMatrix[i][j] << " ";
41      cout << "\n";
42    }
43  }
44
45  ~Graph() {
46    for (int i = 0; i < numVertices; i++)
47      delete[] adjMatrix[i];
48    delete[] adjMatrix;
49  }
50};
51
52int main() {
53  Graph g(4);
54
55  g.addEdge(0, 1);
56  g.addEdge(0, 2);
57  g.addEdge(1, 2);
58  g.addEdge(2, 0);
59  g.addEdge(2, 3);
60
61  g.toString();
62}