-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadj_list.cpp
More file actions
88 lines (74 loc) · 1.8 KB
/
adj_list.cpp
File metadata and controls
88 lines (74 loc) · 1.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
vector<vector<int>> adjlist_matrix(vector<int> adj[],int V){
vector<vector<int>> matrix(V,vector<int>(V,0));
for(int i=0 ;i<V;i++){
for(auto j:adj[i]){
matrix[i][j]=1;
}
}
return matrix;
}
void printMatrix(vector<vector<int>> adjmatrix,int V){
for(int i=0 ;i<V;i++){
for(int j=0;j<V;j++){
cout<< adjmatrix[i][j]<< " ";
}
cout << endl;
}
cout << endl;
}
void addEdge(vector<int> adj[], int u, int v ){
adj[u].push_back(v);
adj[v].push_back(u); // for directed remove this
}
void printGraph(vector<int> adj[], int N){
for (int i = 0; i < N; i++){
cout << i << " ——> "; // print the current vertex number
for (auto v: adj[i])
cout << v << " "; // print all neighboring vertices of a vertex `i`
cout << endl;
}
}
int main(){
int V=5;
vector<int> adj[V];
// Graph g = new Graph(adj,0,4);
// addEdge(adj,0,1);
// addEdge(adj,1,2);
// addEdge(adj,2,3);
// addEdge(adj,2,4);
addEdge(adj, 0, 1);
addEdge(adj, 0, 4);
addEdge(adj, 1, 2);
addEdge(adj, 1, 3);
addEdge(adj, 1, 4);
addEdge(adj, 2, 3);
addEdge(adj, 3, 4);
printGraph(adj,V);
// ADj matrix obtained from adj list
vector<vector<int>> adjmatrix = adjlist_matrix(adj,V);
printMatrix(adjmatrix,V);
return 0;
}
// g++ adj_undirected.cpp -o adj_undirected.out
// ./adj_undirected.out
// output Un-directed
// 0 ——> 1 4
// 1 ——> 0 2 3 4
// 2 ——> 1 3
// 3 ——> 1 2 4
// 4 ——> 0 1 3
// ADJ matrix
// 0 1 0 0 1
// 1 0 1 1 1
// 0 1 0 1 0
// 0 1 1 0 1
// 1 1 0 1 0
// output directed
// 0 ——> 1 4
// 1 ——> 2 3 4
// 2 ——> 3
// 3 ——> 4
// 4 ——>