joachim/fop-projekt
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity Actions

Fixes issue #2

Browse source
This commit is contained in:
joachimschmidt557 2019-02-15 15:01:48 +01:00
parent ae2c6c321f
commit 526d15f2c7
3 changed files with 40 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

18
Projektgruppe_175/src/game/map/GameMap.java
View file

@ -8,6 +8,7 @@ import java.awt.*;
import java.awt.image.BufferedImage;
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;
/**
* Diese Klasse representiert das Spielfeld. Sie beinhaltet das Hintergrundbild, welches mit Perlin noise erzeugt wurde,
@ -153,15 +154,30 @@ public class GameMap {
private void 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));
}*/
final double radius = 300.0;
for (Node<Castle> cast : castleNodes) {
for (Node<Castle> c : allCastlesInRadius(cast, castleNodes, radius))
castleGraph.addEdge(cast, c);
}
}
private List<Node<Castle>> allCastlesInRadius(Node<Castle> castle, List<Node<Castle>> allCastles, double r) {
return allCastles.stream()
.filter(x -> x.getValue().distance(castle.getValue()) <= r)
.collect(Collectors.toList());
}
/**
* Hier werden die Burgen in Königreiche unterteilt. Dazu wird der {@link Clustering} Algorithmus aufgerufen.