Sure it is simple in the Java API as you have full control, via
PathExpanders and Evaluators, see here:
http://neo4j.com/docs/stable/tutorials-java-embedded-graph-algo.html
http://neo4j.com/docs/stable/tutorials-java-embedded-traversal.html#examples-uniqueness-of-paths-in-traversals
Michael
On S
Hi Michael and Gabriel,
Is it possible to make such similar queries using Java API ? or the
graphAlgorithms ?, in the last case I understood that you can only use the
parameters: node and distance.
I would like to find all paths starting in one node, and exclude all paths
that have a node with t
try this
MATCH (topic:attribute) WHERE id(topic) IN [37, 38]
> MATCH p = (topic)-[rel: describedBy*0..4]-(node: attribute
where none(n IN nodes(p)[..-1] where n.key = "enrichment" OR n.key =
> "classification")
RETURN p;
The problem is I want to remove paths where any of the nodes in the path
I am having trouble creating an appropriate Cypher query. I would like to
return the sub-graph of all edges & nodes within a certain distance of a
topic node. This could easily be done with something like:
>
> START (topic: attribute)-[rel: describedBy*0..4]-(node: attribute
WHERE id(topic) IN
