[BOJ] 11403 경로 찾기

문제 : https://www.acmicpc.net/problem/11403 

11403번: 경로 찾기

 

솔루션 : 

단순 BFS진행

 

 

소스코드 : 

N = int(input())

#데이터 입력받기
temp =[]
for i in range(N) :
    temp.append( list(map(int,input().split()) ))

visited = [[ False for i in range(N)]  for j in range(N) ]  
graph =  [ [] for w in range(N)]

#단방향 그래프 형태로 표현하기
for i in range(N) :
    for j in range(N) :
        if temp[i][j] == 1 :
            graph[i].append(j)



#큐 구현하기
from collections import deque

def bfs(started, graph) :
    Q = deque()
    Q.append(graph[started ])
    
    while Q :
        next_node  = Q.popleft()
        # print(f'next node is {next_node}')

        for i in next_node :
            # print(started, i )
            if visited[started][i] == False :
                visited[started][i] = True 
                Q.append(graph[i])
        # print(Q)
        # print(visited)
        # print("\n", end='')


#처리과정
for i in range(N) :
    bfs(i,graph)


#출력처리
for i in visited:
    for j in i :
        if j == True :
            print("1", end=' ')
        else :
            print("0", end=' ')
    print("\n", end='')