Hi all,
I am using the python version of neo4j.
if i have n1, n2 as two nodes and KNOWS a relation between n1 and n2 in a graph.
n2.KNOWS(n1): How to check if there is a relation KNOWS between n1 and
n2?n2.MAILED(n1, on=123456789) and n2.MAILED(n1, on=987654321): How to check
that MAILED
Hi there!
I thought that aggregation would be nice to have in neo4j, so that not
everyone has to do it manually... So I coded up what that could look like.
If this is something that interests you, please, take a look at
svn.neo4j.org/laboratory/components/aggregation/trunk
I'm specially
Hi,
For the project I'm working on, I need a traversing as follows:
the relationships, which are put in for the traversing should not be attended
at the same depth.
That means: At first I want to get all nodes by traversing relation_1 and then
on this sample space I want to get all nodes by
Have you looked at PatternMatch functionality? Take a look at
http://components.neo4j.org/neo4j-graph-matching/
IMO, you can define a pattern for relation_1 and from what you get as
pattern nodes in relation_1, define relation_2 for them.
Only thing you will need to know is where to look for
2010/9/28 Joshi Hemant - hjoshi hemant.jo...@acxiom.com
On second thought, you could use the new traversal framework as well. I
haven't used all the features but it should be possible to do something
like:
TraversalDescription td =
Traversal.description().breadthFirst().relationships(
Thanks a lot !
On Tue, Sep 28, 2010 at 11:22 PM, Mattias Persson
matt...@neotechnology.com wrote:
I think there's a working version of it now... look at the tests for more
information:
6 matches
Mail list logo