Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void be(int &n, int el[51][3], int &m)
- {
- cin>>n;
- int x=1, i=1;
- while(x!=0)
- {
- cin>>x;
- if(x!=0)
- {
- el[i][1]=x;
- cin>>el[i][2];
- m++;
- i++;
- }
- }
- }
- void tolt(int n, int el[51][3], int szl[51][51], int m)
- {
- for(int i = 1; i <=m ; i++)
- {
- //elso
- szl [el[i][1]] [0] ++; //ez lesz a j
- szl [el[i][1]] [szl[el[i][1]][0]] = el[i][2];
- //masodik
- szl[el[i][2]][0]++;
- szl[el[i][2]][szl[el[i][2]][0]] = el[i][1];
- }
- }
- void bblsort(int t[][51], int i)
- {
- int ok=0, s;
- while (ok == 0)
- {
- ok=1;
- for (int j=1; j<t[i][0]; j++)
- {
- if (t[i][j] > t[i][j+1])
- {
- s = t[i][j];
- t[i][j] = t[i][j+1];
- t[i][j+1] = s;
- ok = 0;
- }
- }
- }
- }
- void rendezes(int szl[51][51], int n)
- {
- for(int i = 1; i <= n; i++)
- {
- bblsort(szl, i);
- }
- }
- void A(int n, int szl[51][51])
- {
- for(int i=1; i<=n; i++)
- for(int j=1; j<=szl[i][0]; j++)
- if(szl[i][j]==0) cout<<i;
- }
- /*void B(int n, int szl[51][51])
- {
- int s=0;
- for(int i=1; i<=n; i++)
- for(int j=1; j<=szl[i][0]; j++)
- }*/
- void ki(int szl[51][51], int n)
- {
- cout<<"Szomszedsagi lista: "<<endl;
- for(int i=1; i<=n; i++)
- {
- for(int j=0; j<=szl[i][0]; j++)
- cout<<szl[i][j]<<' ';
- cout<<endl;
- }
- }
- int main()
- {
- int n, el[51][3],szl[51][51],m;
- be(n,el,m);
- tolt(n,el,szl,m);
- rendezes(szl,n);
- ki(szl,n);
- //cout<<endl<<endl;
- //A(n,szl);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement