Dijkstra shortest paths

Shortest paths from one source over a 10k-node sparse graph using a binary heap.

Runtime · median per inner-loop window

median of 7 runs

Native Gocompiled

5.11 ms0.08×

Pipitbytecode VM

65.1 msbaseline

CPython 3.14bytecode VM

84.4 ms1.30×

PyPy 7.3tracing JIT

42.3 ms0.65×

Ttengobytecode VM

125 ms1.92×

Sscriggobytecode VM

150 ms2.31×

Mmvmbytecode VM

177 ms2.72×

YyaegiAST walker

228 ms3.51×

Runner	N	Compile	Runtime	P95	Stddev	RSS	vs pipit	Status
Native Gocompiled	7	109 ms	5.11 ms	5.27 ms	91.6 µs	1.62 GiB	0.08×	OK
Pipitbytecode VM	7	2.22 ms	65.1 ms	67.4 ms	809 µs	591 MiB	1.00×	OK
CPython 3.14bytecode VM	7	655 µs	84.4 ms	87.9 ms	1.75 ms	n/a	1.30×	OK
PyPy 7.3tracing JIT	7	497 µs	42.3 ms	43.3 ms	883 µs	n/a	0.65×	OK
tengobytecode VM	7	331 µs	125 ms	150 ms	9.07 ms	1.68 GiB	1.92×	OK
scriggobytecode VM	7	742 µs	150 ms	174 ms	12.2 ms	1.68 GiB	2.31×	OK
mvmbytecode VM	7	604 µs	177 ms	178 ms	826 µs	1.68 GiB	2.72×	OK
yaegiAST walker	7	565 µs	228 ms	275 ms	20.7 ms	1.68 GiB	3.51×	OK

Workload & symmetry rules

Workload

A 10,000-node directed graph with ~5 edges per node and integer weights 1..100. Dijkstra from node 0. Print the sum of all reachable distances.

Source code