-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph.cpp
More file actions
55 lines (48 loc) · 890 Bytes
/
graph.cpp
File metadata and controls
55 lines (48 loc) · 890 Bytes
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
#include <iostream>
#include <vector>
using namespace std;
void addEdge(vector<int> adj[], int u, int v)
{
adj[u].push_back(v);
adj[v].push_back(u);
}
void printAdjList(vector<int> adj[], int vertex)
{
for(int i=0; i<vertex; i++)
{
for(int x=0; x<adj[i].size(); x++)
{
cout << adj[i][x] << " ";
}
cout << endl;
}
}
/*
int main()
{
int v = 4;
vector<int> adj[v];
addEdge(adj, 0, 1);
addEdge(adj, 0, 2);
addEdge(adj, 1, 2);
addEdge(adj, 1, 3);
printAdjList(adj);
return 0;
}
*/
int main()
{
int vertex, edges;
cin >> vertex >> edges;
vector<int> adj[vertex];
// input the links for the graph
for(int i=0; i<edges; i++)
{
int x, y;
cin >> x >> y;
addEdge(adj, x, y);
}
cout << endl;
printAdjList(adj, vertex);
return 0;
}