tra's Algorithm</strong> - Finds shortest paths in a graph, but unlike BFS, it takes edge weights into account. We will discuss this in more detail on Monday.</li>
</ul>
<ul>
<li><strong>A* Search</strong> - Like Dijkstra's algorithm, but introduces a function that biases us toward exploring nodes that get us closer to some predetermined destination in our graph. We will discuss this in more detail on Monday.</li>
</ul>
<p>For more detail on DFS and BFS, see below.</p>
<p><br /><strong>Pathfinding Animation