Algorithm to turn a graph into a tree of subgraphs

Question

My graph G has subgraphs that are connected by cut-edges, i.e. if you remove the cut-edge, the subgraphs will become disconnected. After the first cut, we have 2 disconnecte