Coding puzzle

Well, more of a decision puzzle in code
current source - https://bit.ly/2qbkfxZ

For a given integer vector, there is a bit of a decision problem of which set of edge-bins to store(?) the vector in, that will be relatively optimal over a list of such vectors.

Ex. 0xff becomes the vector (16, 16), and could be stored as edgebin[x][16, 16] = true for some choice of x.

>>7
So at the core of the program currently are these boolean matrixes that capture the edges between nodes in a data vector

[data_id] | [column_a] | [column_b] | [column_c]
1 | category 5 | category 2 | category 1 - (data vec with edges a5-b2 and b2-c1, column a node cat 5, column b node cat 2, col c cat 1)

{x=1
[boolean matrix m * n (col a:b)]
[5,2] = true;

[boolean matrix n * m2 (col b:c)]
[2,1] = true;
}

for retrieval it still probably needs the first entry, column a cat 5, plus some data for the x>1 / alternates