cancel
Showing results for 
Search instead for 
Did you mean: 

Neo4j Graph Platform
cancel
Showing results for 
Search instead for 
Did you mean: 

Forum Posts

GDS and Causal Cluster Lack of Integration

Now that we have been using the Neo4J graph database for a few years and have integrated and using the GDS library we are now moving to a causal cluster. But Neo4J has not integrated the GDS library to run on a cluster. What? GDS algorithms are alleg...

Modeling and querying package dependency trees

Dear Community, we are Connor and Daniel, Software Engineers at Anaconda, and we are currently looking at neo4j to represent our package meta data to answer questions like: What packages are available for python X on platform Y but not on platform Z?...

Untitled graph.png

Graph deletion starting from root

I have a graph as shown below:   S1/.        \ss1    ss2/     \. /.    \     ss3 ss4 ss5 I want to start from the root node and then check the count of incoming and outgoing relation, if incoming = 0 and outgoing != 0 , then delete the node and relat...

Additional Algorithms for Graph Data Science

Hi, I started to develop additional algorithms for GDS. You can see them here: https://github.com/cuneyttyler/semanticspace-neo4j-gds For now there is only a concurrent version of Dijkstra's Shortest-Path algorithm for multiple source-target pairs. I...

Resolved! Multiple Pair Shortest Path algorithm with Pregel

I have an application where I'd like to retrieve shortest paths for multiple source-target pairs. I'd like to write my own function but as far as I figured out that with Pregel, writing such a function is not possible. Because pregel allows sending o...

Graph Data Science DFS traversal takes forever

I have the following query. Although I gave maxDepth = 1, the run never ends. When I run this with BFS it instantly returns. Isn't it supposed to be fast with maxDepth = 1? (NOTE: I have a very large graph but I'm not sure if that's relevant when ma...