Fix Dijkstra algorithm implementation

[wm55414]

SUMMARY

• The original implementation of Dijkstra algorithm can't go through vertices which have been counted previously. Add priority queue to fix it and modify the algorithm's test as well.

MOTIVATION

• The original implementation of the algorithm is weird. And then I found that issue Dijkstra algorithm not implemented correctly. #386 was not fixed but staled. So I fix it.

CONTENT

1. Add priority queue to track the previous counted vertices distances. Then we can find the minimal distance across all the possible vertices.
2. Remove redundant calculations.
3. Modify the test cases.

• I have performed a self-review of my code
• My code follows the style guidelines of this project
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Comments in areas I changed are up to date
• I have added comments to hard-to-understand areas of my code
• I have made corresponding changes to the README.md

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 95.12%. Comparing base (0184c37) to head (517e1cc).
Report is 1 commits behind head on master.

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #499      +/-   ##
==========================================
- Coverage   95.16%   95.12%   -0.05%     
==========================================
  Files         267      267              
  Lines       10860    10848      -12     
  Branches     1528     1527       -1     
==========================================
- Hits        10335    10319      -16     
- Misses        400      403       +3     
- Partials      125      126       +1     

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

[siriak]

Looks good, thanks!