However, due to the label enrichment that has been applied to the vertices of the transformed graphs, the number of matching nodes in the two graphs has been radically reduced and the number of pairs of edges that have to be considered is also reduced.
we have to consider n 2 pairs of edges as only paths between vertices whose label is the same in the two graphs are considered.