[Numpy-discussion] Extracting all the possible combinations of a grid
Fri Sep 21 14:19:59 CDT 2007
I want to generate all the possible triplets of integers in [0, n]. I am
wondering want the best possible way to do this is.
To make things clearer, I could generate i, j, k using indices:
i, j, k = indices((n, n, n))
But I will have several times the same triplet with different ordenings.
I am looking for a loop-free way of creating three arrays i, j, k with
all the triplets present once, and only once.
Any hint appreciated.
PS: I am having problems with my mail, so excuse me if this is a dup
More information about the Numpy-discussion