## EnglishEdit

### EtymologyEdit

After its developer Edsger W. Dijkstra.

### PronunciationEdit

### NounEdit

**Dijkstra's algorithm** (*uncountable*)

- (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.

After its developer Edsger W. Dijkstra.

**Dijkstra's algorithm** (*uncountable*)

- (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.