In more detail, to achieve such a goaldirected mechanism, at each step of random walk, the algorithm dynamically estimates the potentials for each neighbor by using the ultimate goal, and assigns higher probabilities to the neighbors with higher potentials.
the algorithm is more inclined to visit structures which are beneficial to infer the target and avoid transferring to noise structures.