You can traverse only relatioships and call getStartNode() getEndNode()...
Dne 12.4.2011 03:37, Brendan napsal(a):
> Hi,
>
> I had setup one traversal description but it seems to me that each time of
> traverse can only get one of three outcome, nodes, relationships, or paths.
> How to get more
Kevin,
in the upcoming 1.3 Neo4j release, we changed the Tanuki wrapper to
http://yajsw.sourceforge.net/, which means there are no licensing
issues. I would love for you to test it on Windows 64 - bit once it is
out (or even before) and report back on how it works. Let me know, can
send you a packa
Hi,
I have limited Java knowledge, so hopefully this question makes sense.
I am deploying Neo4J on a Windows 64-bit server. I have successfully
deployed it by downloading a trial license for the Windows 64-bit version of
the Tanuki Wrapper. Everything is set up and working fine.
My question is
Hi,
I had setup one traversal description but it seems to me that each time of
traverse can only get one of three outcome, nodes, relationships, or paths.
How to get more than one result traverse? Now, I sent two requests to get both
nodes and relationships. But there is a chance that betwee
Hi,
I think it can be helpful for controlling the amount of transfers to take,
When I have two layers with walking connections between the layers
every path which reaches the second layer will contain only one transfer.
But the drawback is that you also have to search for end nodes on both
layers.
thanks michaels for your answer,
Mattias i have a query, if I do EmbeddedGraphDbImpl G1 = G2;, means that if I
delete information of the graph G1 is also deleted in G2, and if this is the
best way to create a temporary graph
- Mensaje original -
De: "Mattias Persson"
Para: "Neo4j user di
Your question is very generic. The quality/correctness of answers you
will get correlates to the amount of information/context you can
supply. Michaels answer is very generic too, although maybe the
correct one for your use case :)
2011/4/11 Jose Angel Inda Herrera :
> hello list,
> i need to know
Hi Paddy,
how would that help in decision-making of which route is the
"shortest" when also taking into considering the amount of transfers?
2011/4/11 Paddy :
> Hi John,
> One option could be to model the graph with 2 identical spatial layers and
> add walking relationships between the layers.
>
Reply to 6. Re: Path finding (Paddy)
Thanks for the suggestion Paddy, but I'm unsure it would meet the way I'm
trying to model the network. My graph at the moment isn't actually a spatial
layer(although it does contain spatial data:->) any stop within 500
meters(not on the same route(either direct
Argh,
Michael you beat me by one minute!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org - Your high performan
Hi,
node.delete()
please keep in mind that you have to remove its relationships first,
for (Relationship rel : node.getRelationships()) {
rel.delete();
}
and you might remove the relationships and the node from indexed that those
have been added to, too.
Cheers
Michael
Am 11.04.2011 um 2
Hi John,
One option could be to model the graph with 2 identical spatial layers and
add walking relationships between the layers.
Similar to the attached pic, its from http://bit.ly/hJN2BB and then only one
walking relationship could be traversed.
Cheers
Paddy
On Mon, Apr 11, 2011 at 7:50 AM, Joh
hello list,
i need to know how to remove one node specific in my graph
thanks
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Thanks for your ideas, Peter and Mattias!
We will work on them and hopefully have some results we can post back here
soon.
On Mon, Apr 11, 2011 at 21:18, Mattias Persson wrote:
> 2011/4/11 Peter Neubauer :
> > Mmh,
> > you might be right in that the ShortestPath is not taking that much
> > cont
2011/4/11 Peter Neubauer :
> Mmh,
> you might be right in that the ShortestPath is not taking that much
> context info into account. In that case, I guess you should hack it to
> be even smarter about how to expand things. Right now, if you look at
> https://github.com/neo4j/graphdb/blob/master/gra
Mmh,
you might be right in that the ShortestPath is not taking that much
context info into account. In that case, I guess you should hack it to
be even smarter about how to expand things. Right now, if you look at
https://github.com/neo4j/graphdb/blob/master/graph-algo/src/main/java/org/neo4j/graph
Ive set up a graph to represent a transport network. A bus stop may be
connected to others with a walk relationship. All nodes have relationships
with dist and time. The purpose of it is to plan people's routes.
I'm using aStar, and have tried using dijkstra but they both return similar
results. I
Hi all,
the reason I asked the question about counting the number of visited nodes
earlier is that we are running into performance issues when working with
different expanders.
Our graph contains *user* and *company* nodes. There are a lot more users
than companies. Users are connected through *c
Hi Tobias,
yes!
Since computation isn't performed until actually requested (when the
> iterator is iterated over), and since the Iterable could give a different
> result when you iterate over it subsequent times (due to the graph being
> modified), the Iterator object is the only object where I c
19 matches
Mail list logo
