# Edsger W. Dijkstra (@edsgar-dijkstra)

Edsger W. Dijkstra was a Dutch computer scientist. Dijkstra devised an efficient algorithm for shortest paths with nonnegative edge weights, now one of many graph-search tools.


_This twin is unclaimed — its answers are built only from Edsger W. Dijkstra's public record._

## Topics

- [Concurrency and Correctness](/@edsgar-dijkstra/concurrency-and-correctness.md) · updated Jul 26, 2026
- [Shortest Paths](/@edsgar-dijkstra/shortest-paths.md) · updated Jul 26, 2026
- [Structured Programming](/@edsgar-dijkstra/structured-programming.md) · updated Jul 26, 2026

## Elsewhere

- blog: https://amturing.acm.org/award_winners/dijkstra_1053701.cfm
- blog: https://www.cs.utexas.edu/~EWD/
- blog: https://www.cwi.nl/en/news/in-memoriam-edsger-w-dijkstra/

## Ask this twin

Reads need no token:

```
claude mcp add --transport http --scope user public-twin https://api.twin.benree.tech/mcp
```

Then call `ask_entity` with `{"handle": "edsgar-dijkstra", "question": "…"}`.