[14678] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2017 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.Linq;
|
---|
[16958] | 25 | using HEAL.Attic;
|
---|
[14678] | 26 | using HeuristicLab.Common;
|
---|
| 27 | using HeuristicLab.Core;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Analysis.FitnessLandscape {
|
---|
| 30 | [Item("Directed Path", "")]
|
---|
[16958] | 31 | [StorableType("4FD1A99C-7858-4AB9-916F-FEE00B4FD66D")]
|
---|
[14678] | 32 | public class DirectedPath<T> : Item where T : class, IDeepCloneable {
|
---|
| 33 | [Storable]
|
---|
| 34 | private List<List<Tuple<T, double>>> paths;
|
---|
| 35 | public IEnumerable<List<Tuple<T, double>>> Paths {
|
---|
| 36 | get { return paths ?? new List<List<Tuple<T, double>>>(); }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
| 39 | [StorableConstructor]
|
---|
[16958] | 40 | protected DirectedPath(StorableConstructorFlag _) : base(_) { }
|
---|
[14678] | 41 | protected DirectedPath(DirectedPath<T> original, Cloner cloner)
|
---|
| 42 | : base(original, cloner) {
|
---|
| 43 | if (original.paths != null)
|
---|
| 44 | paths = original.paths.Select(x => x.Select(y => Tuple.Create(cloner.Clone(y.Item1), y.Item2)).ToList()).ToList();
|
---|
| 45 | }
|
---|
| 46 | public DirectedPath() { }
|
---|
| 47 |
|
---|
| 48 | public bool IsEmpty {
|
---|
| 49 | get { return paths == null || paths.Count == 0; }
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | public void AddPath(IEnumerable<Tuple<T, double>> path) {
|
---|
| 53 | if (paths == null) paths = new List<List<Tuple<T, double>>>();
|
---|
| 54 | paths.Add(path.ToList());
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 58 | return new DirectedPath<T>(this, cloner);
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | }
|
---|