Python Breadth-First-Search

bfs.py

class Node:
    visited = None
    data = None
    adjacent = None

    def __init__(self, value):
        self.data = value
        self.adjacent = []
        self.visited = False

def bfs(node, data):
    queue = [node]

    while len(queue) > 0:
        adjacent_node = queue.pop(0)

        if adjacent_node.visited:
            continue

        if adjacent_node.data == data:
            return adjacent_node

        adjacent_node.visited = True

        queue += adjacent_node.adjacent

    return False