path finding - Understanding this implementation of A-star algorithm in Python -


I'm new to Python I have this code I have

its A-star algorithm code. I wanted to know how it creates obstacles. Actually I have a black and white image. My task is to reach the end point from start point to avoid white bars. Finding the path-find algorithm in the function pathFind () < P>

Code> is well commented and decomposed If you have some specific confusions, let us know what it is.

I recommend that you suggest reducing the parameters (M, N) after a 4x5 or 5x6 then move through your execution, either PDB debugger (single-phase at important points Or set breakpoints), or hacking in many print statements as per your requirement:

  # matrix matrix n = 30 # horizontal size m = 30 # vertical size   

First try to give your own custom maps that it Ase works ( # to modify fillout) map matrix ... lines). Then run it interactive in the debugger.

Comments

Popular posts from this blog

Java - Error: no suitable method found for add(int, java.lang.String) -

java - JPA TypedQuery: Parameter value element did not match expected type -

c++ - static template member variable has internal linkage but is not defined -