BFS(Breadth First Search)

== BFS(Breadth First Search) == 

vertexList = ['0', '1', '2', '3', '4', '5', '6'] edgeList = [(0,1), (0,2), (1,0), (1,3), (2,0), (2,4), (2,5), (3,1), (4,2), (4,6), (5,2), (6,4)] adjacencyList = [[] for vertex in vertexList] for edge in edgeList: adjacencyList[edge[0]].append(edge[1]) adjacencyList = [[1,2], # vertex 0 [0,3], # vertex 1 [0,4,5], # vertex 2 [1], # vertex 3 [2,6], # vertex 4 [2], # vertex 5 [4]] # vertex 6

          

while queue: current = queue.pop() for neighbor in adjacencyList[current]: if not neighbor in visitedList: queue.insert(0, neighbor) visitedList.append(current) return visitedList

- BFS 알고리즘은 어디에 쓰나?

  - 최근접 경로를 구할 때 dijkstra 알고리즘을 쓰는데, 이것이 바로 BFS 알고리즘을 사용한다. 

  - 페이스북에서 알수도 있는 친구 등..

source-code : The-G

---

reference : 상상개발자