Tests & Thread safe dijkstra

[sidml]

@ZigRazor
Should partially address concerns raised in #88
As discussed earlier, the trick is to explicitly use Graph implementation instead of Graph_TS for functions like getNodeSet, getAdjMatrix. I have made changes for dijkstra's algorithm right now.
If this approach is okay, I will make changes in other algorithms as well.

[ghost]

Changes to your CodeSee Architecture Map:

View this PR diagram as an interactive map

View more CodeSee Maps

Legend

[codecov-commenter]

Codecov Report

Merging #93 (6b9b83a) into master (e95bdc8) will increase coverage by 0.03%.
The diff coverage is 100.00%.

@@            Coverage Diff             @@
##           master      #93      +/-   ##
==========================================
+ Coverage   95.76%   95.80%   +0.03%     
==========================================
  Files          36       36              
  Lines        3593     3623      +30     
==========================================
+ Hits         3441     3471      +30     
  Misses        152      152              

Flag	Coverage Δ
unittests	95.80% <100.00%> (+0.03%)	⬆️

Flags with carried forward coverage won't be shown. Click here to find out more.

Impacted Files	Coverage Δ
include/Graph/Graph.hpp	97.67% <100.00%> (ø)
test/DijkstraTest.cpp	100.00% <100.00%> (ø)
include/Partitioning/HDRF.hpp	71.26% <0.00%> (-5.75%)	⬇️
include/Graph/Graph_TS.hpp	27.17% <0.00%> (+5.43%)	⬆️

---

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update e95bdc8...6b9b83a. Read the comment docs.

[ZigRazor]

@sidml i think it is the right approch, in any case the graph is locked so no critical sections can be touched

[sidml]

This PR should now also address issues:

• Introduce Tests for Thread-Safe Floyd-Warshall algorithm #78
• Introduce Tests for Thread-Safe Bellman-Ford algorithm  #75

@ZigRazor Please review & merge.