Graph Search

Given a directed graph G = ? V,E ? and a starting vertex s, find a path from s to some goal vertex g, where g is any vertex that satisfies a goal(v) predicate. E.g., let s = a.

c

d

a

b

e

f

g

Previous slide

Next slide

Back to first slide

View graphic version