Closed Timmay24 closed 9 years ago
at main.graphs.Dijkstra.findShortestWay(Dijkstra.java:104) // Weg ueber alle Vorgaenger rekonstruieren while (currentNode.getParent() != currentNode) { <== Zeile 104 resultWay.add(currentNode); currentNode = currentNode.getParent(); }
at main.graphs.Dijkstra.findShortestWay(Dijkstra.java:104) // Weg ueber alle Vorgaenger rekonstruieren while (currentNode.getParent() != currentNode) { <== Zeile 104 resultWay.add(currentNode); currentNode = currentNode.getParent(); }