Description
Dijkstra's shortest-path algorithm is currently implemented three times:
The copy in others/ is also misplaced — graph algorithms belong under datastructures/graphs/.
Proposed change
- Remove the duplicate in
others/ (keeping its tests/edge cases if they add coverage).
- Keep a single canonical Dijkstra under
datastructures/graphs/.
Note: the choice between the "Algorithm" and "Optimized" variants is tracked separately in a companion issue about unifying on the efficient priority-queue implementation.
Description
Dijkstra's shortest-path algorithm is currently implemented three times:
others/Dijkstra.javadatastructures/graphs/DijkstraAlgorithm.javadatastructures/graphs/DijkstraOptimizedAlgorithm.javaThe copy in
others/is also misplaced — graph algorithms belong underdatastructures/graphs/.Proposed change
others/(keeping its tests/edge cases if they add coverage).datastructures/graphs/.