bfs1 [HACKERRANK] - BFS: Shortest Reach in a Graph www.hackerrank.com/challenges/ctci-bfs-shortest-reach/problem BFS: Shortest Reach in a Graph | HackerRank Implement a Breadth First Search (BFS). www.hackerrank.com BFS 문제. from collections import deque class Graph: def __init__(self,n): self.n = n self.nodes = {i:[] for i in range(n)} def connect(self,a,b): self.nodes[a].append(b) self.nodes[b].append(a) def find_all_distances(self,s): depths =.. 2021. 2. 7. 이전 1 다음