复习深搜广搜

熟练一遍

/*2018.7.10*/
/*练习DFS和BFS，无STL，加油！*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXSIZE 100

int n,e;
int v[MAXSIZE];
int m[MAXSIZE][MAXSIZE];

void DFS(int k)
{
    v[k]=1;
    cout<<k<<" ";
    for(int i=1;i<=n;i++)
        if(!v[i]&&m[k][i])
            DFS(i);
}

void BFS()
{
    int q[MAXSIZE];
    int f,r;
    int i,j;
    f=r=0;
    for(i=1;i<=n;i++)
    {
        if(!v[i])
        {
            v[i]=1;
            r++;
            q[r]=i;
            cout<<i<<" ";
            while(f!=r)
            {
                f++;
                int t=q[f];
                for(j=1;j<=n;j++)
                    if(!v[j]&&m[t][j])
                    {
                        cout<<j<<" ";
                        v[j]=1;
                        r++;
                        q[r]=j;
                    }
            }
        }
    }
}

int main()
{
    int i,j;
    while(cin>>n>>e)
    {
        memset(v,0,sizeof(v));
        memset(m,0,sizeof(m));
        for(i=1;i<=e;i++)
        {
            int a,b;
            cin>>a>>b;
            m[a][b]=m[b][a]=1;
        }
        for(i=1;i<=n;i++)
            if(!v[i])
                DFS(i);
        memset(v,0,sizeof(v));
        cout<<endl;
        BFS();
    }
}