search and Dijkstra’s algorithm solutions will be demonstrated. In order to understand the visualization, the user needs to know what each colored line represents. These mappings are as follows:
• Best Path blue edge This is the path that each algorithm returns as its guess for a best path from the origin node to the destination node
• Searched Node orange edge These edges represent the links to every node that was checked throughout each algorithm’s search process