It is suppose to find the shortest path while taking the fewest turns and then draw arrows from start to finish.
I attempted to use a binary heap to sort my F values.
My problem is that the program seems to lockup and I can’t seem to find the cause.
Will someone please take a look at it?
Also, dose anyone have any suggestions on how I can improve this?