An efficient algorithm for the density Turán problem of some unicyclic graphs

Let H = (V (H),E(H)) be a simple connected graph of order n with the vertex set V (H) and the edge set E(H). We consider a blow-up graph G[H].