BFS template

gistfile1.txt

BFS

visited = {}
// initialize
queue = [a]
current_size = 0

offsets = [[0,1],[0,-1],[1,0],[-1,0]]

while(queue is not empty) {
    curren  = queup.tail()
    visited[] = a;
    current_size++;

    for (offset : offsets) {// avoid some edge cases ?
        nei = curren + offset;
        if (inBound(nei) && !visited(nei) && isLand(nei)) {
            queue.push(nei);
        }
    }
}

return current_size;