File size: 4,942 Bytes
c574d3a |
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 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 |
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
class MST {
public static ArrayList<ArrayList<Node>> prim(ArrayList<Node> rootNodes, ArrayList<ArrayList<Node>> nodes, ArrayList<ArrayList<ArrayList<Edge>>> initedges, int numSegments) {
final ExecutorService executorService = Executors.newFixedThreadPool(Runtime.getRuntime().availableProcessors());
for (int i = 0; i < numSegments; i++) {
final int index = i;
executorService.execute(() -> {
rootNodes.get(index).setCost(0);
final PriorityQueue<Edge> pqueue = new PriorityQueue<>(addEdges(rootNodes.get(index), nodes, initedges));
while (!pqueue.isEmpty()) {
//Set current to best possible node in priority queue, comparison can be found i Node class
final Edge current = pqueue.poll();
nodes.get(current.getN1X()).get(current.getN1Y()).setClosed(true);
nodes.get(current.getN2X()).get(current.getN2Y()).setClosed(true);
pqueue.addAll(addEdges(nodes.get(current.getN1X()).get(current.getN1Y()), nodes, initedges));
pqueue.addAll(addEdges(nodes.get(current.getN2X()).get(current.getN2Y()), nodes, initedges));
}
});
}
executorService.shutdown();
while(!executorService.isTerminated()){}
return nodes;
}
private static ArrayList<ArrayList<Node>> addChildren(ArrayList<ArrayList<Node>> nodes) {
for (ArrayList<Node> row : nodes) {
for (Node node : row) {
if (node.getParent() != null) {
node.getParent().addChild(node);
}
}
}
return nodes;
}
private static double getG(Node current, Node neighbour) {
return Helpers.rgbDistance(current.getColor(), neighbour.getColor());
}
private static ArrayList<Edge> addEdges(Node node, ArrayList<ArrayList<Node>> nodes, ArrayList<ArrayList<ArrayList<Edge>>> initedges) {
final ArrayList<Edge> neighbourEdges = initedges.get(node.getX()).get(node.getY());
final ArrayList<Edge> edgesToReturn = new ArrayList<>();
for(final Edge e : neighbourEdges){
if(! (nodes.get(e.getN1X()).get(e.getN1Y()).isClosed() && (nodes.get(e.getN2X()).get(e.getN2Y()).isClosed()))){
edgesToReturn.add(e);
final Node child = nodes.get(e.getN2X()).get(e.getN2Y());
child.setParent(node);
child.setCost(e.getEdgeCost());
node.addChild(child);
}
}
return edgesToReturn;
/*
try {
final Node neighbour = nodes.get((int) node.getX()).get((int) (node.getY() - 1));
final double g = getG(node, neighbour);
final Edge edge = new Edge(node, neighbour, g);
if(!(node.isClosed() && neighbour.isClosed())){
neighbour.setParent(node);
node.addChild(neighbour);
neighbour.setCost(g);
edges.add(edge);
}
} catch (Exception ignored) {
}
try {
final Node neighbour = nodes.get((int) node.getX()).get((int) (node.getY() + 1));
final double g = getG(node, neighbour);
final Edge edge = new Edge(node, neighbour, g);
if(!(node.isClosed() && neighbour.isClosed())){
neighbour.setParent(node);
node.addChild(neighbour);
neighbour.setCost(g);
edges.add(edge);
}
} catch (Exception ignored) {
}
try {
final Node neighbour = nodes.get((int) node.getX()-1).get((int) (node.getY()));
final double g = getG(node, neighbour);
final Edge edge = new Edge(node, neighbour, g);
if(!(node.isClosed() && neighbour.isClosed())){
neighbour.setParent(node);
node.addChild(neighbour);
neighbour.setCost(g);
edges.add(edge);
}
} catch (Exception ignored) {
}
try {
final Node neighbour = nodes.get((int) node.getX()+1).get((int) (node.getY()));
final double g = getG(node, neighbour);
final Edge edge = new Edge(node, neighbour, g);
if(!(node.isClosed() && neighbour.isClosed())){
neighbour.setParent(node);
node.addChild(neighbour);
neighbour.setCost(g);
edges.add(edge);
}
} catch (Exception ignored) {
}
return edges;
*/
}
} |