Dijkstra is an heuristic that check all the possible strokes, depth by depth. It will be the slower heuristic but it will always give the smaller strokes result
Theses graphics represents the courbes of time and complexity on 50 maps. The differents colors reprensents differents algorithm as:
AStar
AStar3
AStar8
MultStar
AverageStar