Dijkstra Needs the Shortest Path
Bae: Come over Dijkstra: But there are so many possible paths and I don’t know which is the shortest. Bae: My parents aren’t home Dijkstra: Dijkstra's algorithm Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Wikipedia Data structure: Graph Class: Search algorithm
A text-based reaction meme shows someone named Dijkstra hesitating to visit because there are too many possible paths and he cannot determine the shortest one. When told that the parents are not home, the punchline is a search result about Dijkstra’s algorithm, which finds shortest paths in graphs. It is used as a nerdy reaction to overthinking a simple invitation or taking a joke literally.
text message exchange / текстовый диалогcomputer science screenshot / скриншот по информатикеgraph diagram / диаграмма графаnodes / узлыconnecting lines / соединяющие линииnumbers on graph edges / числа на рёбрах графаGoogle Images result / результат Google КартинокWikipedia article / статья Википедииalgorithm description / описание алгоритмаshare icon / значок поделиться
- @profunctor_io / 1477 2018-11-20
- @ithueti / 2274 2020-04-12
- Type
- image
- Size
- 688×800 · 92.6 KiB
- Mood
- nerdy, absurd
- Language
- en
- Added