Get all adjacent vertices of the dequeued vertex s . If a adjacent has not been visited ( level [ i ] < '0' ) , then update level [ i ] = = parent_level [ s ] + 1 and enqueue it
i = 0 NEW_LINE while i < len ( self . adj [ s ] ) : NEW_LINE