AI · Theory

Uniform Cost Search

Theory

75/215

Uniform Cost Search

UCS expands the cheapest path-so-far first (priority queue on g). Optimal if costs ≥ 0. Like Dijkstra. No heuristic. If all costs are 1, UCS behaves like BFS.

Uniform Cost Search — output — three exam lines. Graph on paper first.

Diagram

start
    ├── BFS  queue
    ├── DFS  stack
    └── A*   g+h
    │
    ▼
   goal

Exam tip

UCS vs BFS when costs differ.

Example

# Uniform Cost Search
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Uniform Cost Search — output: three exam lines. Graph on paper first.

Short notes

DefPriority on g(n). Optimal if costs ≥ 0.

AI · Theory

Uniform Cost Search

← All stacks

Theory

75/215

Uniform Cost Search

UCS expands the cheapest path-so-far first (priority queue on g). Optimal if costs ≥ 0. Like Dijkstra. No heuristic. If all costs are 1, UCS behaves like BFS.

Uniform Cost Search — output — three exam lines. Graph on paper first.

Diagram

start
    ├── BFS  queue
    ├── DFS  stack
    └── A*   g+h
    │
    ▼
   goal

Exam tip

UCS vs BFS when costs differ.

Example

# Uniform Cost Search
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Uniform Cost Search — output: three exam lines. Graph on paper first.

Short notes

DefPriority on g(n). Optimal if costs ≥ 0.

Uniform Cost Search

Example

Short notes

Questions

Uniform Cost Search

Example

Short notes

Questions