Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //parcurgere in latime
- #include<fstream>
- using namespace std;
- ifstream f("pl.in");
- ofstream g("pl.out");
- int a[101][101],viz[101],coada[101],n,p;
- void citire()
- {
- int i,j;
- f>>n>>p;
- while(f>>i>>j)
- a[i][j]=a[j][i]=1;
- }
- void parc_latime( int p)
- {
- int i,j,x,y;
- i=j=0;
- coada[i]=p;
- g<<p<<" ";
- viz[p]=1;// marcam cu 1 nodurile vizitate
- while(i<=j)
- {
- x=coada[i];
- for(y=1;y<=n;y++)
- if(a[x][y]&& !viz[y])
- {
- g<<y<<" ";
- viz[y]=1;
- coada[++j]=y;
- }
- i++;
- }
- }
- int main()
- {
- int i;
- citire();
- for(i=1;i<=n;i++)
- viz[i]=0;
- parc_latime(p);
- return 0;
- }
- // parcurgere in adancime
- #include<fstream>
- using namespace std;
- ifstream f("pa.in");
- ofstream g("pa.out");
- int a[101][101],viz[101],n,p;
- void citire()
- {
- int i,j;
- f>>n>>p;
- while(f>>i>>j)
- a[i][j]=a[j][i]=1;
- }
- void parc_adancime( int p)
- {
- int i;
- g<<p<<" ";
- viz[p]=1;// marcam cu 1 nodurile vizitate
- for(i=1;i<=n;i++)
- if(a[p][i]&& !viz[i])
- parc_adancime(i);
- }
- int main()
- {
- int i;
- citire();
- for(i=1;i<=n;i++)
- viz[i]=0;
- parc_adancime(p);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment