astar | DEPRICATED

I'm trying to do something a little bit different then the usual.

I have a 3D gridmap node setup and I'm trying to autogenerate the dots and connections using A* Instead of creating obstacles tiles, I'm creating walls in between the tiles, so the tiles are still walkable, you just cannot pass through a wall . I figure it that out all already

but I have no idea how to code how to connect the points in a easy way and not connect points that has walls in between...

I'm using a RaycastCast Node to detect the wall, and his position as it walk through every gridtile

but I can't figure it out a nested loop to find the neighbors points to connect

this is what I tried to do (obviously get_closest_point() is not working the way I wanted). If I could get a point using only Vector3 Coordinates, I think I could make it work.

EXTRA: if you guys can show me a way to clean the code, especially on the "FORs" syntaxes, because I kind don't know what I'm doing

Any other clean code recommendations would be amazing and very much welcomed

At the end has a visual draw(image) of the logic of the idea.

I have the following basic code

Rust's Petgraph library has a bunch of filter 'adaptors', but I haven't been able to find any examples or tutorials for how to use them. Some (but not all) have constructors, such as EdgeFiltered.from_fn() which takes a graph and a function, but it's not clear how you'd then use it with the search methods like Dfs or astar as they don't have filter parameters.

So how do you use these filters? For example, if I had a graph with integer edge weights how would you:

1. Perform a depth first search but excluding edges with a negative weight,
2. Perform an astar search excluding edges with a negative weight?

I am using Python's Queue.PriorityQueue (in an implementation of the A* algorithm, though I'm not sure if this is relevant). I'm using it to hold objects that are non-comparable (an object class provided by a professor that I cannot modify), and Python throws an error when it tries to add an priority-object tuple (ex. pq.put(1, object)) when it's already holding a tuple with the same priority.

This is the relevant part of the error:

I'm creating a MEX to find a path between two nodes using the A* algorithm. The code works as expected, retrieves the right result and everything seems to be fine, but when I return from the method that calls the MEX, Matlab simply shuts itself down.

As I know sometimes Matlab creates a pointer to the same memory address when the user tries to create a copy of a variable (I.E. A = 3; B = A, then A and B are pointing to the same memory address, even though Matlab shows them as 2 independent variables) I used an old trick that consists on performing an operation directly to the copy of the variable, even if its a silly one, Matlab will think that the two variables are no longer the same and will create a copy of it (I.E. A = 3; B = A; B = B+0, now A and B are stored as different and independent variables).

So the only way that I have found to fix the issue is to do what is shown below in function getWP:

I'm trying to look into the A* Algorithm but I'm kind of having a hard time understanding a specific part. So the A* Algorithm Python Code with the example is this:

I'm making a game in Unity where 'enemies' spawn in (controlled from a script on a player), I'm using prefabs of the enemies, I have got the enemies to spawn in but the pathfinding isn't working. I know why - it's that when you reference the player transform while the enemy is in the scene there's a link but once the enemy is a prefab it can't access the player's components as it's not in the scene. I did a bit of researching and found the answer - I needed to instantiate the enemies like normal, but set this to a variable, enemyGO for example, and then access the enemy's AIDestinationSetter script through enemyGO.GetComponent().target = gameObject - this would assign the target value of the pathfinding target to the player (gameObject). This would all work well, but it kept saying that it could no find the AIDestinationSetter component. This, after a while of tinkering, proved to be (I think) because in the script, the AIDestinationSetter is within a namespace.

Here's the AIDestinationSetter code:

I encountered some runtime errors when I was trying to finish a A* algorithm for tsp problem. The program doesn't want to reach the main function. Here is my code, it is long.

The algorithm searches straight upwards and when it reaches the barrier, it just stops, instead of going to the right Here. I am new to graph-algorithms and have just learned about them, so I am clueless when it comes to implementing them.

My code is not optimized, however, I will optimize it later. Here is my code: