title: Distance Map for every pixel in python
body: <p>I need some help in implementing a distance map in Python.</p>
  
  <p>I have a binary Maze (1=walls, 0=free space) in numpy format in which I would like to implement a distance map which is outgoing from a certain point in the Maze. The distance maps shall not pass through walls.</p>
  
  <p>The Maze that I have looks like this, whereby the distance map should be outgoing from the blue area. <a href="https://i.stack.imgur.com/hF83Z.png" rel="nofollow noreferrer">The binary map that I have</a></p>
  
  <p>I think distance map should be evolving outgoing from the blue area and give every voxel in the maze a value which represents the shortest distance.  To give you an idea,<a href="https://i.stack.imgur.com/4BtZH.png" rel="nofollow noreferrer"> I think the distace map should be evolving in this way</a></p>
  
  <p>Does anybody have an idea on how to implement this or maybe even code examples?</p>
  
  <p>Thanks for every help!</p>
  
  <p>I uploaded the numpy in the following WeTransfer link <a href="https://wetransfer.com/downloads/63800d0f06667fa7644a4a5d1a68fc5a20200121121741/744d2c" rel="nofollow noreferrer">https://wetransfer.com/downloads/63800d0f06667fa7644a4a5d1a68fc5a20200121121741/744d2c</a></p>
  
  <p>The starting point I use is (56,104)</p>