Created
August 5, 2015 08:56
-
-
Save larsw/1171536acf6bfda3f01b to your computer and use it in GitHub Desktop.
Can this neo4j Cypher query for in & out (afferent & efferent) and combined degree be optimized/reduced?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| START n = node(*) | |
| RETURN n.name, length((n)-->()) AS efferent, | |
| length((n)<--()) AS afferent, | |
| length((n)-->()) + length((n)<--()) AS degree |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment