Given the following graph:
node[5]
with weight > 50
?node[5]
with label "knows"
, sorted by weight?Not sure about Gremlin, but in Cypher it is:
START s=node(5) MATCH s-[r]-f WHERE r.weight > 50 RETURN f
START s=node(5) MATCH s-[r:knows]-f RETURN f ORDER BY r.weight
If you care about the direction of the relationship, put arrows on the relationships, like "s-[]->f" or "s<-[]-f"
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With