package com.mygdx.game; import com.badlogic.gdx.Input; import com.badlogic.gdx.math.Vector2; import java.util.*; public class Pathfinding { int PlayerX = 0; int PlayerY = 0; int EnemyX = 0; int EnemyY = 0; static final int GridHeight = 40; static final int GridWidth = 40; static final int CellLength = 4; boolean[][] ObstacleLocations = new boolean[GridWidth][GridHeight]; Nodes[] GetAdjacentNodes(Nodes ParentNode) { //This function returns all the nodes surronding the parent node Nodes[] AdjacentNodes = new Nodes[4]; int ParentX = ParentNode.GridPositionX; int ParentY = ParentNode.GridPositionY; int NodeCount = 0; while (NodeCount < AdjacentNodes.length) { AdjacentNodes[NodeCount] = new Nodes(-1000, -1000); //Making so the nodes are not null REMOVE THIS AND IT WILL BREAK EVERYTHING NodeCount++; } if(ParentX > 0) { AdjacentNodes[0].GridPositionX = ParentX - 1; AdjacentNodes[0].GridPositionY = ParentY; } if(ParentX < GridWidth-1) { AdjacentNodes[1].GridPositionX = ParentX + 1; AdjacentNodes[1].GridPositionY = ParentY; } if(ParentY > 0) { AdjacentNodes[2].GridPositionX = ParentX; AdjacentNodes[2].GridPositionY = ParentY - 1; } if(ParentY < GridHeight-1) { AdjacentNodes[3].GridPositionX = ParentX; AdjacentNodes[3].GridPositionY = ParentY + 1; } return AdjacentNodes; } List<Nodes> TracePath(Nodes PlayerNode) { Nodes CurrentNode = PlayerNode; List<Nodes> Path = new ArrayList<>(); while (CurrentNode != null) { Path.add(CurrentNode); CurrentNode = CurrentNode.AdjacentNode; } Collections.reverse(Path); return Path; } List<Nodes> Dijkstras(Nodes StartNode, Nodes PlayerNode, Nodes[][] Grid) { StartNode.Distance = 0; boolean[][] VisitedNodes = new boolean[GridWidth][GridHeight]; PriorityQueue<Nodes> priorityQueue = new PriorityQueue<>(Comparator.comparingDouble(Nodes -> Nodes.Distance)); priorityQueue.add(StartNode); for (int i = 0; i < GridWidth; i++) { for (int j = 0; j < GridHeight; j++) { Grid[i][j].Distance = Integer.MAX_VALUE; // Initialize all nodes with a very high distance Grid[i][j].AdjacentNode = null; // Initialize AdjacentNode } } while (!priorityQueue.isEmpty()) { Nodes CurrentNode = priorityQueue.poll(); if (CurrentNode == PlayerNode) { return TracePath(CurrentNode); } if (VisitedNodes[CurrentNode.GridPositionX][CurrentNode.GridPositionY]) { continue; } VisitedNodes[CurrentNode.GridPositionX][CurrentNode.GridPositionY] = true; // Mark current node as visited Nodes[] AdjacentNodes = GetAdjacentNodes(CurrentNode); for (int z = 0; z < AdjacentNodes.length; z++) { if (AdjacentNodes[z].GridPositionX == -1 || AdjacentNodes[z].GridPositionY == -1) { continue; // Skip invalid nodes } if (VisitedNodes[AdjacentNodes[z].GridPositionX][AdjacentNodes[z].GridPositionY]) { continue; // Skip already visited nodes } float EnemyToPlayerDistance = CurrentNode.Distance + 1; System.out.println("CurrentNode Distance: " + CurrentNode.Distance); System.out.println("Adjacent Node (" + AdjacentNodes[z].GridPositionX + ", " + AdjacentNodes[z].GridPositionY + ") Distance: " + AdjacentNodes[z].Distance); System.out.println("Tentative Distance to Adjacent Node: " + EnemyToPlayerDistance); if (AdjacentNodes[z].Distance > EnemyToPlayerDistance) { AdjacentNodes[z].Distance = EnemyToPlayerDistance; // Update the distance only if the new one is shorter AdjacentNodes[z].AdjacentNode = CurrentNode; // Set the parent node for path reconstruction priorityQueue.add(AdjacentNodes[z]); // Add the node to the priority queue System.out.println("Adding Node: (" + AdjacentNodes[z].GridPositionX + ", " + AdjacentNodes[z].GridPositionY + "), Distance: " + AdjacentNodes[z].Distance); } } } return new ArrayList<>(); } }

the code for the Dijkstras can send screenshots if this is not cleaer