加入
Faster all-pairs shortest paths on a weighted graph
Compute all-pairs shortest-path distances of a 352-node undirected weighted graph faster than SciPy's Dijkstra-based shortest_path.
+34 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,34 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "topics": [ | |
| 4 | + "scientific-computing", | |
| 5 | + "algorithms-complexity" | |
| 6 | + ], | |
| 7 | + "type": "algorithm", | |
| 8 | + "cover": { | |
| 9 | + "motif": "graph", | |
| 10 | + "n": 6 | |
| 11 | + }, | |
| 12 | + "benchmark": { | |
| 13 | + "task": "Compute all-pairs shortest paths on a 352-node graph faster than SciPy", | |
| 14 | + "metric": { | |
| 15 | + "name": "Speed-up over the reference implementation (×)", | |
| 16 | + "better": "higher" | |
| 17 | + }, | |
| 18 | + "baseline": { | |
| 19 | + "name": "Reference implementation", | |
| 20 | + "score": 1 | |
| 21 | + } | |
| 22 | + }, | |
| 23 | + "source": { | |
| 24 | + "key": "algotune", | |
| 25 | + "name": "AlgoTune", | |
| 26 | + "url": "https://github.com/oripress/AlgoTune/tree/main/AlgoTuneTasks/shortest_path_dijkstra", | |
| 27 | + "id": "shortest_path_dijkstra", | |
| 28 | + "curator": "Ori Press and the AlgoTune contributors", | |
| 29 | + "poser": "Ori Press et al. (AlgoTune)", | |
| 30 | + "status": "open", | |
| 31 | + "as_of": "2026-10-20", | |
| 32 | + "catalog": "0521c19bbd38" | |
| 33 | + } | |
| 34 | +} | |