As I was walking through my university's mathematics department, I came across a poster pinned to the notice board. Underneath, it simply said 'In memory'. However, I could not connect the poster to the person it celebrated; because there was no name in sight! I'm sure you can help me, though...


Well? Whom does it commemorate?


Each of the four diagrams with letters

can almost be rearranged to have the form at the top

but in each case

one edge of the graph -- one connection between letters -- is missing.

These are, respectively,

D-I, J-K, S-T, and R-A

so this is a memorial to

Edsger Dijkstra.

I expect it was constructed using graphs because

some of Dijkstra's most famous work involves algorithms operating on graphs. (Most importantly, his shortest-path-finding algorithm.)

| improve this answer | |
  • $\begingroup$ Fantastic detective work =) $\endgroup$ – Tryth Nov 6 '16 at 10:39
  • $\begingroup$ Thanks. I liked this puzzle a lot. Short but sweet. $\endgroup$ – Gareth McCaughan Nov 6 '16 at 10:40

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.