(24480) 알고리즘 수업 - 깊이 우선 탐색 2

https://www.acmicpc.net/problem/24480

단계별로 풀어보기

27단계(그래프와 순회) 2번째

 

 

 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  int n, m, r, x= 1;
  
  cin >> n >> m >> r;
  
  vector adj(n+1, vector<int>());
  vector<int> visited(n+1);
  
  while(m--){
    int u, v;
    
    cin >> 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(), greater<int>());
  
  auto dfs= [&](auto self, int now) -> void {
    visited[now]= x++;
    
    for(int next:adj[now]){
      if(visited[next])  continue;
      
      self(self, next);
    }
  };
  
  dfs(dfs, r);
  
  for(int i=1;i<=n;i++)  cout << visited[i] << "\n";
  
  return 0;
}