Dijkstra shortest path
graph · graph_algorithms
Run Dijkstra's algorithm on a dense graph using tuple adjacency rows.
🏆 Winner
pyvorin-project-venv with a warm median of 2.8079 ms — 4.37x faster than pypy3-system (77.1% quicker)
Adapter Comparison
Latest Results by Adapter
| Adapter | Warm median ms | Warm mean ms | Cold median ms | Success |
|---|---|---|---|---|
| codon-system 🏆 | 0.0000 | 0.0000 | 0.0000 | 0% |
| pyvorin-project-venv | 2.8079 | 3.5664 | 6.8985 | 100% |
| pypy3-system | 12.2588 | 12.3879 | 23.4312 | 100% |
| cpython-system | 80.2616 | 81.9472 | 79.3547 | 100% |
| graalpy-system | 107.0663 | 115.9255 | 230.7115 | 100% |
Trend Series
Recent Snapshots
| Recorded at | Adapter | Parameter set | Warm median ms | Success rate |
|---|---|---|---|---|
| 2026-07-19 12:39:15.317641 | pyvorin-project-venv | small | 2.8079 | 100% |
| 2026-07-19 12:34:20.510486 | pypy3-system | small | 12.2588 | 100% |
| 2026-07-19 12:33:39.088202 | graalpy-system | small | 107.0663 | 100% |
| 2026-07-19 12:30:56.425992 | cpython-system | small | 80.2616 | 100% |
| 2026-07-19 12:29:38.014158 | codon-system | small | 0.0000 | 0% |
| 2026-07-19 09:17:44.678888 | pyvorin-project-venv | small | 2.6449 | 100% |
| 2026-07-19 09:12:59.204674 | pypy3-system | small | 11.8343 | 100% |
| 2026-07-19 09:12:18.904029 | graalpy-system | small | 119.4673 | 100% |
| 2026-07-19 09:08:40.854954 | cpython-system | small | 84.8122 | 100% |
| 2026-07-19 09:05:33.087909 | pypy3-system | small | 12.3111 | 100% |
| 2026-07-19 09:04:52.031185 | graalpy-system | small | 110.5733 | 100% |
| 2026-07-19 09:02:15.152037 | cpython-system | small | 84.0120 | 100% |
| 2026-07-19 09:00:48.994897 | codon-system | small | 0.0000 | 0% |
| 2026-07-19 08:03:32.982889 | pyvorin-project-venv | small | 2.9005 | 100% |
| 2026-07-19 07:56:44.496330 | cpython-system | small | 79.3796 | 100% |