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