Erster schlechter Algorithmus für Kanten ist da
This commit is contained in:
parent
da6aabcdb0
commit
ae2c6c321f
2 changed files with 17 additions and 18 deletions
|
|
@ -151,7 +151,16 @@ public class GameMap {
|
|||
* jede Burg mit allen anderen in einem bestimmten Radius nochmals verbunden
|
||||
*/
|
||||
private void generateEdges() {
|
||||
// TODO: GameMap#generateEdges()
|
||||
|
||||
List<Node<Castle>> castleNodes = castleGraph.getNodes();
|
||||
|
||||
for (int i = 0; i < castleNodes.size(); i++) {
|
||||
if (i == castleNodes.size() - 1)
|
||||
castleGraph.addEdge(castleNodes.get(i), castleNodes.get(0));
|
||||
else
|
||||
castleGraph.addEdge(castleNodes.get(i), castleNodes.get(i+1));
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue