hs, and some potential applications. We will aim to discuss this in a bit more depth on Monday, time permitting.</p>
<p><br /><strong>Graph Traversal, Exploration, and Shortest Paths</strong></p>
<p>Toward the end of class, I gave a quick, high-level overview of DFS, BFS, Dijkstra's algorithm, and A*:</p>
<ul>
<li><strong>Depth-First Search (DFS)</strong> - Goes as deeply as possible down one path, then backtracks and tries alternative routes when it hits a dead end. DFS will find a path from our source ver