I want the A* algorithm implement code in python.

The specific conditon is that the input is m*n matrix.

All elements of matrix has value, 0 or 1. The nodes which have 0 value can be reachable, but the nodes which have 1 value cannot be reachable. ( 1 value nodes are like walls)

I want to find the shortest path that starts at a(11) element and finished at a(mn) element

like this. This example path is not optimal, but I think I can find the optimal path by using the A* algorithm.