What is a fast algorithm to update all paths, if one node is marked as inpassible.
Any good 3rd party library or research paper out there?
Assuming the shortest path from from all nodes to every other
node is already pre-computed:
- [OT] Pathfinding algorithm rasmus svensson
- Re: [OT] Pathfinding algorithm Joseph Rushton Wakeling
- Re: [OT] Pathfinding algorithm Gary Willoughby
- Re: [OT] Pathfinding algorithm Joseph Rushton Wakeling
- Re: [OT] Pathfinding algorithm Ivan Kazmenko
