Hi @"Adas Ur" ,
Unfortunately, this is not something we support right out of the box. It should be possible to implement, however, either on top of our SFrames open source package or possibly with the
Here are a few things to think about:
1. All paths can quickly become intractable as the size of the graph grows.
2. This can be implemented as a shortest-path algorithm, where maybe you keep track of shortest-k paths.
Here's some code that accomplishes this on the older PowerGraph project: