Start : hover over a point and press 's'
End : hover over a point and press 'e'
Create wall : left click
Delete wall : right click
This is my visualization of A* algorithm. Algorithm calculates the lowest F cost by adding g cost (distance from start node ) and h cost(distance from end node). You can see F cost only if you check input and you are using large size. Algorithm counts open (still possible to check) and closed nodes(checked).