Unify Dijkstra on the efficient priority-queue implementation

[DenizAltunkapan]

Description

Under datastructures/graphs/ there are two Dijkstra variants:

• DijkstraAlgorithm.java
• DijkstraOptimizedAlgorithm.java

Keeping a naive O(V²) version alongside an "optimized" one is mostly a maintenance burden. For an educational repo it is clearer to expose one correct, efficient implementation: the priority-queue based version running in O((V + E) log V).

Proposed change

• Keep a single Dijkstra implementation based on a PriorityQueue.
• If the naive version is kept for teaching purposes, document explicitly why both exist and how they differ in complexity, instead of leaving two near-identical classes side by side.

Related

Companion to #7454, which removes the misplaced third copy in others/.

[priyanshuvishwakarma273403]

Hi @maintainer,
I would like to work on this issue. Could you please assign it to me?

[priyanshuvishwakarma273403]

Hi maintainers,

I have really enjoyed contributing to this project and learning from the community. I would like to become a more active contributor and help with development, documentation, issue triage, and community support whenever possible.

If there is a contributor program, community team, or any pathway toward greater involvement within the organization, I would be grateful for the opportunity to participate.

Thank you for maintaining this amazing project. I look forward to contributing more.

[priyanshuvishwakarma273403]

hi @DenizAltunkapan kindly review this pull request
thank you!