Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- struct NOD{
- int info;
- NOD* adr_urm;
- };
- NOD *L[101],*c;
- int i,j,m,n,a,A[101];
- int main()
- {
- cout<<"n= ";cin>>n;
- cout<<"m= ";cin>>m;
- for(a=1;a<=m;a++)
- {
- cin>>i;
- cin>>j;
- //adaugam j la lista de adiacenta a lui i
- c=new(NOD);
- c->info=j;
- c->adr_urm=0;
- if(L[i]==0)
- {
- L[i]=c;
- }
- else
- {
- c->adr_urm=L[i];
- L[i]=c;
- }
- //adaugam i la lista de adiacenta a lui j
- c=new(NOD);
- c->info=i;
- c->adr_urm=0;
- if(L[j]==0)
- {
- L[j]=c;
- }
- else
- {
- c->adr_urm=L[j];
- L[j]=c;
- }
- }
- //afisam listele de adiacenta alocate dinamic
- for(i=1;i<=n;i++)
- {
- cout<<"L["<<i<<"] = ";
- c=L[i];
- while(c!=0)
- {
- cout<<c->info<<" ";
- c=c->adr_urm;
- }
- cout<<"\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement