Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main ()
- {
- int total_node, total_edge;
- cin>>total_node>>total_edge;
- vector<int> edges[total_node];
- int a,b;
- for(int i=0; i<total_edge; i++)
- {
- cin>>a>>b;
- edges[a].push_back(b);
- edges[b].push_back(a);
- }
- for(int i=0;i<total_node;i++) {
- cout<< "adjacency list for "<<i<<endl;
- for(int j=0; j<edges[i].size(); j++) {
- cout<<edges[i][j]<< " ";
- }
- cout<<endl;
- }
- for(int i=0;i<total_node;i++) {
- cout << "Degree of "<<i<<endl;
- cout <<edges[i].size() << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement