Hi,
Finding absolutely all the paths between two nodes is a very difficult problem because the number of paths could be very big (infinite if you have cycles).
So, unless you know that your graph is very simple you may want to add some restrictions to the paths expected to find (like consider two consecutive nodes the same step no matter which of the possibly several edges that directly join them you use, never visit a node twice, only consider the shorter paths, ...).
None of the algorithms that we provide can be directly used to get what you want. But you can program a custom algorithm to suit your needs yourself using neighbors or explode operations.
Please take a look to our User Manual here:
http://www.sparsity-technologies.com/UserManual/API.html#navigation-operations for examples on how to use the explode and neighbors operations. And do not hesitate to contact us again if any doubt arises with those.
Best regards.
El divendres, 23 gener de 2015 4:54:21 UTC+1, oj va escriure: