> Expander expander = Traversal.expanderForTypes(TopoRels.LINK,
> Direction.BOTH);
> expander = expander.addRelationsipFilter(new
> ValuePredicate(minWeightValue, Consts.PROP_WEIGHT));
> PathFinder<Path> pathFinder =
> GraphAlgoFactory.allSimplePaths(expander, maxNodeNum);
> Iterable<Path> paths = pathFinder.findAllPaths(startNode, endNode);
> 2012/10/10 Rehan <rehan.az...@gmail.com>
>> Hi ,
>> Can any one put a quick example in Java for how we can get All Simple
>> Paths (with no loops) between two nodes.
>> Thanks and Best Regards,
>> Rehan
>> --
> --
> Best regards,
> yang jun
> Tel: 028-85126877
> Mob: 18608027881 <mailto:yangjun.chen...@gmail.com> <yangjun.chen...@gmail.com>
> Chat: yangjun.chen...@gmail.com(gtalk)
> --
