Lorenzo, sorry for taking so long time - missed your CLA mail. Anyway, we got it, thanks!
Now, could you raise and issue in trac.neo4j.org and attach your patch against the current graph-algo trunk so we can include it into the code? Would be great to have this coming in. Cheers, /peter neubauer COO and Sales, Neo Technology 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 performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Wed, Jun 2, 2010 at 8:04 AM, Peter Neubauer <[email protected]> wrote: > Lorenzo, > > On Mon, May 31, 2010 at 2:33 PM, Lorenzo Livi <[email protected]> wrote: >> I'll make a try with the 0.6-snapshot version and I'll let you know. > yes, please get back with feedback! Tobias and Mattias have been > looking closer at some of the algos in the graph-algo package but not > all are totally tested through, so your feedback is greatly > appreciated. > >> >> The last thing: the power method is not guaranted to converge always >> ... especially if the graph is directed (neo4j is always directed). >> Then a method like Arnoldi Iteration is necessary IMHO. >> I've developed the simplest centrality measure, the degree centrality >> and I should develop PageRank and/or HITS (not now ..). Maybe you can >> be interested in these algos (for now the degree centrality). Let me >> know. > Yes, we are and could include them into the graph-algo package. You > can just sign the CLA and we can get going on this, > http://wiki.neo4j.org/content/About_Contributor_License_Agreement > > > /peter > _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
