[5838] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5838] | 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;
|
---|
[6342] | 23 | using System.Collections.Generic;
|
---|
[5838] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
| 30 | [Item("ExhaustiveSwap2MoveGenerator", "Generates all possible swap-2 moves from a given permutation.")]
|
---|
| 31 | [StorableClass]
|
---|
| 32 | public class ExhaustiveSwap2MoveGenerator : Swap2MoveGenerator, IExhaustiveMoveGenerator {
|
---|
| 33 | [StorableConstructor]
|
---|
| 34 | protected ExhaustiveSwap2MoveGenerator(bool deserializing) : base(deserializing) { }
|
---|
| 35 | protected ExhaustiveSwap2MoveGenerator(ExhaustiveSwap2MoveGenerator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 36 | public ExhaustiveSwap2MoveGenerator() : base() { }
|
---|
| 37 |
|
---|
| 38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 39 | return new ExhaustiveSwap2MoveGenerator(this, cloner);
|
---|
| 40 | }
|
---|
| 41 |
|
---|
[6342] | 42 | public static IEnumerable<Swap2Move> Generate(Permutation permutation) {
|
---|
[5838] | 43 | int length = permutation.Length;
|
---|
| 44 | if (length == 1) throw new ArgumentException("ExhaustiveSwap2MoveGenerator: There cannot be an Swap move given a permutation of length 1.", "permutation");
|
---|
| 45 |
|
---|
[5931] | 46 | for (int i = 0; i < length - 1; i++)
|
---|
| 47 | for (int j = i + 1; j < length; j++) {
|
---|
[6342] | 48 | yield return new Swap2Move(i, j);
|
---|
[5838] | 49 | }
|
---|
[6342] | 50 | }
|
---|
| 51 |
|
---|
| 52 | public static Swap2Move[] Apply(Permutation permutation) {
|
---|
| 53 | int length = permutation.Length;
|
---|
| 54 | int totalMoves = (length) * (length - 1) / 2;
|
---|
| 55 | Swap2Move[] moves = new Swap2Move[totalMoves];
|
---|
| 56 | int count = 0;
|
---|
| 57 | foreach (Swap2Move move in Generate(permutation)) {
|
---|
| 58 | moves[count++] = move;
|
---|
| 59 | }
|
---|
[5838] | 60 | return moves;
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | protected override Swap2Move[] GenerateMoves(Permutation permutation) {
|
---|
| 64 | return Apply(permutation);
|
---|
| 65 | }
|
---|
| 66 | }
|
---|
| 67 | }
|
---|