Consider the following definitions...
a = (c, d)
b = (e, f)
c = (g, h)
d = (i, j)
e = (k, l)
f = (m, n)
I need to compute some kind of product / permutations / combinations, such that I get the following set of tuples. The idea is to compute all possible paths through the dependencies. What should I use here, and how do these types of things generalize, ie I imagine permutations / combinations are types of products so is there a good way to help construct new products that maybe be required?
(a, c, g)
(a, c, h)
(a, d, i)
(a, d, j)
(b, e, k)
(b, e, l)
(b, f, m)
(b, f, n)