Hello,
I am currently working with node2vec algorithm from the gds library and I have a question about the random walks generated by the algorithm. I am wondering how, given a directed graph, the node2vec algorithm works ?
Does it takes into account the directed edges in the generation of the random walks or not ? If the algortihm is able to handle the directed edges, the weighted random walks ared useless in a graph where there is no strongly connected components.
Thank you in advance for your response.
I am looking forward to hearing from you