With this output of c# code :

Connected graph components: 0 4 1 2 6 3 5

S-1: Set H = G and component count c = 1. S-2 : Choose an arbitrary vertex v of G. S-3 : Fuse all vertices in the neighbourhood N(v) with v and call this vertex v. S-4: If the number of vertices which are non-adjacent to v is the same as that before the fusion, then go to Step-5. Otherwise, go to Step-2. S-5: Delete the vertex v (with all fused vertex from H call this new graph H. S-6: If H has any vertex left in it, then let c +- c+1 and go to Step-2. Otherwise, go to Step-7. S-7: Print each c with its vertices. Stop.

(*Use a paper *and draw the graph in that paper Using these steps Write each step with explanation and (Each step has the graph explaining this step next to it ). Finally draw each component with its vertices in paper)