Biconnected

time = 0
function isBiconnected(vertex, adj[][], low[], disc[], parent[], visited[], V)
    disc[vertex]=low[vertex]=time+1
    time = time + 1
    visited[vertex]=true
    child = 0
    for i = 0 to V
        if adj[vertex][i] == true
            if visited[i] == false
                child = child + 1
                parent[i] = vertex
                result = isBiconnected(i, adj, low, disc, visited, V, time)
                if result == false
                    return false
                low[vertex] = minimum(low[vertex], low[i])
                if parent[vertex] == nil AND child > 1
                    return false
                if parent[vertex] != nil AND low[i] >= disc[vertex]
                    return false    
            else if parent[vertex] != i
                low[vertex] = minimum(disc[i], low[vertex])
    return true