Verify Routes from Dijkstras Algorithm

[MoKob]

Background

The merge of #11 introduces Dijkstras algorithm to compute shortest paths. So far the testing only covers the general progress of the algorithm.

Aim

To improve the quality of the test-suite, the verification should also analyze the full path (and distances) to verify unpacking / path-search.

Tasks

• test edges along path
• test weights along path
• test offsets and their influence on shortest paths

All tasks should cover both the single source, single target and the the multi-source, multi-target version of the algorithms.