cancel
Showing results for
Did you mean:

Head's Up! Site migration is underway. Expect disruption to service on Thursday, Feb. 9!

since ‎12-30-2021
‎06-01-2022

## User Statistics

• 11 Posts
• 0 Solutions
• 0 Kudos given

## Create graph is very slow

I use the cypher like: CALL gds.graph.create.cypher( 'mygraph', 'MATCH (n) RETURN id(n) AS id', 'MATCH (n)-[r]->(m) RETURN id(n) AS s, r.cost as cost, id(m) AS t' ); to generate a new graph with name of mygraph, but it run an unexpected ...

## Does community algorithm suit for unconnected graph?

Hi, I have a question about the performance of community algorithm, like maxkcut, I have a graph with 3000 nodes, and 40000 rels. The contains 3 parts of data, and each part is kind of separate. When I apply community algorithm, it is very slow, run ...

## What is algorithm behind allshortestpaths query?

In neo4j, we can call the allshortestpaths query to find out all shortest paths between two nodes, like this: MATCH p=allShortestPaths((h)-[*1..20]->(k)) Where can I find the code/algorithm behind this query? I would like to know which algorithm here...

## Can I add path weight in allshortestpath algo without call gds?

I use cypher like this: "MATCH p=allShortestPaths((h)-[*1..20]->(k {value:true}))" to search all pair shortest path, can I add path weight into this cypher? Instead of call gds algo?

## How can I get shortest path after delete some relationships?

I would like to delete some relationships in a graph first, and then find all pair shortest path. Step1: MATCH (n {happy: false})-[r]-() DELETE r Step2: MATCH p=allShortestPaths((h)-[*1..20]->(k {value:true})) How can I combine these two steps in one...
Kudos from