Shortest Path Between Two Nodes
WHEN YOU DON'T UNDERSTAND WHY A PATH IS THE SHORTEST BETWEEN TWO NODES IN A CONNECTED GRAPH Probably shouldn't ask, but... Dijkstra, how the hell do you know all this?
Geralt of Rivia stands in a bright fantasy city while asking Dijkstra how he knows the shortest path between two nodes in a connected graph. The joke combines a computer science concept with Geralt’s in-game dialogue, making it a reaction to confusing or seemingly magical technical knowledge.
white-haired man / беловолосый мужчинаblack and red armor / чёрно-красные доспехиtwo swords / два мечаsilver wolf medallion / серебряный медальон с волкомfantasy city / фэнтезийный городwooden ship / деревянный корабльharbor / гаваньbuildings / зданияwater / водаsky / небоgraph theory reference / отсылка к теории графов
- @profunctor_io / 3937 2020-01-27
- Type
- image
- Size
- 800×450 · 85.1 KiB
- Mood
- confused, sarcastic
- Language
- en
- Added
