Bellman-Ford algorithm

[John8]

Is it possible to use the Bellman Ford algorithm to calculate the shortest path?

I looked into the shortest path algorithms and saw that Bellman Ford supports negative distances, which is what I would like to use.

I guess Neo4j uses Dijkstra's as default, but Dijkstra's doesn't support negative distances so I wonder if there is a way to use Bellman instead of Dijkstra's .

github.com/neo4j-contrib/neo4j-apoc-procedures

Add algorithms

opened 12:53AM - 21 Aug 16 UTC

closed 03:26PM - 15 Jun 19 UTC

jexp

enhancement

- [ ] k-means (for top-n) - [ ] edge betweenness - [ ] Bellman-Ford algorithm -… [ ] approximation of the Chromatic Number of a graph - [ ] approximation of Hamiltonian cycle - [ ] min cut - [ ] community detection: louvain, walk trap, infomap, label propagation

I saw this post on github from 2016 saying it would add the Bellman-Ford algorithm, but I don't know if it was implemented.
I searched the apoc documentation but there is nothing about Bellman-Ford.

Thanks,

[david_allen]

Unfortunately Bellman-Ford isn't available. The GDS package supports A* and Yen, but disclosure, they both only support positive weights.

Neo4j Graph Data Platform

Path finding - Neo4j Graph Data Science

This chapter provides explanations and examples for each of the path finding algorithms in the Neo4j Graph Data Science library.

In your situation, I would consider normalizing your negative weights to positive numbers and then using your choice of the available options in the link above.