This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | 🌞 Morning 144 commits ███▏░░░░░░░░░░░░░░░░░ 15.2% | |
| 🌆 Daytime 143 commits ███▏░░░░░░░░░░░░░░░░░ 15.1% | |
| 🌃 Evening 335 commits ███████▍░░░░░░░░░░░░░ 35.3% | |
| 🌙 Night 326 commits ███████▏░░░░░░░░░░░░░ 34.4% | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | import sys | |
| input = sys.stdin.readline | |
| INF = int(1e9) # 무한을 의미하는 값으로 10억을 설정 | |
| def bf(start): | |
| # 시작 노드에 대해서 초기화 | |
| dist[start] = 0 | |
| # 전체 n번의 라운드(round)를 반복 | |
| for i in range(n): | 
  
    
      This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
      Learn more about bidirectional Unicode characters
    
  
  
    
  | from collections import deque | |
| def bfs(graph, start, visited): | |
| queue = deque([start]) | |
| visited[start] = True | |
| while queue: | |
| v = queue.popleft() | |
| print(v, end='') |