| Author |
Comment/Response |
toen
|
 09/28/10 12:25pm
g'day,
Try taking a canonical representative of each possible permutation. The built-in Sort function is an obvious candidate for this.
Entries are then easy to compare, e.g
Union[{{1,2,3}, {3,2,1}, {4,3,1}, {2,2,3}, {2,3,1}},Sametest->(Sort[#1]==Sort[#2]&)
cheers,
toen
URL: , |
|
