feat: support for generating random walks #324
Description
Generating random walks from a graph is really useful for a range of algorithms for large scale graphs. E.g. many node embedding algorithms rely on random walks from a node to generate the node's embedding which can then be fed to Spark's word2vec algorithm for generating the model.
Are there any plans for supporting random walks on Graphframes graphs? A reference implementation in scala which is efficient i.e. O(1) in sampling random neighbor from a node is available at: https://github.com/aditya-grover/node2vec/tree/master/node2vec_spark