Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- int a[10][10],i,j,n,x;
- ifstream f("graf.in");
- ofstream g("graf.out");
- void citire_graf()
- {
- f>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- f>>a[i][j];
- }
- void afisare()
- {
- for(i=1;i<=n;i++)
- {
- for(j=1;j<=n;j++)
- g<<a[i][j]<<" ";
- g<<endl;
- }
- }
- int grd (int x)
- {
- int s=0;
- for(j=1;j<=n;j++)
- if(a[x][j]==1)
- s=s+a[x][j];
- return s;
- }
- void lista_adiac(int x)
- {
- g<<"Lista de adiacenta a nodului este:";
- for(j=1;j<=n;j++)
- if(a[x][j]==1)
- g<<j<<" ";
- }
- int main()
- {
- citire_graf();
- afisare();
- for(i=1;i<=n;i++)
- {
- g<<"Gradul nodului "<<i<<" este:"<<grd(i)<<endl;
- }
- for(i=1;i<=n;i++)
- {
- g<<"nodul"<<i<<":";
- lista_adiac(i); g<<endl;
- }
- g<<"noduri izolate:";
- for(i=1;i<=n;i++)
- if(grd(i)==0)
- g<<i<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement