|
| 1 | +using System; |
| 2 | +using System.Collections.Generic; |
| 3 | +using System.Collections.Specialized; |
| 4 | +using System.Linq; |
| 5 | +using System.Text; |
| 6 | +using System.Threading.Tasks; |
| 7 | + |
| 8 | +namespace AnalyticHierarchyProcess |
| 9 | +{ |
| 10 | + // Class responsible for AHP structure |
| 11 | + [Serializable] |
| 12 | + internal class AHP |
| 13 | + { |
| 14 | + public Node Goal { get; } |
| 15 | + public List<Node> Criteria { get; } = new(); |
| 16 | + public List<Node> Subcriteria { get; } = new(); |
| 17 | + public List<Node> Alternatives { get; } = new(); |
| 18 | + |
| 19 | + public AHP(string goal) |
| 20 | + { |
| 21 | + Goal = new Node(goal); |
| 22 | + } |
| 23 | + |
| 24 | + public void AddCriterion(string criterion) |
| 25 | + { |
| 26 | + Node newCriterion = new Node(criterion); |
| 27 | + Goal.AddChild(newCriterion); |
| 28 | + Criteria.Add(newCriterion); |
| 29 | + } |
| 30 | + |
| 31 | + public void AddSubcriterion(string criterion, string subcriterion) |
| 32 | + { |
| 33 | + Node newSubcriterion = new Node(subcriterion); |
| 34 | + foreach (Node node in Criteria) |
| 35 | + { |
| 36 | + if (node.Name == criterion) |
| 37 | + { |
| 38 | + node.AddChild(newSubcriterion); |
| 39 | + } |
| 40 | + } |
| 41 | + Subcriteria.Add(newSubcriterion); |
| 42 | + } |
| 43 | + |
| 44 | + public void AddAlternative(string alternative) |
| 45 | + { |
| 46 | + Node newAlternative = new Node(alternative); |
| 47 | + foreach (Node node in Subcriteria) |
| 48 | + { |
| 49 | + node.AddChild(newAlternative); |
| 50 | + } |
| 51 | + Alternatives.Add(newAlternative); |
| 52 | + } |
| 53 | + |
| 54 | + public void FinalizeStructure() |
| 55 | + { |
| 56 | + foreach (Node criterion in Criteria) |
| 57 | + { |
| 58 | + if (criterion.Children.Count == 0) |
| 59 | + { |
| 60 | + foreach (Node alternative in Alternatives) |
| 61 | + { |
| 62 | + criterion.AddChild(alternative); |
| 63 | + } |
| 64 | + } |
| 65 | + } |
| 66 | + } |
| 67 | + |
| 68 | + public void UpdateAllPriorities() |
| 69 | + { |
| 70 | + Goal.Priority = 1.0; |
| 71 | + foreach (Node criterion in Criteria) |
| 72 | + { |
| 73 | + criterion.Priority = 0.0; |
| 74 | + } |
| 75 | + foreach (Node subcriterion in Subcriteria) |
| 76 | + { |
| 77 | + subcriterion.Priority = 0.0; |
| 78 | + } |
| 79 | + foreach (Node alternative in Alternatives) |
| 80 | + { |
| 81 | + alternative.Priority = 0.0; |
| 82 | + } |
| 83 | + |
| 84 | + Goal.PropagatePriority(); |
| 85 | + foreach (Node criterion in Criteria) |
| 86 | + { |
| 87 | + criterion.PropagatePriority(); |
| 88 | + } |
| 89 | + foreach (Node subcriterion in Subcriteria) |
| 90 | + { |
| 91 | + subcriterion.PropagatePriority(); |
| 92 | + } |
| 93 | + } |
| 94 | + |
| 95 | + public void ResetNodes() |
| 96 | + { |
| 97 | + ResetNode(Goal); |
| 98 | + foreach (Node criterion in Criteria) |
| 99 | + { |
| 100 | + ResetNode(criterion); |
| 101 | + } |
| 102 | + foreach (Node subcriterion in Subcriteria) |
| 103 | + { |
| 104 | + ResetNode(subcriterion); |
| 105 | + } |
| 106 | + foreach (Node alternative in Alternatives) |
| 107 | + { |
| 108 | + ResetNode(alternative); |
| 109 | + } |
| 110 | + } |
| 111 | + |
| 112 | + private void ResetNode(Node node) |
| 113 | + { |
| 114 | + node.Priority = 0.0; |
| 115 | + for (int i = 0; i < node.Children.Count; i++) |
| 116 | + { |
| 117 | + for (int j = 0; j < node.Children.Count; j++) |
| 118 | + { |
| 119 | + if (i == j) |
| 120 | + { |
| 121 | + node.Matrix[i, j] = 1.0; |
| 122 | + } else |
| 123 | + { |
| 124 | + node.Matrix[i, j] = 0.0; |
| 125 | + } |
| 126 | + } |
| 127 | + } |
| 128 | + } |
| 129 | + |
| 130 | + public List<Node> GetAllNodes() |
| 131 | + { |
| 132 | + List<Node> result = new(); |
| 133 | + |
| 134 | + result.Add(Goal); |
| 135 | + foreach (Node criterion in Criteria) |
| 136 | + { |
| 137 | + result.Add(criterion); |
| 138 | + } |
| 139 | + foreach (Node subcriterion in Subcriteria) |
| 140 | + { |
| 141 | + result.Add(subcriterion); |
| 142 | + } |
| 143 | + foreach (Node alternative in Alternatives) |
| 144 | + { |
| 145 | + result.Add(alternative); |
| 146 | + } |
| 147 | + |
| 148 | + return result; |
| 149 | + } |
| 150 | + |
| 151 | + public string GetGoalName() |
| 152 | + { |
| 153 | + return Goal.Name; |
| 154 | + } |
| 155 | + |
| 156 | + public List<string> GetCriterionNames() |
| 157 | + { |
| 158 | + List<string> result = new(); |
| 159 | + |
| 160 | + foreach (Node criterion in Criteria) |
| 161 | + { |
| 162 | + result.Add(criterion.Name); |
| 163 | + } |
| 164 | + |
| 165 | + return result; |
| 166 | + } |
| 167 | + |
| 168 | + public List<string> GetAllSubcriterionNames() |
| 169 | + { |
| 170 | + List<string> result = new(); |
| 171 | + |
| 172 | + foreach (Node subcriterion in Subcriteria) |
| 173 | + { |
| 174 | + result.Add(subcriterion.Name); |
| 175 | + } |
| 176 | + |
| 177 | + return result; |
| 178 | + } |
| 179 | + |
| 180 | + public List<string> GetSubcriterionNames(string criterion) |
| 181 | + { |
| 182 | + List<string> result = new(); |
| 183 | + |
| 184 | + foreach (Node node in Criteria) |
| 185 | + { |
| 186 | + if (node.Name == criterion) |
| 187 | + { |
| 188 | + foreach (Node subcriterion in node.Children) |
| 189 | + { |
| 190 | + result.Add(subcriterion.Name); |
| 191 | + } |
| 192 | + } |
| 193 | + } |
| 194 | + |
| 195 | + return result; |
| 196 | + } |
| 197 | + |
| 198 | + public List<string> GetAlternativeNames() |
| 199 | + { |
| 200 | + List<string> result = new(); |
| 201 | + |
| 202 | + foreach (Node alternative in Alternatives) |
| 203 | + { |
| 204 | + result.Add(alternative.Name); |
| 205 | + } |
| 206 | + |
| 207 | + return result; |
| 208 | + } |
| 209 | + |
| 210 | + public bool HasSubcriteria(Node criterion) |
| 211 | + { |
| 212 | + return Subcriteria.Contains(criterion.Children[0]); |
| 213 | + } |
| 214 | + } |
| 215 | +} |
0 commit comments