Hi all, I am new to neo4j and excited to know more about graph database.
First of all, could anyone please help me to figure out the documentation about the query or rest client? Then, back to my question, I want to find 2nd degree friends but ordered by number of mutual friend. I understand that if I have all data in memory, I could've traverse the graph to 2nd level, and keep counter for each nodes in 2nd level. So in away its like finding all paths from start node to all second degree friend, but if we do that, it would be inefficient. Does anyone have any idea how to do this with neo4j? Thank you, Fajarmf _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
