1260 DFS와 BFS

C번 문제가 BFS문제인데 아직 BFS 코드도 짜보지 않아서,,, 연습 겸 쉬운 bfs 구현문제를 풀어보았다. 

 

 

https://burningjeong.tistory.com/283?category=852372

BFS 너비 우선 탐색

 

https://burningjeong.tistory.com/208

DFS 깊이 우선 탐색

 

둘 다 정리도 했음 ^__^ 

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>
#include <stdio.h>
#include <math.h>
#include <sstream>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using iis = pair<int, string>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

bool visited[10005];
vector <int> adj[10005];

void dfs(int curr)
{
    visited[curr] = true;
    printf("%d ", curr);
    
    for (int next : adj[curr])
    {
        if (!visited[next])
            dfs(next);
    }
}

int main() 
{
    int n, m, v;
    scanf("%d %d %d", &n, &m, &v);
    
    for (int i = 0; i < m; i++)
    {
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    for (int i = 1; i <= n; i++)
        sort(adj[i].begin(), adj[i].end());
    
    
    memset(visited, false, sizeof(visited));
    dfs(v);
    
    memset(visited, false, sizeof(visited));
    queue<int> Q;
    Q.push(v);
    visited[v] = true;
    
    printf("\n");
    while (!Q.empty())
    {
        int curr = Q.front();
        Q.pop();
        printf("%d ", curr);
        for (int next : adj[curr])
        {
            if (!visited[next])
            {
                visited[next] = true;
                Q.push(next);
            }
        }
    }

    
    return 0;
}