Recently I was making a script to automate pipe routing in 2D, due to various reasons the path of travel methodology didn’t work for me(maily because it gives angled lines) so I decided to mimic the path of travel.
After some reaserch I came across the Network X packages which has many options for graphs and utilised it, sadly its a c- python package and I had to go to the source code of the package and change it accordingly.
In a nut shell what my script does is get a surface divide it into uv grids and finds all shortest path between the two given points on the graph( I have managed to divide in such a way that the two points lie on the uv grids).
In your case you can divide the surface into uv grids with diagonals as angled lines are ok for fire exit dwgs.
Hope this helps…!