Input: —Mobility Graph; —maximal path length; —meeting probability specified by user  Output: —result set being searched  transition matrix of  compute the 1step, 2stepstep transition matrix of  compute the VVP between all nodes according to (2)    while do     end while 
