 Consider an unweighted directed graph formula_1 with the set of vertices formula_2.Let formula_3, where formula_4 denote the shortest distance between formula_5 and formula_6.Assume that formula_7 if formula_6 cannot be reached from formula_5.