231
submitted 1 year ago* (last edited 1 year ago) by [email protected] to c/[email protected]
you are viewing a single comment's thread
view the rest of the comments
[-] [email protected] 1 points 1 year 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.

this post was submitted on 10 May 2024
231 points (97.9% liked)

Programmer Humor

36796 readers
297 users here now

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

Rules:

founded 5 years ago
MODERATORS