manuth/ExperimentBox
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Add code for determining and drawing a route

Browse source
This commit is contained in:
Manuel Thalmann 2022-11-08 22:18:33 +01:00
parent ed5cfd5cb9
commit 785b359d37
1 changed files with 33 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

35
app/src/main/java/ch/nuth/zhaw/exbox/LabyrinthServer.java
View file

@ -51,14 +51,43 @@ public class LabyrinthServer implements CommandExecutor {
}
}
private boolean search(DijkstraNode current, DijkstraNode ziel) {
// TODO implement 8.4
private boolean search(DijkstraNode current, DijkstraNode destination) {
current.setMark(true);
if (current == destination) {
return true;
} else {
for (Edge edge : current.getEdges()) {
if (edge.getDest() instanceof DijkstraNode node &&
!node.getMark()) {
node.setPrev(current);
if (search(node, destination)) {
return true;
} else {
node.setPrev(null);
}
}
}
return false;
}
}
// search and draw result
public void drawRoute(Graph<DijkstraNode, Edge> graph, String startNode, String zielNode) {
public void drawRoute(Graph<DijkstraNode, Edge> graph, String startNode, String destinationNode) {
// TODO implement 8.4
ServerGraphics graphics = getGraphics();
DijkstraNode currentNode = graph.findNode(destinationNode);
graphics.setColor(Color.RED);
if (search(graph.findNode(startNode), currentNode)) {
while (currentNode.getPrev() != null) {
DijkstraNode previousNode = currentNode.getPrev();
graphics.drawPath(previousNode.getName(), currentNode.getName(), true);
currentNode = previousNode;
}
}
}
public String execute(String s) {