Just my two cents: I actually wrote sort of a similar plugin: it implemented a slightly modified 'breadth-first' logic, where nodes were added to PriorityQueue (rather than simple queue, as in original ordering class). Hope this'll help... )
On 29 July 2011 17:02, Jim Webber <j...@neotechnology.com> wrote: > Hey, > > Retrieving "popular" nodes not directly possible with the REST API. > > Even in Java, you'd have to sort your result set manually since you don't > know ahead of time how the search is going to traverse your graph. > > It is only once you have your result set (which may be large) that you can > sort, and then deliver popular nodes back ahead of unpopular ones. > > If you're keen to do this via the REST API, I would suggest a writing > plugin that implements this logic in Java, and have that plugin exposed to > your client application. Be aware that such a plugin might have interesting > memory requirements if you end up processing large graphs. > > Jim > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- -- iD _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
