final cost of the Minimum Spanning Tree

[LeneesLauju]

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 0% with 43 lines in your changes missing coverage. Please review.

Project coverage is 62.61%. Comparing base (7326ab2) to head (a09c02d).
Report is 2 commits behind head on master.

Files with missing lines	Patch %	Lines
...healgorithms/datastructures/graphs/PriMincost.java	0.00%	43 Missing ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5713      +/-   ##
============================================
- Coverage     62.77%   62.61%   -0.17%     
+ Complexity     4025     4024       -1     
============================================
  Files           565      566       +1     
  Lines         15939    15982      +43     
  Branches       3076     3079       +3     
============================================
+ Hits          10006    10007       +1     
- Misses         5521     5563      +42     
  Partials        412      412              

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