efficient random sampling of paths between two nodes

Good day to all,

(repeated because chose wrong email address).

I wrote an initial message (through the issues site) asking about the
possibility of using the all_paths to random sample paths between two nodes
in a graph.

It was pointed out that the: 1. The algorithm is deterministic and that 2.
It’s not possible to adapt it to iterate in a unbiased random way.

Now I have a couple more questions, namely searching for advice on how to
achieve what I want.

attachment.html (9.09 KB)