NAME : MAHEDI HASSAN

STUDENT ID : 20183290535

SUBJECT : Data Structure

SCHOOL : Information Science and Engineering

MAJOR : Computer Science & Technology

TEACHER : TEACHER YI
Final project : Graph

Theory
A graph is a data structure that consists of the following two components:
1. A finite set of vertices also called as nodes.
2. A finite set of ordered pair of the form (u, v) called as edge. The pair is ordered because (u, v)
is not the same as (v, u) in case of a directed graph(di-graph). The pair of the form (u, v)
indicates that there is an edge from vertex u to vertex v. The edges may contain
weight/value/cost.
Graphs are used to represent many real-life applications: Graphs are used to represent networks.
The networks may include paths in a city or telephone network or circuit network. Graphs are
also used in social networks like LinkedIn, Facebook. For example, in Facebook, each person is
represented with a vertex(or node). Each node is a structure and contains information like person
id, name, gender, and locale. See this for more applications of graph.
Following is an example of an undirected graph with 5 vertices.

The following two are the most commonly used representations of a graph.
1. Adjacency Matrix
2. Adjacency List
There are other representations also like, Incidence Matrix and Incidence List. The choice of
graph representation is situation-specific. It totally depends on the type of operations to be
performed and ease of use.
Adjacency Matrix:
Adjacency Matrix is a 2D array of size V x V where V is the number of vertices in a graph. Let
the 2D array be adj[][], a slot adj[i][j] = 1 indicates that there is an edge from vertex i to vertex j.
Adjacency matrix for undirected graph is always symmetric. Adjacency Matrix is also used to
represent weighted graphs. If adj[i][j] = w, then there is an edge from vertex i to vertex j with
weight w.
The adjacency matrix for the above example graph is:

Pros: Representation is easier to implement and follow. Removing an edge takes O(1) time.
Queries like whether there is an edge from vertex ‘u’ to vertex ‘v’ are efficient and can be done
O(1).
Cons: Consumes more space O(V^2). Even if the graph is sparse(contains less number of edges),
it consumes the same space. Adding a vertex is O(V^2) time.
Please see this for a sample Python implementation of adjacency matrix.

Adjacency List:
An array of lists is used. The size of the array is equal to the number of vertices. Let the array be
an array[]. An entry array[i] represents the list of vertices adjacent to the ith vertex. This
representation can also be used to represent a weighted graph. The weights of edges can be
represented as lists of pairs. Following is the adjacency list representation of the above graph.
Code result
Graph create:

#include<bits/stdc++.h>

using namespace std;

void addEdge(vector<int> adj[], int u, int v)

adj[u].push_back(v);

adj[v].push_back(u);

int main()

int v = 5;

vector<int> adj[v];

addEdge(adj, 0, 1);
 addEdge(adj, 0, 4);

addEdge(adj, 1, 5);

addEdge(adj, 1, 3);

addEdge(adj, 1, 4);

addEdge(adj, 3, 2);

addEdge(adj, 5, 2);

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

cout << "\n Adjacency list of vertex "

<< i << "\n head ";

for (auto x : adj[i])

cout << "-> " << x;

printf("\n");

return 0;

}
Output

Adjacency list of vertex 0

head -> 1-> 4

Adjacency list of vertex 1

head -> 0-> 5-> 3-> 4

Adjacency list of vertex 2

head -> 3-> 5

Adjacency list of vertex 3

head -> 1-> 2

Adjacency list of vertex 4

head -> 0-> 1

#include <bits/stdc++.h>

using namespace std;

vector<int>graph[1000];

int v,e,u,v;

int main()

cin >> v >> e;

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

cin >> u >> v;

graph[u].push_back(v);

graph[v].push_back(u);

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

cout << i << " : ";

for (auto j : graph[i]){

cout << j << " ";

cout << endl;

return 0;

}
Output

23

13

14

24

45

0:

1:34

2:34

3:21

4:125

5:4
BFS:

#include <bits/stdc++.h>

using namespace std;

vector<int>graph[100000];

int dist[100000];

bool vis[100000];

void bfs(int src){

queue<int>Q;

memset(vis,0,sizeof vis);

Q.push(src);

vis[src] = 1;

dist[src] = 0;

while(!Q.empty()){

int u = Q.front();

Q.pop();

for(int i=0;i<graph[u].size();i++){

int v = graph[u][i];

if(vis[v] == 1) continue;

vis[v] = 1;

dist[v] = dist[u] + 1;

Q.push(v);

int main()
{

int V,E;

cin >> V >> E;

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

int a,b;

cin >> a >> b;

graph[a].push_back(b);

graph[b].push_back(a);

bfs(0);

for(int i=0;i<V;i++) cout << i << " : " << dist[i] << endl;

return 0;

}
Output :

43

23

21

02

0:0
1:2

2:1

3:2

MST:

#include <bits/stdc++.h>

using namespace std;

#define infinity 1<<28

#define mx 100000

int parent[mx];

void makeset(int u){

parent[u] = u;

void init_disjoint_set(int numNodes){

for(int i=1;i<=numNodes;i++) {

makeset(i);
 }

int find_representative(int u){

if(parent[u]==u) return u;

return find_representative(parent[u]);

int set_union(int u,int v){

int rep_u = find_representative(u);

int rep_v = find_representative(v);

if (rep_u != rep_v) {

parent[rep_u] = rep_v;

return true;

return false; //u, v are already in same component

struct edge{

int u, v, w;

edge(int _u,int _v, int _w) {

u = _u;

v = _v;

w = _w;

};

bool comp(edge a, edge b){

return a.w < b.w;

}
int main(){

//freopen("in", "r", stdin);

int numNodes, numEdges;

cin>>numNodes>>numEdges;

init_disjoint_set(numNodes);

vector<edge>edges;

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

int u, v, w;

cin>>u>>v>>w;

edges.push_back(edge(u, v,w));

sort(edges.begin(), edges.end(), comp);

int sum = 0;

for(int i=0;i<(int)edges.size();i++){

edge currentEdge = edges[i];

int ret = set_union(currentEdge.u, currentEdge.v);

if(ret == true){

sum = sum + currentEdge.w;

cout<<sum<<endl;

return 0;

}
Output

10

126

131

145

235

253

355

364

347

462

566

15