Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Now that we've figured all that out, and determined that it's not built-in to Cypher yet... What is the best practice for doing this with the available tools? I mean effectively what I'm looking for is the heaviest branch on a tree right? -- View this message in context: http://neo4j-community-

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

g like this: > > RETURN SUM(MAP(x in NODES(path) : x.votes)) > I should read more carefully before I start typing. :-) Yes. This makes the most sense to me. On Tue, Oct 25, 2011 at 12:02 PM, n_aschbacher <nathan@>wrote: > Hi, > > You're correct in one sens

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Hi, You're correct in one sense. If I remove the path, or other columns, from the RETURN statement then I can get a single SUM value back for all the properties in the entire tree below my starting node. My problem is that I want to return multiple rows, a row for each path through the graph, wi