Algorithm - 2023.1 English

procedure ConnectedComponent(graph_CSR)
grpah_CSC := csr2csc(graph_CSR)

for each vertex v in graph
    result(v) := -1

result(0) := 1
push node 0 into Queue
while all vertexs have been labeled
    while Queue is not empty
        u := pop Queue
        for each edge(u, v) in both graph_CSR and graph_CSC
            if result(v) == -1 then
                result(v) := u + 1
                push v into Queue
            end if
        end for
    end while

    newRoot := findNewRoot(result)
    push root node into Queue
end while

return result