Hi there, you could do this with either the Travesal framework in Java (http://docs.neo4j.org/chunked/snapshot/examples-uniqueness-of-paths-in-traversals.html for an example) or, probably in Groovy/Gremlin if you want to script, but I am a bit out of my league for an example ...
Cheers, /peter neubauer 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 - NOSQL for the Enterprise. http://startupbootcamp.org/ - Öresund - Innovation happens HERE. On Tue, Oct 25, 2011 at 6:58 PM, n_aschbacher <[email protected]> wrote: > 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-discussions.438527.n3.nabble.com/Cypher-Aggregation-functions-specifically-SUM-tp3450203p3453168.html > Sent from the Neo4j Community Discussions mailing list archive at Nabble.com. > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
