Potential shortcut for Dijkstra implementation?
jogru0 opened this issue · comments
Hi!
I see that for A*, we have a shortcut to not go through the neighbors of a node that was visited before already: 3cde907
I was wondering, why don't we do a similar check for Dijkstra?
The shortcut has been removed in 808b951 as it gave worst execution times. You may try to reintroduce it and tweak it so that it gets better performance if you wish.