Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package Heuristics;
import java.util.HashMap;
import java.util.Map;
import FaultTree.*;
public class ByWeightHeuristic implements Heuristic {
private class FaultTreeScale extends AbstractFaultTreeVisitor {
private Map<FaultTree, Integer> weights = new HashMap<>();
@Override
public void visitIntermediateEvent(IntermediateEvent event) {
visit(event.left);
visit(event.right);
weights.put(event, weights.get(event.left) + weights.get(event.right));
}
@Override
public void visitBasicEvent(BasicEvent event) {
weights.put(event, 1);
}
public Map<FaultTree, Integer> getWeights() {
return weights;
}
}
private class DepthFirstByWeightOrderer extends AbstractFaultTreeVisitor {
private Map<FaultTree, Integer> weights;
private int counter = 0;
private Map<BasicEvent, Integer> order = new HashMap<>();
public DepthFirstByWeightOrderer(Map<FaultTree, Integer> weights) {
this.weights = weights;
}
@Override
public void visitIntermediateEvent(IntermediateEvent event) {
if (weights.get(event.left) >= weights.get(event.right)) {
visit(event.left);
visit(event.right);
} else {
visit(event.right);
visit(event.left);
}
}
@Override
public void visitBasicEvent(BasicEvent event) {
order.put(event, counter++);
}
public Map<BasicEvent, Integer> getOrder() {
return order;
}
}
@Override
public Map<BasicEvent, Integer> getOrder(FaultTree tree) {
var scale = new FaultTreeScale();
scale.visit(tree);
var weights = scale.getWeights();
var orderer = new DepthFirstByWeightOrderer(weights);
orderer.visit(tree);
return orderer.getOrder();
}
}