Question

Create an unweighted undirected Graph Class using an Adjacency Matrix with the following functions 1. Graph(int numofV) 3. int noOfOutgoingEdges(int vertex); 4. int noOflncomingEdges (int vertex) 5. void print) You may use vectors/2D dynamic arrays to implement the matrix. Bonus (20) 6. void DFS(); Depth First Search Printing of the graph 7. void BFSO: I/ Breadth First Search Printing of the graph

refer to the question using c++. if you could not do the bonus part no problem you don't have too , but if you can so please do it and let me know

Answer 1

CODE

#include <iostream>

#include <cstdlib>

using namespace std;

#define MAX 20

typedef struct edge {

int source;

int destination;

} edge;

/*

* Adjacency Matrix Class

*/

class Graph

{

private:

int n;

int **adj;

bool *visited;

public:

Graph(int n)

{

this->n = n;

visited = new bool [n];

adj = new int* [n];

for (int i = 0; i < n; i++)

{

adj[i] = new int [n];

for(int j = 0; j < n; j++)

{

adj[i][j] = 0;

}

}

}

/*

* Adding Edge to Graph

*/

void addedge(edge e)

{

if( e.source > n || e.destination > n || e.source < 0 || e.destination < 0)

{

cout<<"Invalid edge!\n";

}

else

{

adj[e.source - 1][e.destination - 1] = 1;

}

}

/*

* Print the graph

*/

void display()

{

int i,j;

for(i = 0;i < n;i++)

{

for(j = 0; j < n; j++)

cout<<adj[i][j]<<" ";

cout<<endl;

}

}

int numOfOutgoingEdges(int vertex) {

int count = 0;

for (int i=0; i<n; i++) {

if (adj[vertex][i] != 0) {

count ++;

}

}

return count;

}

int numOfIncomingEdges(int vertex) {

int count = 0;

for (int i=0; i<n; i++) {

if (adj[i][vertex] != 0) {

count ++;

}

}

return count;

}

};

/*

* Main

*/

int main()

{

int nodes, max_edges, origin, destin;

cout<<"Enter number of nodes: ";

cin>>nodes;

Graph graph(nodes);

max_edges = nodes * (nodes - 1);

for (int i = 0; i < max_edges; i++)

{

cout<<"Enter edge (-1 -1 to exit): ";

cin>>origin>>destin;

if((origin == -1) && (destin == -1))

break;

edge e;

e.source = origin;

e.destination = destin;

graph.addedge(e);

}

graph.display();

return 0;

}