this post was submitted on 10 May 2024
219 points (97.8% liked)

Programmer Humor

32426 readers
668 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] ReginaPhalange@lemmy.world 1 points 5 months ago

One could make the case that we can transform an k size array to a k-vertex-connected graph

Because traversing from one element to any other element is an O(1) operation using index arithmetics.

Same for n dimensional matrices.