Currently, to generate paths we use a PathExists() method that runs a simple graph search to check if a path exists, followed up by Dijkstra() call to actually generate the path if it exists. This likely isn’t necessary, and could maybe make the program more efficient if these are both in the same search (so we do 1 search instead of 2).
This is pretty low priority as the PathExists method is fairly efficient and doesn’t require the same calculations as a “shortest path” search, but would be nice
Currently, to generate paths we use a PathExists() method that runs a simple graph search to check if a path exists, followed up by Dijkstra() call to actually generate the path if it exists. This likely isn’t necessary, and could maybe make the program more efficient if these are both in the same search (so we do 1 search instead of 2).
This is pretty low priority as the PathExists method is fairly efficient and doesn’t require the same calculations as a “shortest path” search, but would be nice
┆Issue is synchronized with this Trello card by Unito