data structures using step remove the front element from the queue by setting front front so front rear queue agb step set indeg(dindeg( since is the neighbour of nowindeg( indeg( indeg( indeg( delete the edge from to the graph now becomes as shown in the figure below step remove the front element from the queue by setting front front so front rear queue agb step set indeg(cindeg( indeg(dindeg( indeg(eindeg( since cdand are the neighbours of nowindeg( indeg( and indeg( step since the in-degree of node and is zeroadd and at the rear of the queue the queue can be given as belowfront rear queue agbcd the graph now becomes as shown in the figure below step remove the front element from the queue by setting front front so front rear queue agbcd step set indeg(eindeg( since is the neighbour of nowindeg( the graph now becomes as shown in the figure below step remove the front element from the queue by setting front front so front rear queue abgcd step set indeg(eindeg( since is the neighbour of nowindeg( so add to the queue the queue now becomes front rear queue agbcde step delete the edge between an the graph now becomes as shown in the figure below