[ALGO] Dijkstra Shortest Path (Tree Version) (#54)

[joweich]

Please note:

• This is not an exact overload of dijkstra_shortest_path as the syntax proposed in [ALGO] Dijkstra Shortest Path (Tree Version) #54 uses the plural paths.
• There is quite some code duplication between the tree version and the non-tree version. The tree version would be able to cover both with an additional break statement, which is expected to have worse performance though. We could however think of trading some performance for readability and maintainability here.

[codecov]

Codecov Report

Patch coverage: 100.00% and project coverage change: +0.01% 🎉

Comparison is base (18c5a95) 99.80% compared to head (eba68ed) 99.81%.

Additional details and impacted files

@@            Coverage Diff             @@
##             main      #62      +/-   ##
==========================================
+ Coverage   99.80%   99.81%   +0.01%     
==========================================
  Files          22       22              
  Lines        1009     1081      +72     
==========================================
+ Hits         1007     1079      +72     
  Misses          2        2              

Files Changed	Coverage Δ
include/graaflib/algorithm/shortest_path.h	100.00% <ø> (ø)
include/graaflib/algorithm/shortest_path.tpp	100.00% <100.00%> (ø)
test/graaflib/algorithm/shortest_path_test.cpp	100.00% <100.00%> (ø)

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

[bobluppes]

Looks excellent, thanks for picking this up so quickly! Just some minor comments.

Regarding the new function not being an overload, you are correct! I slightly prefer this version with the plural paths, but let me know if you think otherwise.

For the potential performance trade-off that you mentioned, my initial feeling is that it would not be too bad. But maybe let's add a benchmark in a follow-up and we can measure the performance impact.

[bobluppes]

Thanks, looks great!