Paths
A path is a list of vertices {v1, v2, …, vn} such that (vi, vi+1) ? E for all 0 ? i < n.
Seattle
San Francisco
Dallas
Chicago
Salt Lake City
p = {Seattle, Salt Lake City, Chicago, Dallas, San Francisco, Seattle}
Previous slide
Next slide
Back to first slide
View graphic version