You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
However, the random walk does not 'respect' the adjacency matrix. A minimal example with a small bipartite undirected graph follows. I'm running the script on CPU, no CUDA involved (for now):
random_walk expects sorted input, but that is not clear from the documentation. Sorry! You can pass coalesced=True to the random_walk function. I also changed the default argument to make this more intuitive.
First, some info:
pip freeze
givesecho $PATH
:/home/dobrik/anaconda3/envs/geometric_new/bin:/usr/local/cuda-10.1/bin:/home/dobrik/anaconda3/bin:/home/dobrik/.local/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin
echo $CPATH
:/usr/local/cuda-10.1/include:
Tests are also passing:
However, the random walk does not 'respect' the adjacency matrix. A minimal example with a small bipartite undirected graph follows. I'm running the script on CPU, no CUDA involved (for now):
The last random walk is not valid. there is no edge between 3 and 0.
Am I misusing the API, by any chance?
The text was updated successfully, but these errors were encountered: