Re: [Neo4j] cycle detection

nesse#Implementazione_in_Java Hi Jacopo Farina Il giorno ven, 25/03/2011 alle 13.51 +0100, Mattias Persson ha scritto: > I think you could implement this using RELATIONSHIP_GLOBAL uniqueness, like > (from the top of my head): > > Traversal.description().uniqueness( Uniqueness.RE

Re: [Neo4j] cycle detection

would be a problem. Is there a way to create temporary properties? Jacopo Il giorno lun, 28/03/2011 alle 10.16 +0200, Peter Neubauer ha scritto: > Cool! > > Would be great to maybe add this to the graph-algo package, if you > don't mind? Just fork and add it from > https://github

Re: [Neo4j] cycle detection

Uh, I may create a node and use relationships with it instead of node properties, to delete it after the work, but it doesn't sound a good solution. Jacopo Il giorno lun, 28/03/2011 alle 21.23 +0200, Jacopo ha scritto: > There's no problem with it! > The only issue is that

Re: [Neo4j] cycle detection

, subsets of the graph where any node can be reached by any other node of the set without going out of the set itself. A SCC bigger than one node implies the existence of at least one cycle. Cheers, Jacopo P.S.: the code create a set of nodes called s, that is truncated when it's sure it conta

[Neo4j] Iterating all nodes of a big graph

g. Is there a way to iterate all nodes lazily ? I'm thinking about a for cycle with long used to ask nodes to batch inserter, but it doesn't sounds like a good idea. Thanks a lot in advance, Jacopo -- Caselle da 1GB, trasmetti allegati fino a 3GB e in piu' IMAP, POP3 e SMTP

Re: [Neo4j] Iterating all nodes of a big graph

"+idpajek+" nodes"); tx = graphDb.beginTx(); } And I see the println() output as expected. Thanks, Jacopo On Sun, Jun 27, 2010 at 08.27 +0200, Tobias Ivarsson wrote: > Hi Jacopo, > > Starting from the bottom: You are right, using the batch inserter for this > is a f

[Neo4j] index returns a size 1 list of nodes, but the list is empty

. The cycle of println() too doesn't iterate, making me think "nodes" is really empty. But so why nodes.size() returns 1 ? Thanks, Jacopo -- Caselle da 1GB, trasmetti allegati fino a 3GB e in piu' IMAP, POP3 e SMTP autenticato? GRATIS solo con Email.it http://www.ema

Re: [Neo4j] Graph visualization

mi.it/index.php/Social_Network_Analysis_With_Igraph_Package_Using_R Unfortunately, igraph wasn't able to represent the graph which was made of about 7M nodes, but was useful to calculate global properties. I'm interested in representing a big graph, too! Cheers, Jacopo Il giorno mar, 12/10/

Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

Hi, I had the same problem and solved it by assigning a distance label to any node. The procedure is: 1-take the starting node N and add it to a set A, define the set B 2-set the value d=1 3-for any node M in A: 3.1 set the label "distance" of M to d 3.2 for any node X which is connected to

Re: [Neo4j] Neo4j vs orient db

mpare them by myself. Cheers, Jacopo Farina 2011/7/11 Jacob Hansson > On Sun, Jul 10, 2011 at 7:43 AM, Aliabbas wrote: > > > thanks andrew ! . Can you share with us your experiment for very large > > databases . Orient db also claims to be highly scalable and follows a >

Re: [Neo4j] Executing arbitrary code through REST (was: Specifying "best first" order of traverse over REST API)

arted using it in Python just yesterday. Cheers, Jacopo 2011/8/25 Peter Neubauer > Guys, > with the custom sorting in Lucene and this thread coming up all the time, I > took the time to document the execution of arbitrary Groovy and thus, Java > calls through REST. In the example below

Re: [Neo4j] Executing arbitrary code through REST (was: Specifying "best first" order of traverse over REST API)

Thanks a lot for the answer. Cheers! Jacopo Farina 2011/8/26 Javier de la Rosa > On Fri, Aug 26, 2011 at 13:12, Matt Luongo wrote: > > I think Javier is working on adding a "returns=" style parameter in > > the most recent source so that > > the client can figure

Re: [Neo4j] Open Data Sets?

te it, but the code is trivial, feel free to use it: http://pastebin.com/mj3bkDmZ It contains an utility class to read the file line per line, I'm sorry for the comments in Italian. The program avoids to load most of the stub or redirect categories, the execution should last 5-7 hours. Chee

[Neo4j] Python embedded and Java batch inserter

heers! Jacopo Farina ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo4j] Python embedded and Java batch inserter

Yes! It worked! Thanks a lot. Jacopo Farina 2011/10/18 Jacob Hansson > I think this might be another case of a problem that would be a lot easier > to solve if the python bindings pushed out full stack traces. It's in my > backlog to fix that. > > I'm gonna *guess* t

Re: [Neo4j] google n grams data set in neo4j

least some part of it) for free (and legally, of course) ? I've found just this page ( http://www.ldc.upenn.edu/Catalog/CatalogEntry.jsp?catalogId=LDC2006T13) but it seems I would have to pay. Cheers, Jacopo Farina 2011/11/28 Peter Neubauer > Seriously cool stuff René! > > I would l

[Neo4j] KeyError in python

gram is very slow.I started it at 18 pm end it crashed at ~65% of the work at 4 am It only reads the database, never changing it, is there a way to set it to use the cache intensively? I would put it in /dev/shm/ but my RAM is 3GB and the database is bigger. The code is this http://codepad.

Re: [Neo4j] KeyError in python

I tried again to run the program and still got the same error, at the same point. I'm running it on Ubuntu 10.10, but I could try on a pc with Windows 7 and more RAM. Cheers, Jacopo ___ NOTICE: THIS MAILING LIST IS BEING SWITCHED TO GOOGLE G