Suppose I have the following node/paths n -> n1 n -> n2 n -> n4
n2 -> n1 n2 -> n3 n2 -> n4 I want to find all paths of depth two (for example): n -> n2 -> n3 n -> n2 -> n4 and filter out those paths where a shorter path exists to a given node (n) leaving just n -> n2 -> n3 since n -> n4 is "shallower" than n -> n2 -> n4 Is this possible? I see GraphAlgoFactory.pathsWithLength(expander, length). But unclear on how to proceed beyond that. Jeff _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
