code: public static void bitVectorToEdge(final BitVector bv, final long seed, final int numVertices, final int e[]) {
  		bitVectorToEdge(bv, seed, numVertices, (int)(numVertices * 0xAAAAAAABL >>> 33), e); // Fast division by 3
  	}
docs: Turns a bit vector into a 3-hyperedge.
  
  @param bv a bit vector.
  @param seed the seed for the hash function.
  @param numVertices the number of vertices in the underlying hypergraph.
  @param e an array to store the resulting edge.
  @see #bitVectorToEdge(BitVector, long, int, int, int[])