cancel
Showing results for 
Search instead for 
Did you mean: 

Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.

Forum Posts

Beta Opportunity for Neo4j Workspace

Introducing Neo4j Workspace We’re inviting you to check out Neo4j Workspace. Workspace combines our most powerful graph tools (Data Importer, Bloom, and Browser) all in one place to help you get up and running with graph databases faster. For experie...

Screen Shot 2022-10-14 at 12.48.07 PM.png
TrevorS by Community Team
  • 966 Views
  • 1 replies
  • 0 kudos

About the Neo4j Graph Platform Category

The Neo4j Graph Platform includes the core database and all the technologies surrounding the database, making it useful and accessible for a lot of different users. When asking a question, please select a descriptive label that best matches your quer...

Neo4j-graph-database-to-graph-platform.png
yolande by Community Team
  • 1195 Views
  • 1 replies
  • 1 kudos

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...

Resolved! Path counting

I need to fix an issue i am facing. simply put, i need to select 500 random nodes and count the number of paths to a single target node at hops 1,2,3,4. i am doing it one at a time after coming up with those random nodes using a separate code. this...

3X_a_b_ab0e7d9eacd261621c2e43a72f4ed4f04ad865ea.png

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...

Copy & Paste not working anymore

Hi there It's deeply ennoying, The copy & paste function in Neo4j browser 4.4.5 doesn't work properly anymore.The favorites are not sync between the one in desktrop and the on in the browserThe favorites function with login just crash the neo4j brows...

Resolved! Import of OWL File Leaves Nodes Without a Label

I am using Neo4j Community version 4 and am trying to import an ontology (.owl file).  I followed the steps below and the data imports, but when I look at the nodes created in the Neo4j Browser, none of them have labels on them.  They are all blank. ...

Browser for Aura doesn't save (cache) credentials

Been using Neo4j community edition and desktop edition for years, so for a client project I am trying out Aura.I have a report utility that runs tabular reports from graph data, and sometimes I include a column that has a hyperlink to open a visual g...

pdrangeid by Graph Voyager
  • 589 Views
  • 1 replies
  • 0 kudos