No it's in 2.1
Not really an equivalent
There are some things you can do with reduce for uniqueness and path patterns
but it won't be the same
Sent from mobile device
Am 02.06.2014 um 05:01 schrieb John Fry :
> Thanks - I will take a look as this approach. Just quickly UNWIND isnt avail
> in
This is not a bad way to get a subgraph for step 1.
neo4j-sh (?)$ START a=node(448091),
b=node(6573222)
MATCH p=allshortestpaths((a)-[*..10]-(b))
return extract(n IN nodes(p)| n.title), extract(r IN rels(p)| r.weight);
yields a
Thanks - I will take a look as this approach. Just quickly UNWIND isnt
avail in 2.0.2. Is there an east equivalent?
As soon as I get some good results I will post back...
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group
How about something like this:
START a=node(448091), b=node(6573222)
MATCH p=allshortestpaths((a)-[*..10]-(b))
// all nodes
UNWIND nodes(p) as n
// remove duplicates
WITH distinct n
// expand
MATCH p2=(n)-[*..2]-(m)
UNWIND nodes(p) as n
WITH distinct n
LIMIT 1000
MATCH (n)-[r]-(m)
RETURN n,r,m
I think ideally it would help if I could get the subgraph results in the
following format (i.e. basically a list of relation properties with src and
dst nodes):
+-+
| from
