In the paper, the update in G steps is according to formula 4, in which generative probability is defined by the product of several probability along the way from node v_c to node v. However, in the program, it only considers the nodes in the window to update generator. I am wandering whether this approximation is plausible?

If only using the sampled node without using the path over it, the efficiency would be quite low.