Stanford CS221 | Autumn 2025 | Lecture 6: Search II
Stanford Online · 79:51
This lecture shows how to find minimum-cost paths when a search graph has cycles: use uniform cost search (UCS / Dijkstra) to compute past costs in increasing order under non-negative edge weights, then recover optima...