Advertisement
Guest User

Untitled

a guest
Nov 20th, 2017
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3. struct NOD{
  4. int info;
  5. NOD* adr_urm;
  6. };
  7. NOD *L[101],*c;
  8. int i,j,m,n,a,A[101];
  9. int main()
  10. {
  11. cout<<"n= ";cin>>n;
  12. cout<<"m= ";cin>>m;
  13. for(a=1;a<=m;a++)
  14. {
  15. cin>>i;
  16. cin>>j;
  17. //adaugam j la lista de adiacenta a lui i
  18. c=new(NOD);
  19. c->info=j;
  20. c->adr_urm=0;
  21. if(L[i]==0)
  22. {
  23. L[i]=c;
  24. }
  25. else
  26. {
  27. c->adr_urm=L[i];
  28. L[i]=c;
  29. }
  30. //adaugam i la lista de adiacenta a lui j
  31. c=new(NOD);
  32. c->info=i;
  33. c->adr_urm=0;
  34. if(L[j]==0)
  35. {
  36. L[j]=c;
  37. }
  38. else
  39. {
  40. c->adr_urm=L[j];
  41. L[j]=c;
  42. }
  43. }
  44. //afisam listele de adiacenta alocate dinamic
  45. for(i=1;i<=n;i++)
  46. {
  47. cout<<"L["<<i<<"] = ";
  48. c=L[i];
  49. while(c!=0)
  50. {
  51. cout<<c->info<<" ";
  52. c=c->adr_urm;
  53. }
  54. cout<<"\n";
  55. }
  56.  
  57.  
  58. return 0;
  59. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement