Re: [Neo] Graph Algo Problems

Those exceptions seem like it might not be setup properly. No matter, I changed the implementation. I am seeing different centrality calculations for Arnoldi versus Power. I tweaked the iterations to see if it made a difference. Is it the precision setting causing the difference maybe? The

Re: [Neo] Graph Algo Problems

Ok, great, I am just now looking at it and noticed a NPE in Node topicNodes = referenceNode.getSingleRelationship(RelationshipTypes.TOPICS, Direction.OUTGOING).getEndNode(); The referenceNode.getSingleRelationship(RelationshipTypes.TOPICS, Direction.OUTGOING) is returning NULL ... Cheers, /pete

Re: [Neo] Graph Algo Problems

Hi Peter, I have the centrality stuff working now, no further help required. :) My nodeset had to be larger. -Todd On Mar 1, 2010, at 10:02 PM, Todd Stavish wrote: > Hi Everyone, > > I am running into some null pointer exceptions when I try to feed > things into some of the graph algos. Th

Re: [Neo] Graph Algo Problems

Hi Peter, Thanks for the help. It is critical. I need to provide feedback to my customer on the suitability of using the in-built Neo4J graph algos. Or if someone has a working testcase of Floyd-Warshall or either Eigenvector implementation, I could use that to compare with my code / graph. Thank

Re: [Neo] Graph Algo Problems

Thanks Todd for the pointers! Is this absolutely critical for you? Otherwise, we will put it into our backlog and do as time permits. Great you got testcases, so I'm sure we should be able to sort it out. The graph algos are written some time ago and would need some general review - we are not qui

[Neo] Graph Algo Problems

Hi Everyone, I am running into some null pointer exceptions when I try to feed things into some of the graph algos. The test cases can be found in the link below. It is all maven based and the pre-built graph is included. Queries19 (Floyd-Warshall), 20 (Eigenvector Centrality with the "Arnoldi ite