1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
Edge lowestWeightE0 = null;
Node wantedN2 = null;
for (Node n1: graph.getSelf().getNeighbors()) {
    for (Edge e1: n1.getEdges()) {
        Node n2 = e1.getNeighbor(n1);
        if(!n2.equals(graph.getSelf())
                && (lowestWeightE0 == null || e1.getWeight() < lowestWeightE0.getWeight())
                ) {
            if(graph.findEdge(graph.getSelf(), n2).getWeight() < 8) {
                lowestWeightE0 = e1;
                wantedN2 = n2;
            }
        }
    }
}
graph.removeEdge(graph.findEdge(graph.getSelf(), wantedN2));

Name:

T_J5b

Changed:

20.05.2016

Discussion: