BFS_template_java

bfs_java

// T 指代任何你希望存储的类型
Queue<T> queue = new LinkedList<>();
Set<T> set = new HashSet<>();

set.add(start);
queue.offer(start);
while (!queue.isEmpty()) {
    T head = queue.poll();
    for (T neighbor : head.neighbors) {
        if (!set.contains(neighbor)) {
            set.add(neighbor);
            queue.offer(neighbor);
        }
    }
}

bfs_level_order_tranverse

// T 指代任何你希望存储的类型
queue = []
set = set()

set.add(start)
queue.append(start)
while len(queue) > 0:
    size = len(queue)
    for x in xrange(size):
        head = queue.pop(0);
        for neighbor in head.neighbors:
            if neighbor not set:
                set.add(neighbor)
                queue.append(neighbor)

bfs_python

// T 指代任何你希望存储的类型
queue = []
set = set()

set.add(start)
queue.append(start)
while len(queue) > 0:
    head = queue.pop(0);
    for neighbor in head.neighbors:
        if neighbor not set:
            set.add(neighbor)
            queue.append(neighbor)
        
    

bfs template