tex to our target vertex (provided such a path exists), but it won't necessarily be the shortest such path.</li>
</ul>
<ul>
<li><strong>Breadth-First Search (BFS)</strong> - Explores the neighbors of our source vertex, followed by the neighbors' neighbors, and so on, until it finds our target vertex (or exhausts all possible avenues for search without finding the target). This one is guaranteed to find the shortest path from our source to the goal, but it can be quite slow.</li>
</ul>
<ul>
<li><strong>Dijks