DijkstraRouter now has a Cached counterpart, where for every pair of start and target nodes the route is calculated at most once. The cache is cleared when the router is shutdown.
Caching might not give the optimal path, if a shortcut has been added after the route was first calculated
DijkstraRouter now has a Cached counterpart, where for every pair of start and target nodes the route is calculated at most once. The cache is cleared when the router is shutdown.
Caching might not give the optimal path, if a shortcut has been added after the route was first calculated