Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #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);
- }
- void printGraph(vector<int> adj[], int V)
- {
- for (int v = 0; v < V; ++v)
- {
- cout << "Adjacency list of vertex "
- << v << "\n";
- for (auto x : adj[v])
- cout << x <<" ";
- cout<<"\n";
- }
- }
- int main()
- {
- int V = 5;
- vector<int> adj[V];
- 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);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement