Hello,
I needed to have a way to show all neighbors of a node in a weighted
graph in a neo4j database. The neighbors must be sorted by relationship
name and within each relationship, by descending order of weight. I had
blogged about my solution, and Peter Neubauer pointed out that I had a
better
Hi!
Would appreciate suggestions and pointers on how to improve this, or do
it in a better/different way.
Don't know about better, but a different way would be to use
Node.getRelationships(RelationshipType,Direction)
as you are only traversing to depth one.
Then you get an outer loop over
2 matches
Mail list logo
