Permalink
Browse files

minor formating

  • Loading branch information...
1 parent db17d27 commit 479c5b5a3832c98f2ee128e64175812eb62b4d70 @peterneubauer committed Jul 2, 2012
@@ -63,9 +63,8 @@ weighted for the weight of the relationship `r2`, and boosted with a factor of 2
queryText = """START origin=node:node_auto_index(name = "Clark Kent")
MATCH origin-[r1:KNOWS|WORKSAT]-(c)-[r2:KNOWS|WORKSAT]-candidate
WHERE type(r1)=type(r2) AND (NOT (origin-[:KNOWS]-candidate))
- RETURN origin.name as origin, candidate.name as candidate, SUM(ROUND(r2.weight +
-(COALESCE(r2.activity?, 0) * 2))) as boost
- ORDER BY boost desc limit 10;""",
+ RETURN origin.name as origin, candidate.name as candidate, SUM(ROUND(r2.weight + (COALESCE(r2.activity?, 0) * 2))) as boost
+ ORDER BY boost desc limit 10""",
returns =
"""This returns the recommended friends for the origin nodes and their recommendation score.""",
assertions = (p) => assertEquals(List(
@@ -61,7 +61,7 @@ Therefore the clustering coefficient of node 1 is `1/6`.
`n` and `r` are quite simple to retrieve via the following query:""",
queryText = "START a = node(1) " +
"MATCH (a)--(b) " +
- "==== a, count(distinct b) as n ====" +
+ "WITH a, count(distinct b) as n " +
"MATCH (a)--()-[r]-()--(a) " +
"RETURN n, count(distinct r) as r",
returns = "This returns `n` and `r` for the above calculations.",

0 comments on commit 479c5b5

Please sign in to comment.