Implemented a "th" cost function that makes Dijkstra search like A*
Implemented a "th" cost function that makes Dijkstra search like A*

Turns out A*-stagger is the best approach so far for this benchmark!
Could probably be made a bit faster by specializing away log-cloning,
lexical priorities, etc.

JoeOsborn/hyped,JoeOsborn/hyped