xkcd.reader inoffiziell · kein Affiliate
← zurück weiter → aktuell zufällig
? 2036 / 3264 22.8.2018

Edgelord

If you study graphs in which edges can link more than two nodes, you're more properly called a hyperedgelord.
Alt-Text (der eigentliche Witz)
If you study graphs in which edges can link more than two nodes, you're more properly called a hyperedgelord.
xkcd von Randall Munroe – Original auf xkcd.com CC BY-NC 2.5