Figure 6.

Example of random walk. The arrows indicate possible self-avoiding random walks between the input vertex and the output vertex. The transition probability between the input and output is 1/12. The first probability is calculated by one divided by the number of connections of the input (1/3). At each subsequent step, the probability transition can be obtained by dividing the current probability by the number of non-visited vertices. In the superedges approach, all the possible self-avoiding random walks are considered between the input and output, yielding the respective transition probability.