Graph algorithm

[Amit-Verma5262]

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

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 95.65217% with 1 line in your changes missing coverage. Please review.

Project coverage is 72.43%. Comparing base (5e9d1dc) to head (e3539fc). Report is 3 commits behind head on master.

Files with missing lines	Patch %	Lines
.../com/thealgorithms/graph/DijkstraShortestPath.java	95.65%	0 Missing and 1 partial :warning:

Additional details and impacted files

```diff @@ Coverage Diff @@ ## master #6060 +/- ## ============================================ + Coverage 72.38% 72.43% +0.04% - Complexity 4982 4983 +1 ============================================ Files 653 654 +1 Lines 17574 17597 +23 Branches 3386 3390 +4 ============================================ + Hits 12721 12746 +25 + Misses 4372 4371 -1 + Partials 481 480 -1 ```

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[siriak]

It's already implemented here https://github.com/TheAlgorithms/Java/blob/d1c1e6b4d251988e784bdab80e46ba4bfd531b02/src/main/java/com/thealgorithms/datastructures/graphs/DijkstraAlgorithm.java#L8