forked from prateekshyap/DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
GFG_AdjListPrint.cpp
53 lines (46 loc) · 1.38 KB
/
GFG_AdjListPrint.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
52
53
/* https://practice.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1#
* Given the adjacency list of a bidirectional graph. Your task is to copy/clone the adjacency list for each vertex and return a new list.
*/
// { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Function to return the adjacency list for each vertex.
vector<vector<int>> printGraph(int V, vector<int> adj[]) {
vector<vector<int>> node_adj_list(V);
for(int v=0; v<V; v++){
node_adj_list[v].push_back(v);
for(auto w: adj[v])
node_adj_list[v].push_back(w);
}// for v
return node_adj_list;
}
};
// { Driver Code Starts.
int main() {
int tc;
cin >> tc;
while (tc--) {
int V, E;
cin >> V >> E;
vector<int> adj[V];
for (int i = 0; i < E; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
Solution obj;
vector<vector<int>> ans = obj.printGraph(V, adj);
for (int i = 0; i < ans.size(); i++) {
for (int j = 0; j < ans[i].size() - 1; j++) {
cout << ans[i][j] << "-> ";
}
cout << ans[i][ans[i].size() - 1];
cout << endl;
}
}
return 0;
} // } Driver Code Ends