DijkstraMagic.java 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354
  1. package pathgame.algorithm;
  2. import pathgame.tilemap.TileMap;
  3. import pathgame.tilemap.TileType;
  4. import pathgame.tilemap.Tiles;
  5. import java.util.ArrayList;
  6. import pathgame.gameplay.Player;
  7. public class DijkstraMagic {
  8. private int TOWN_ID = Tiles.TOWN.getId();
  9. private int START_ID = Tiles.HOME_TOWN.getId();
  10. private int PORT_ID = Tiles.PORT.getId();
  11. private int WATER_WEIGHT;
  12. private ArrayList<Coord> towns = new ArrayList<>();
  13. private ArrayList<Coord> ports = new ArrayList<>();
  14. private TileMap map;
  15. private Node2D[][] weightMap;
  16. private ArrayList<ArrayList<SaleRoute>> salesPitch = new ArrayList<>();
  17. public DijkstraMagic(TileMap map, Player player) {
  18. this.map = map;
  19. weightMap = new Node2D[map.getWidth()][map.getHeight()];
  20. setup(player);
  21. //printWeightMap();
  22. for(int i = 0; i < ports.size(); i++) {
  23. doMagic(i, false);
  24. }
  25. for(int i = 0; i < towns.size(); i++) {
  26. doMagic(i, true);
  27. }
  28. //printDijkstraResult();
  29. }
  30. public ArrayList<ArrayList<SaleRoute>> getSalesPitch() {
  31. return salesPitch;
  32. }
  33. private void doMagic(int fromIndex, boolean forTown) {
  34. resetWeightMap();
  35. Coord origin;
  36. if(forTown) {
  37. origin = towns.get(fromIndex);
  38. }
  39. else {
  40. origin = ports.get(fromIndex);
  41. }
  42. int posX = origin.getX(), posY = origin.getY();
  43. weightMap[posX][posY].setCostSoFar(0);
  44. weightMap[posX][posY].setQAdded(true);
  45. ArrayList<Coord> tileQ = new ArrayList<>();
  46. tileQ.add(new Coord(posX, posY));
  47. while(tileQ.size() > 0) {
  48. int leastCost = Integer.MAX_VALUE;
  49. int leastIndex = -1;
  50. for(int i = 0; i < tileQ.size(); i++) {
  51. int iX = tileQ.get(i).getX();
  52. int iY = tileQ.get(i).getY();
  53. if(weightMap[iX][iY].getCostSoFar() < leastCost) {
  54. leastCost = weightMap[iX][iY].getCostSoFar();
  55. leastIndex = i;
  56. }
  57. }
  58. Coord c = tileQ.get(leastIndex);
  59. if(weightMap[c.getX()][c.getY()].isBlocked() && forTown) {
  60. tileQ.remove(leastIndex);
  61. }
  62. else {
  63. dijkstraForTownOrPort(tileQ.get(leastIndex).getX(), tileQ.get(leastIndex).getY(), tileQ, leastIndex, forTown);
  64. }
  65. }
  66. if(forTown) {
  67. makeListForPitch(fromIndex);
  68. }
  69. else {
  70. addPortsPaths(fromIndex);
  71. }
  72. //printDijkstraMap();
  73. }
  74. private void dijkstraForTownOrPort(int posX, int posY, ArrayList<Coord> tileQ, int qIndex, boolean forTown) {
  75. int prevCost = weightMap[posX][posY].getCostSoFar();
  76. if(posX < weightMap.length-1) {
  77. adjacent(posX+1, posY, prevCost, 'w', null, -1, tileQ, forTown);
  78. }
  79. if(posX > 0) {
  80. adjacent(posX-1, posY, prevCost, 'e', null, -1, tileQ, forTown);
  81. }
  82. if(posY < weightMap[0].length-1) {
  83. adjacent(posX, posY+1, prevCost, 'n', null, -1, tileQ, forTown);
  84. }
  85. if(posY > 0) {
  86. adjacent(posX, posY-1, prevCost, 's', null, -1, tileQ, forTown);
  87. }
  88. if(forTown) {
  89. if(weightMap[posX][posY].hasExtraPaths()) {
  90. ArrayList<ExtraPath> extraPaths = weightMap[posX][posY].getExtraPaths();
  91. for(int i = 0; i < extraPaths.size(); i++) {
  92. ExtraPath path = extraPaths.get(i);
  93. adjacent(path.getDestX(), path.getDestY(), prevCost, '\0', path, i, tileQ, forTown);
  94. }
  95. }
  96. }
  97. tileQ.remove(qIndex);
  98. }
  99. private void adjacent(int posX, int posY, int prevCost, char dir, ExtraPath boatPath, int extraInd, ArrayList<Coord> tileQ, boolean forTown) {
  100. if(forTown) {
  101. if(!weightMap[posX][posY].isBlocked()) {
  102. adjacentCalc(posX, posY, prevCost, dir, boatPath, extraInd, tileQ, forTown);
  103. }
  104. }
  105. else {
  106. TileType type = weightMap[posX][posY].getType();
  107. if(type == TileType.SHALLOW_WATER || type == TileType.DEEP_WATER || type == TileType.PORT) {
  108. adjacentCalc(posX, posY, prevCost, dir, null, -1, tileQ, forTown);
  109. }
  110. }
  111. }
  112. private void adjacentCalc(int posX, int posY, int prevCost, char dir, ExtraPath extraPath, int extraInd, ArrayList<Coord> tileQ, boolean forTown) {
  113. int newCost = prevCost;
  114. if(forTown) {
  115. if(extraPath == null) {
  116. newCost += weightMap[posX][posY].getWeight();
  117. }
  118. else {
  119. newCost += extraPath.getPathWeight();
  120. }
  121. }
  122. else {
  123. newCost += WATER_WEIGHT;
  124. }
  125. if(newCost < weightMap[posX][posY].getCostSoFar()) {
  126. weightMap[posX][posY].setCostSoFar(newCost);
  127. if(extraPath == null) {
  128. weightMap[posX][posY].setPrevOfPath(dir);
  129. }
  130. else {
  131. weightMap[posX][posY].setPrevBoatPath(0);
  132. }
  133. }
  134. if(!weightMap[posX][posY].isQAdded()) {
  135. weightMap[posX][posY].setQAdded(true);
  136. tileQ.add(new Coord(posX, posY));
  137. }
  138. }
  139. private void addPortsPaths(int fromIndex) {
  140. Coord origin = ports.get(fromIndex);
  141. for(int i = fromIndex+1; i < ports.size(); i++) {
  142. Coord nextPort = ports.get(i);
  143. if(weightMap[nextPort.getX()][nextPort.getY()].getCostSoFar() < Integer.MAX_VALUE) {
  144. //System.out.println("connecting ports " + fromIndex + " and " + i);
  145. int pathWeight = weightMap[nextPort.getX()][nextPort.getY()].getCostSoFar();
  146. ArrayList<Coord> pathCoords = new ArrayList<>();
  147. makePathCoords(false, new Coord(nextPort.getX(), nextPort.getY()), pathCoords);
  148. weightMap[origin.getX()][origin.getY()].addExtraPath(nextPort, pathWeight, pathCoords);
  149. weightMap[nextPort.getX()][nextPort.getY()].addExtraPath(origin, pathWeight, pathCoords);
  150. }
  151. }
  152. }
  153. private void makePathCoords(boolean forTown, Coord curPos, ArrayList<Coord> coordList) {
  154. while(true) {
  155. char dir = weightMap[curPos.getX()][curPos.getY()].getPrevOfPath();
  156. int extraInd = weightMap[curPos.getX()][curPos.getY()].getPrevBoatPath();
  157. coordList.add(new Coord(curPos.getX(), curPos.getY()));
  158. if(dir == 'n') {
  159. curPos.changeY(-1);
  160. }
  161. else if(dir == 'e') {
  162. curPos.changeX(1);
  163. }
  164. else if(dir == 's') {
  165. curPos.changeY(1);
  166. }
  167. else if(dir == 'w') {
  168. curPos.changeX(-1);
  169. }
  170. else if(extraInd != -1 && forTown) {
  171. ExtraPath extraPath = weightMap[curPos.getX()][curPos.getY()].getExtraPaths().get(extraInd);
  172. curPos.setCoord(extraPath.getDestX(), extraPath.getDestY());
  173. coordList.addAll(extraPath.getPathCoords());
  174. }
  175. else {
  176. break;
  177. }
  178. }
  179. if(!forTown) {
  180. coordList.remove(0);
  181. coordList.remove(coordList.size()-1);
  182. }
  183. }
  184. private void makeListForPitch(int fromIndex) {
  185. ArrayList<SaleRoute> listForPitch = new ArrayList<>();
  186. for(int i = fromIndex+1; i < towns.size(); i++) {
  187. ArrayList<Coord> listForRoute = new ArrayList<>();
  188. Coord curPos = new Coord(towns.get(i).getX(), towns.get(i).getY());
  189. int totalCost = weightMap[curPos.getX()][curPos.getY()].getCostSoFar();
  190. makePathCoords(true, curPos, listForRoute);
  191. listForPitch.add(new SaleRoute(listForRoute, totalCost));
  192. }
  193. salesPitch.add(listForPitch);
  194. }
  195. private void resetWeightMap() {
  196. for(int x = 0; x < weightMap.length; x++) {
  197. for (int y = 0; y < weightMap[0].length; y++) {
  198. weightMap[x][y].setCostSoFar(Integer.MAX_VALUE);
  199. weightMap[x][y].setQAdded(false);
  200. weightMap[x][y].setPrevOfPath('\0');
  201. weightMap[x][y].setPrevBoatPath(-1);
  202. }
  203. }
  204. }
  205. private void setup(Player player) {
  206. //find towns
  207. for(int x = 0; x < map.getWidth(); x++) {
  208. for(int y = 0; y < map.getHeight(); y++) {
  209. weightMap[x][y] = new Node2D(map.getTile(x, y).getEnergyCost(player));
  210. weightMap[x][y].setType(map.getTile(x, y).getType());
  211. if(map.getTile(x, y).getId() == TOWN_ID || map.getTile(x, y).getId() == START_ID) {
  212. towns.add(new Coord(x, y));
  213. weightMap[x][y].setTown(true);
  214. }
  215. else if(map.getTile(x, y).getId() == PORT_ID) {
  216. ports.add(new Coord(x, y));
  217. }
  218. if(map.getTile(x, y).isBlockingMovement(player)) {
  219. weightMap[x][y].setBlocked(true);
  220. }
  221. }
  222. }
  223. player.switchSailing();
  224. WATER_WEIGHT = Tiles.SHALLOW_WATER.getEnergyCost(player);
  225. player.switchSailing();
  226. }
  227. private void printDijkstraMap() {
  228. for(int y = 0; y < weightMap[0].length; y++) {
  229. for(int x = 0; x < weightMap.length; x++) {
  230. int cost = weightMap[x][y].getCostSoFar();
  231. if(cost == Integer.MAX_VALUE) {
  232. System.out.print("- ");
  233. }
  234. else {
  235. System.out.print(cost + " ");
  236. }
  237. }
  238. System.out.println();
  239. }
  240. System.out.println();
  241. }
  242. private void printDijkstraResult() {
  243. System.out.println();
  244. for(int origNum = 0; origNum < salesPitch.size(); origNum++) {
  245. for (int lNum = 0; lNum < salesPitch.get(origNum).size(); lNum++) {
  246. System.out.print("Total Cost: " + salesPitch.get(origNum).get(lNum).getTotalCost() + " ");
  247. for (int lInd = 0; lInd < salesPitch.get(origNum).get(lNum).getPath().size(); lInd++) {
  248. System.out.print(salesPitch.get(origNum).get(lNum).getPath().get(lInd).getX() + "/" + salesPitch.get(origNum).get(lNum).getPath().get(lInd).getY() + " ");
  249. }
  250. System.out.println();
  251. }
  252. System.out.println();
  253. }
  254. System.out.println();
  255. }
  256. private void printWeightMap() {
  257. String ANSI_RESET = "\u001B[0m";
  258. String ANSI_BLUE = "\u001B[34m";
  259. String ANSI_CYAN = "\u001B[36m";
  260. String ANSI_RED = "\u001B[31m";
  261. for(int y = 0; y < weightMap[0].length; y++) {
  262. for(int x = 0; x < weightMap.length; x++) {
  263. int cost = weightMap[x][y].getWeight();
  264. TileType type = weightMap[x][y].getType();
  265. if(weightMap[x][y].isTown()) {
  266. System.out.print(ANSI_RED + "T " + ANSI_RESET);
  267. }
  268. else if(type == TileType.PORT) {
  269. System.out.print(ANSI_CYAN + "P " + ANSI_RESET);
  270. }
  271. else if(type == TileType.SHALLOW_WATER) {
  272. System.out.print(ANSI_BLUE + "s " + ANSI_RESET);
  273. }
  274. else if(type == TileType.DEEP_WATER) {
  275. System.out.print(ANSI_BLUE + "d " + ANSI_RESET);
  276. }
  277. else {
  278. System.out.print(cost + " ");
  279. }
  280. }
  281. System.out.println();
  282. }
  283. System.out.println();
  284. }
  285. }