{
  "domain": "computer-science",
  "topics": [
    "scientific-computing",
    "algorithms-complexity"
  ],
  "type": "algorithm",
  "cover": {
    "motif": "graph",
    "n": 6
  },
  "benchmark": {
    "task": "Compute all-pairs shortest paths on a 352-node graph faster than SciPy",
    "metric": {
      "name": "Speed-up over the reference implementation (×)",
      "better": "higher"
    },
    "baseline": {
      "name": "Reference implementation",
      "score": 1
    }
  },
  "source": {
    "key": "algotune",
    "name": "AlgoTune",
    "url": "https://github.com/oripress/AlgoTune/tree/main/AlgoTuneTasks/shortest_path_dijkstra",
    "id": "shortest_path_dijkstra",
    "curator": "Ori Press and the AlgoTune contributors",
    "poser": "Ori Press et al. (AlgoTune)",
    "status": "open",
    "as_of": "2026-10-20",
    "catalog": "0521c19bbd38"
  },
  "review": true,
  "approval": "first-time"
}