1. Before

    Home

    Next

    Dijkstra

    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

    Depth Graphic

    Bar Graphic

    Theses graphics show all the data mixed with all algorithm. In the center of the graph you got the current data and all around the value with each algorithm


    Time: the time of each algorithm

    Strokes: the number of strokes

    Branch depth: the average of all branch depth

    Time Complexity: total number of states ever selected in the "opened" set

    Memory Complexity: maximum number of states ever represented in memory at the same timeduring the search

    Complexity: Time * Strokes

    Line Graphic

    Time Strokes Branch Depth Time Complexity Memory Complexity Complexity