DFS和BFS

/*
 *Author: ZhangHaiba
 *Date: 2014-1-10
 *
 *classcical DFS & BFS
 */

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;
const int N = 512;
int mat[N][N];
int vis[N];

void set_mat(int n)
{
    int i, j;
    for (i = 0; i < n; ++i)
        for (j = 0; j < n; ++j)
            cin >> mat[i][j];
}

//for connected graph
void DFS(int n, int i)
{
    vis[i] = 1;
    cout << i << " ";

    for (int j = 0; j < n; ++j)
        if (!vis[j] && mat[i][j] > 0)
            DFS(n, j);
}

queue<int> q;

//for connected graph
void BFS(int n, int i)
{
    vis[i] = 1;
    q.push(i);

    while (!q.empty()) {
        for (int j = 0; j < n; ++j)
            if (!vis[j] && mat[q.front()][j] > 0) {
                vis[j] = 1;
                q.push(j);
            }
        cout << q.front() << " ";
        q.pop();
    }
}

int main()
{
    int n;

    cin >> n;
    set_mat(n);
    memset(vis, 0, sizeof vis);
    BFS(n, 0);
    memset(vis, 0, sizeof vis);
    DFS(n, 0);
    return 0;    
}