There are some graph algos
exposedhttp://components.neo4j.org/neo4j-server/0.6-SNAPSHOT/rest.html#Finding_paths_between_two_nodes(which
I wrote), but the Dijkstra algo isn't available there... Either dig
in and extend it with Dijkstra support or write an extension as Jim
mentioned.
2011/1/24 Jim
Hi,
thank you for making these things clear.
I think I can handle these fake iterables. I just wanted to clearify that,
because I did not find this in the doc for graphmatching.
About the second problem. I see my fault. Everywhere the valuecontext.numeric
has to be used. Thank you for that.
I
Hi Guillem,
I believe on both windows and *nix, neo4j install creates a single service.
So, just having two neo4j installation directories with different configuration
isn't enough if you want them to both run as a service.
In *nix land, you could simply copy the /etc/init.d/ script to a new
Hi Andreas,
It was related with the creation of services in Windows, but I've just make it
work.
In order to create two different services for the neo4j servers the only thing
necessary (besides the modifications explained before) it's to change the
neo4j-wrapper, in the part related with
Maybe this is a stupid question (or not), but I'm assuming that the
relationship id will also be expanded as well? Supporting a large # of
nodes without also supporting a large # of relationships would obviously not
make sense, but just wanted to confirm.
Thanks,
Rick
Yeah,
that would be great. I think the extension you are talking about would
be to have a traversal running, so I would make it an implementation
of the yet-to-come Script execution extension with a JavaScript or
Gremlin Snippet in it. Would be good test for that one. Tobias, you
had started on
Thanks for reporting that back, Guillem!
We will put it into the reference docs so others can benefit fro your findings!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter
Yes,
this is in the roadmap for 1.3, and getting working on very soon (TM).
The ID space is for both properties, relationships and nodes, so
expansion will affect all of them.
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn
That's a good point to clarify:
The number of possible nodes, relationships, and properties will each increase
with complementary id sizes.
Best,
Andreas
On Jan 25, 2011, at 3:12 PM, Rick Bullotta wrote:
Maybe this is a stupid question (or not), but I'm assuming that the
relationship id
Guillem,
docs are updated to reflect this, see
http://docs.neo4j.org/chunked/snapshot/server-installation.html#_multiple_server_instances_on_one_machine
Is that information correct or is there more to it?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone
Hello list, i hope that all are fine,
i have this code ,
public class Particion()
{
LinkedListClaseEquivalencia elements;
Node node;
public Particion(Node node)
{
this.node = node;
this.node.setProperty(elements, elements);
}
...
}
and me compiler return,
Exception in thread
Jose,
Arrays of objects are not supported as properties. In that case, you
should probably either model these as Nodes and Relationships, or
serialize them into a String and that way persist the List.
An example of using Spring to model Sets is in
Hello,
We are trying to use neo4j graph database in one of our applications.
I think we hit a roadblock with traversal framework. It could be due to our
limited knowledge of neo4j framework.
Here is what we are trying to accomplish:
We need to get a path(from the graph below) from the nodes A to
In fact, arrays of primitives+Strings are supported, but not List or
Collection or anything like that is.
2011/1/25 Peter Neubauer peter.neuba...@neotechnology.com
Jose,
Arrays of objects are not supported as properties. In that case, you
should probably either model these as Nodes and
Hi John,
The graph algorithms package has a some useful features for path finding (e.g.
shortest path). Do any of the approaches in
http://components.neo4j.org/graph-algo/ seem useful to you?
Or do you think that a custom traverser is necessary instead?
Jim
Joshi,
I am a bit suspicious of your wrapper.log,
STATUS | wrapper | 2011/01/24 11:34:47 | Launching a JVM...
INFO | jvm 1| 2011/01/24 11:34:47 | WrapperManager: Initializing...
INFO | jvm 1| 2011/01/24 11:34:47 | WrapperManager:
INFO | jvm 1| 2011/01/24 11:34:47 |
16 matches
Mail list logo