9 6 we introduce a marking scheme in order to identify strongly connected subcomponents of the graph which cannot reach the initiator of the algorithm