/
Graphs.cpp
51 lines (41 loc) · 996 Bytes
/
Graphs.cpp
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
#include<iostream>
#include<unordered_map>
#include<list>
using namespace std;
class graph{
public:
unordered_map<int,list<int>> adj;
void addEdge(int u, int v,bool direction){
//direction 0 ->undirected graph
//direction 1 ->directed graph
adj[u].push_back(v);
if(direction == 0){
adj[v].push_back(u);
}
}
void printAdjList(){
for(auto i:adj){
cout<< i.first <<"->";
for(auto j: i.second){
cout<<j<<",";
}
cout<<endl;
}
}
};
int main(){
int n;
cout<<"Enter the no of nodes to be created :"<<endl;
cin>>n;
int m;
cout<<"Enter the no of edges to be created :"<<endl;
cin>>m;
graph g;
for(int i=0;i<m;i++){
int u,v;
cin >> u >> v;
g.addEdge(u,v,0);
}
g.printAdjList();
return 0;
}