-
-
Dijsktra's shortest paths takes as parameter UTIL/OUT a color_map. Which should be passed to and used by breadth first search.
However, the current implementation ignores the color_map, if provided, …
-
https://github.com/SkienaBook/Algorithm-Design-Manual-Programs-V3/blob/9bdfcc0203956c354cfc9715559a8671a73684cb/dijkstra.c#L36-L81
The algorithm returns `weight`. Now nowhere in the book is clarifi…
-
To be added somewhere on the documentation (maybe the result page it self). Also open to discussion for modification.
Relevance score is computed buy search api full text. In short it allows to searc…
-
### Describe the project you are working on
Encountered this problem in 2 of my projects already.
### Describe the problem or limitation you are having in your project
Given a large enough world (…
-
It would be nice to use Graphhopper to calulate a distance matrix (or Origin / Destination) matrix from a list of nodes.
This is useful for route optimization.
Either by repetitive use of one-to-all…
-
### Describe the project you are working on
Just reopening, in the GIP tracker, an old proposal that was closed in the main tracker with the migration to the GIP tracker.
I have conducted a sear…
-
650 Mil edge graph with sssp solve on eight-GPUs (K80 of 12 Gb each)
Here is the run:
Partition begin. seed=1534366464
partition end. (24592.999935 ms)
[../gunrock/util/array_utils.cuh, 209 @ gp…
-
We tend to be pretty conservative and avoid splitting payments quite a bit. That's fine, but we can probably be a bit smarter about when we split. Once we land #1227 we can maybe also adapt the scorin…
-
### What would you like to share?
Shortest Path Algorithm (Dijsktra) using Priority Queue (C++)
### Additional information
_No response_