May-01-2021, 12:21 PM
I've created a 3D and self-avoiding random walk, based on a dictionary containing only {'A','B','B','A','B','A',......} And made a graph out of it.
Now I need to find neighbors (A with A) that only have a distance of 1 (on the lattice) from eachother BUT are at least 3 steps (on the random walk) away from eachother.
Can somebody help?
Now I need to find neighbors (A with A) that only have a distance of 1 (on the lattice) from eachother BUT are at least 3 steps (on the random walk) away from eachother.
Can somebody help?