|
|
Re: generation of random multiset permutation with restrictions
Posted:
Aug 21, 2012 6:51 AM
|
|
"Bruno Luong" <b.luong@fogale.findmycountry> wrote in message <k0visb$hog$1@newscl01ah.mathworks.com>...
> This should work for standard array p:
>
> OK = @(p) isequal(sort(a),sort(p)) && all(arrayfun(@(x,s) ismember(x,s{1}),p,s));
>
> % Bruno
Your solution is very elegant and effective. Thanks again!
Is there any reason to completely eliminate cells (e.g. s = {[3],[1,2],[1,2,3],[1,2,3],[1,2,3],[1,2,3],[2,3],[2,3]};) from the numerical intensive computation and work only with standard arrays? OK function (and previous method for generation of random multiset permutation with restrictions) will be called very often (about 10^3-10^6 times), so I am looking for fastest method as possible.
|
|
