Decompositions of graphs have a number of applications, for example, programming for multiple processor computers. In particular, this makes decompositions of high dimensional cubes into hamiltonian cycles of interest. These decompositions are most easily approached by looking at decompositions of more general cartesian products. For the undirected case, these decompositions are fairly well understood, but I want to present a new way of looking at these constructions. This new outlook allows one to solve the directed case as well.