What you have to do currently (not the optimal solution) is to cd to that
relationship:
cd -r 468
now do your ls. From there you can then go:
cd ..
or
cd start
or
cd end
2010/10/17 Peter Neubauer peter.neuba...@neotechnology.com
Hi,
I am trying to list relationship
Cool, thanks!
If cd -r works, could we then have a ls -r variant that lists
relationships directly from ID maybe?
Cheers,
/peter neubauer
VP Product Development, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn
2010/10/17 Peter Neubauer peter.neuba...@neotechnology.com
Cool, thanks!
If cd -r works, could we then have a ls -r variant that lists
relationships directly from ID maybe?
Sure, the ls -r means list the current node's relationships... but maybe
the list relationship contents is more useful
Hi
I have some issues installing neo4j. As far as the import statement is
concerned it seems to work fine. However the error comes when i do this.
graphdb=GraphDatabase(/home/tanmoy/Desktop)
Traceback (most recent call last):
File stdin, line 1, in module
File
Hi,
I am playing with Neo4J version 1.2 M1, specifically
with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should
never return paths with loops.
However, it seems like it does. I created a simple test case to demonstrate
that: http://snipt.org/kpwn/
I expect the code not to
Hi Yaniv,
thanks for the report, I will take a look at it tomorrow if that is ok?
Cheers,
/peter neubauer
VP Product Management, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter
Sure :) Will be happy to get your feedback.
--- Yaniv
On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Hi Yaniv,
thanks for the report, I will take a look at it tomorrow if that is ok?
Cheers,
/peter neubauer
VP Product Management, Neo Technology
Hi Peter,
I've been trying to implement this paper:
http://ad.informatik.uni-freiburg.de/papers/transferpatterns.pdf
It's being used by google transit. I'm representing the network as a time
expanded graph with each departure time
at each stop as a stoptime node. Each stoptime node is connected to
I just realized (it was me who put it there) that the documentation is
wrong. That one allows cyclic paths, as you obviously noticed :). I'll try
to add a simplePathsWithLength method also to take care of that...
2010/10/17 Yaniv Ben Yosef yani...@gmail.com
Sure :) Will be happy to get your
Thanks Mattias!
Do you have an expected time-frame for that? Alternatively, do you have any
quick tips on how I would go and implement this myself? I very briefly
scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect
I should test whether a node has already been visited (in
10 matches
Mail list logo