-
The bellman_ford shortest path function doesn't return an error when called with a negative weight cycle even though this means the output is incorrect.
It should throw an error in this case.
-
Everything is happening under `~/jellyfish/pox/pox/ext`. From here, you can run the command:
`sudo python build_topology.py -c starter -t jelly -display` from inside the VM. If you follow the log…
-
Passing NaNs as weights will cause some functions to crash, see e.g. https://github.com/igraph/rigraph/issues/415
Functions which can't handle NaNs should check the weight vector for NaNs, and repo…
-
I have a 3 nodes named A, B, and C with connections between A->B, A->C and B->C; however, when I run BFS it only returns the connection between A and C `(m {name: "A"})-[r *BFS 1..2]->(n {name: "C"} )…
-
In functions that take a single vertex ID as a parameter (instead of a vertex sequence), negative IDs, which should be invalid, are often handled in a strange way. Take for example `shortest_paths()`:…
-
Defect Description:
In the simulation page of the "Shortest Paths in Graphs" experiment, after displaying the result when we click on the Instructions button the nothing is displayed on the screen whe…
-
This is a repost of [this issue](https://github.com/sbromberger/LightGraphs.jl/issues/1584) on the old repo.
---
Hi,
This is a follow up of [this discussion](https://discourse.julialang.org/t/h…
-
I have been using `r_c_shortest_paths` for a while, and recently because of a code refactoring I realised that one of the template parameters, namely `EdgeIndexMap`, seems not to be used anywhere in `…
-
Currently if we would like to find the weighted shortest path between two nodes, we have to use the following query (there is a LabelPropertyIndex on `:TOPIC(title)`):
```
memgraph> EXPLAIN MATCH (a…
-
While looking at the fix of #98, I noticed the following bug: In Dijkstra.cpp we optionally count the number of shortest paths to all nodes. We do this by checking
```
distances[v] == distances[u…