[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
| 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Permutation {
|
---|
| 29 | public class RandomPermutationGenerator : OperatorBase {
|
---|
| 30 | public override string Description {
|
---|
| 31 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 32 | }
|
---|
| 33 |
|
---|
| 34 | public RandomPermutationGenerator()
|
---|
| 35 | : base() {
|
---|
| 36 | AddVariableInfo(new VariableInfo("Length", "Permutation length", typeof(IntData), VariableKind.In));
|
---|
| 37 | AddVariableInfo(new VariableInfo("Random", "Pseudo random number generator", typeof(IRandom), VariableKind.In));
|
---|
| 38 | AddVariableInfo(new VariableInfo("Permutation", "Created random permutation", typeof(Permutation), VariableKind.New));
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | public static int[] Apply(IRandom random, int length) {
|
---|
| 42 | int[] perm = new int[length];
|
---|
| 43 |
|
---|
| 44 | for (int i = 0; i < length; i++)
|
---|
| 45 | perm[i] = i;
|
---|
| 46 |
|
---|
| 47 | // Knuth shuffle
|
---|
| 48 | int index, tmp;
|
---|
| 49 | for (int i = 0; i < length - 1; i++) {
|
---|
| 50 | index = random.Next(i, length);
|
---|
| 51 | tmp = perm[i];
|
---|
| 52 | perm[i] = perm[index];
|
---|
| 53 | perm[index] = tmp;
|
---|
| 54 | }
|
---|
| 55 | return perm;
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | public override IOperation Apply(IScope scope) {
|
---|
| 59 | IRandom random = GetVariableValue<IRandom>("Random", scope, true);
|
---|
| 60 | IntData length = GetVariableValue<IntData>("Length", scope, true);
|
---|
| 61 |
|
---|
| 62 | int[] perm = Apply(random, length.Data);
|
---|
[77] | 63 | scope.AddVariable(new Variable(scope.TranslateName("Permutation"), new Permutation(perm)));
|
---|
[2] | 64 |
|
---|
| 65 | return null;
|
---|
| 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|