#include<bits/stdc++.h>
using namespace std;
void add_edge(vector<int> adj[],int u,int v)
{
adj[u].push_back(v);
adj[v].push_back(u);
}
void print_graph(vector<int>adj[],int V)
{
for(int i=0;i<V;i++)
{
for(auto x:adj[i])
cout<<x<<"->";
cout<<endl;
}
}
int main()
{
int V;
cout<<"Enter the number of vertices"<<endl;
cin>>V;
vector<int> adj[V];
while(1)
{
int x,y;
cout<<"Enter the nodes"<<endl;
cin>>x>>y;
add_edge(adj,x,y);
cout<<"Enter -1 to exit"<<endl;
int t;
cin>>t;
if(t==-1)
break;
}
print_graph(adj,V);
return 0;
}
using namespace std;
void add_edge(vector<int> adj[],int u,int v)
{
adj[u].push_back(v);
adj[v].push_back(u);
}
void print_graph(vector<int>adj[],int V)
{
for(int i=0;i<V;i++)
{
for(auto x:adj[i])
cout<<x<<"->";
cout<<endl;
}
}
int main()
{
int V;
cout<<"Enter the number of vertices"<<endl;
cin>>V;
vector<int> adj[V];
while(1)
{
int x,y;
cout<<"Enter the nodes"<<endl;
cin>>x>>y;
add_edge(adj,x,y);
cout<<"Enter -1 to exit"<<endl;
int t;
cin>>t;
if(t==-1)
break;
}
print_graph(adj,V);
return 0;
}
Comments
Post a Comment