Hi,
I have created a DAG using relationship like a-[:parent_of]->b.
How can I find the longest path starting from 'a' using cypher query?
Thanks
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails
*..5]-common_ancestor-[:PARENT_OF*..5]->h
> return common_ancestor as most_recent_common_ancestor
> order by length(path)
> limit 1
>
>
> Sent from mobile device
>
> Am 23.05.2014 um 21:44 schrieb Quazi Marufur Rahman >:
>
> Hi,
>
> I am trying to access a dat
Eagerly waiting for any kind of help.
On Sat, May 24, 2014 at 1:44 AM, Quazi Marufur Rahman
wrote:
> Hi,
>
> I am trying to access a database having 0.4 M nodes and 0.9 M
> parent->child relationship. However, I want to find common parent of two
> given node using the followi
Hi,
I am trying to access a database having 0.4 M nodes and 0.9 M parent->child
relationship. However, I want to find common parent of two given node using
the following query
start p=node:nodes(node_id="14697"), h=node:nodes(node_id="106209")
match path=p<-[:PARENT_OF*]-common_ancestor-[:PAREN
e device
>
> Am 20.05.2014 um 06:03 schrieb Quazi Marufur Rahman >:
>
> I have done this.
> cp -r test.db/* /path/to/neo4j/data/graph.db/
>
> After that I opened localhost:7474 and executed the cypher query, and it
> returned 0 rows.
>
>
> On Tue, May
path/to/neo4j/conf/neo4j-server.properties to this test.db directory,
>or copy the data over to your server cp -r test.db/*
>/path/to/neo4j/data/graph.db/
>
> Did you do that?
>
>
>
>
> On Mon, May 19, 2014 at 9:32 PM, Quazi Marufur Rahman <
> maruf.c...@gmail.com&
Hi,
I am trying to perform batch-import using this blog post.
http://maxdemarzi.com/2012/02/28/batch-importer-part-1/
I have used a different nodes.csv and rels.csv file.
link: https://gist.github.com/qmaruf/ed69acf8625ac577d578
Everything seems fine and after importing it shows the follow
Hi,
I am using the following code to create four new nodes A, B, C, D and
relations among them.
*a, b, r1 = g.create(node({"name": "A"}), node({"name": "B"}), rel(0,
"KNOWS", 1)) #rel between A, B*
*c, d, r2 = g.create(node({"name": "C"}), node({"name": "D"}), rel(0,
"KNOWS", 1)) #rel between
Hi,
I have created a directed acyclic graph using py2neo. Part of it looks like,
a->b
b->c
b->d
c->d
Here '->' represents 'knows'
I have two questions.
1. How can I find the node which knows both 'c' and 'd' and closest to
them? Something like lowest common ancestor in tree.
2. How to