Michael Hunger
Michael Hunger
Btw the best cypher way is Match path=(p)-[:X*]->(o) where not exists (o)-[:X]->() return path
What Chris said, usually for longest path you have a start node.
``` MATCH (m:Page) WHERE rand() < 0.10 WITH m LIMIT 100 MATCH (m)
There are two options. 1.eg extend cyper.run with an optional cache TTL or have a dedicated method 2. Combine it with query registration feature Note: Should only work for read...
@cskardon wants to work on this.
We should merge this into apoc: https://github.com/neo4j-contrib/neo4j-faker @kvegter can you help with that? then we have the infrastructure in place and can use it.
Please do, that would be great.
Exactly in Neo4j 3.2 there are user defined aggregation functions. My idea was to use the/something like the TopK Select approach that we also have in Cypher https://github.com/neo4j/neo4j/blob/3.2/community/cypher/cypher-compiler-3.2/src/main/scala/org/neo4j/cypher/internal/compiler/v3_2/pipes/TopPipe.scala#L87 I also...
```java package org.neo4j.util; import java.util.Arrays; import java.util.Collection; import java.util.Comparator; import java.util.List; /** * @author mh * @since 02.04.14 */ public class TopKHeap { public interface IntValue { int get(T item);...
@jansta did you find any time to look into this?