Neo4j Graph Platform

Generic data model for Community algorithms

Can somebody help me in understanding expected data models for Community algorithms which is available in Neo4j? A link or graphgists would help me alot. Thanks

The error of the Connected Components algorithm

I have some problems when using the Connected Components algorithm: Enter the example in the official website -> cypherCALL algo.unionFind.stream('User', 'FRIEND', {}) YIELD nodeId, setId RETURN algo.asNode(nodeId).id AS user, setId.Display ERROR:Neo...

Using the graph algorithms in a user-defined procedure with junit

Hello everyone, I'm currently working on implementing an algorithm as stored procedure for my master thesis. I can't tell you the algorithm since it's an internal project but that's not the point of the question. I'm following the tutorial at https:/...

Register for Your FREE Copy of the Graph Algorithms Book

I'm super excited that the book that @mark.needham and @AmyH worked on for the last 9 months, has been finally published. It's really great content, I read it several time during the review process, lots of practical examples and good explanations o...

Syntax Error

Syntax Error at ORDER BY clause -> https://neo4j.com/docs/graph-algorithms/current/algorithms/degree-centrality/#algorithms-degree-syntax 5.7.4. Weighted Degree Centrality algorithm sample CALL algo.degree.stream("User", "FOLLOWS", {direction: "incom...

Jaccard algorithm returns no records

I am using Neo4j Desktop 1.1.20, Neo4j 3.5.2, Graph algorithms 3.5.2.0. I am following along with the documentation for streaming jaccard similarities and keep getting no results. Cypher: </> WITH [ {item: 0, categories: [30633,30648,30630]}, {item: ...

Resolved! How do you do a fully small subgraph search? (Screenshot inside)

I'm creating a database of math diagrams (in a certain category), and need to search for every square say like the above. But these diagrams can get huge maybe 5 x 5 squares, yet they remain relatively sparse. How can I search for a subgraph using ...

Resolved! Union find deadlock

Hi, I tried running the union find algorithm on my graph, but it seems to have hit a deadlock. It's been running for 12+ hours but the server shows no CPU usage or I/O. I suspect the issue is related to the size of my graph. It has 650 million nodes,...

Graph Matching Algorithms

Hi all together, Neo4j has been on my "needs a second look" list for quite a while, I finally thought I found a toy project, which might be a good fit. However as I looked for graph algorithms, implemented in Neo4j I couldn't find any for my problem....

What does PageRank coefficient mean?

Hello, I would like to understand the interpretation that I should give to the pageRank coefficient I get from neo4j. For instance, in the example you show on your webpage, the HOME node has a coefficient of 3.23. How should I interpret this number? ...

algo.pageRank - Managing ID's that are Strings - Help? Thoughts?

Good Day All, We've had a great deal of success with the APOC procedure "apoc.algo.pageRankWithCypher" below. However, I recently loaded a new data set and discovered there where ()-[p:CONNECTED_TO]-(r) relationships that existed and where not being...

What is the best way to search for a relatively small subgraph (< 50 nodes typically) but in a huge database?

I'm applying Neo4j to the problem of diagram chasing, so my graph database holds diagrams that the users draw using my software. I need the ability to search for the user's drawing so as we don't have duplicates. Is the best way just to build up a ...

Purpose and use of `maxDepth` in `algo.kShortestPaths`

What is the maxDepth parameter of algo.kShortestPaths? Can this parameter be used to make the algorithm more efficient by not searching beyond some depth? Depth of what? For example, after determining the shortest path, can this parameter be used to...

Page Rank Problem

Hello, I am trying to use Page Rank algorithm in an amout of data. It is a triplified content in rdf format. The data consists in a group of datasets registered with their metadata, keywords to explain their topics. The idea is to find the most influ...

Algo.similarity.jaccard.stream takes more than 3 minutes

Hi Michael, I am trying to calculate jaccard similarity but it takes more than 3 minutes. MATCH (u:User)-[:HAS]->(f:Feature) RETURN count(*); count(*) : 106384 MATCH (u:User) RETURN count(*); count(*) : 15198 :schema Indexes ON :Feature(id) ONLINE...