fully implemented (but there's a bug)
fully implemented (but there's a bug)

namely, on the Eppstein example, the first four allegedly shortest
paths (from 1 to 12) are given as having weights 55 58 64 68.
those paths do exists, but there are others that should be in between
those, e.g., 59

tjanson/rea