Name: Prince Panjiyar

LAB 9: Graph Representation

Registration number: 20BCE2775
Date: 2021/10/06

Undirected Graph:

The code to show adjacency list and adjacency matrix for this graph
representation is given below:
1. Graph representation using adjacency list:
Source code:
#include<bits/stdc++.h>
using namespace std;

void addEdge(vector<int> adjacent[], int x, int y)

{
adjacent[x].push_back(y);
adjacent[y].push_back(x);
}

void displayGraph(vector<int> adjacent[], int V)

{
for (int y = 5; y < V; ++y)
{
cout << "\n Adjacency list of vertex " <<
y << "\n head ";
for (auto s : adjacent[y])
cout << "-> " << s;
printf("\n");
}
}

int main()
{
int V = 10;
vector<int> adjacent[V];
addEdge(adjacent, 5, 6);
addEdge(adjacent, 5, 9);
addEdge(adjacent, 6, 7);
addEdge(adjacent, 6, 8);
addEdge(adjacent, 6, 9);
addEdge(adjacent, 7, 8);
addEdge(adjacent, 8, 9);
displayGraph(adjacent, V);
return 0;
}

Output:
2. Graph representation using adjacency matrix:
Source code:
#include<iostream>
using namespace std;
int matrixArr[20][20];
int count = 0;
void displayMatrix(int v) {
int i, j;
cout<<"The adjacency matrix for the graph is: \n";
for(i = 5; i < v; i++) {
for(j = 5; j < v; j++) {
cout << matrixArr[i][j] << " ";
}
cout << endl;
}
}
void addEdge(int u, int v) {
matrixArr[u][v] = 1;
matrixArr[v][u] = 1;
}
main(int argc, char* argv[]) {
int v = 10;
addEdge( 5, 6);
addEdge( 5, 9);
addEdge( 6, 7);
addEdge( 6, 8);
addEdge( 6, 9);
addEdge( 7, 8);
addEdge( 8, 9);
displayMatrix(v);
}

Output: