Skip to content

Consolidate the three Dijkstra implementations and remove the misplaced copy in others/ #7454

Description

@DenizAltunkapan

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.

Metadata

Metadata

Assignees

Labels

Type

No type

Fields

No fields configured for issues without a type.

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions