How to detect squares on a grid (nodes on a graph) which can NEVER be part of a shortest path after adding blocks (removing edges)?
How to detect squares on a grid which can NEVER be part of a shortest path after adding blocks?