1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment.Common {
|
---|
27 | public static class ExtensionMethods {
|
---|
28 | #region Graph walk
|
---|
29 | /// <summary>
|
---|
30 | /// Walks an operator graph in that it jumps from one operator to all its operator parameters and yields each operator it touches.
|
---|
31 | /// Cycles are detected and not walked twice.
|
---|
32 | /// </summary>
|
---|
33 | /// <param name="initial">The operator where the walk starts (is also yielded).</param>
|
---|
34 | /// <returns>An enumeration of all the operators that could be found.</returns>
|
---|
35 | public static IEnumerable<IOperator> Walk(this IOperator initial) {
|
---|
36 | var open = new Stack<IOperator>();
|
---|
37 | var visited = new HashSet<IOperator>();
|
---|
38 | open.Push(initial);
|
---|
39 |
|
---|
40 | while (open.Any()) {
|
---|
41 | IOperator current = open.Pop();
|
---|
42 | if (visited.Contains(current)) continue;
|
---|
43 | visited.Add(current);
|
---|
44 |
|
---|
45 | foreach (var parameter in current.Parameters.OfType<IValueParameter>()) {
|
---|
46 | if (typeof(IOperator).IsAssignableFrom(parameter.DataType)) {
|
---|
47 | if (parameter.Value != null)
|
---|
48 | open.Push((IOperator)parameter.Value);
|
---|
49 | }
|
---|
50 | }
|
---|
51 |
|
---|
52 | yield return current;
|
---|
53 | }
|
---|
54 | }
|
---|
55 | #endregion
|
---|
56 | }
|
---|
57 | }
|
---|