public Map(PathfindingDemoGame game, int width, int height) { Game = game; grid = new Node[width, height]; for (int x = 0; x < width; x++) { for (int y = 0; y < height; y++) { grid[x, y] = new Node(x, y); } } foreach (Node node in grid) { node.UpdateNeighbors(this); } }
public MapGameState(PathfindingDemoGame game) { Game = game; }
public AStarGameState(PathfindingDemoGame game) : base(game) { }
public AStarOptimizedGameState(PathfindingDemoGame game) : base(game) { }
public DijkstraGameState(PathfindingDemoGame game) : base(game) { }
public PathfinderGameState(PathfindingDemoGame game) : base(game) { previousMouse = Mouse.GetState(); }
public DijkstraOptimizedGameState(PathfindingDemoGame game) : base(game) { }
public EditorGameState(PathfindingDemoGame game) : base(game) { }