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.
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.
Ohhh a stack that is 4 callback deep, are you running java on a potato?
No taxation without approximation!