Dijkstra's Algorithm finds the shortest path between a given node (which is called the "source node") and all other nodes in a graph. blue->red == start->end
The A* algorithm follows properties of completeness, optimality, and efficiency. It guarantees finding a solution if one exists , finds the optimal path with the lowest cost , and efficiently explores fewer nodes by utilizing heuristics. blue->red == start->end
