This makes sense. In the case of directed graph we have a sequence of n*(n-1) bits a we can interpret it as matrix of size n * (n - 1) that is easy to transfer into incidence matrix and have bijection from a bit to an edge.

It is however far more complicated in the undirected case, when we have to translate n * (n-1) /2 sequence to edges. I'm afraid it won't be very clear, but will try to code it.