I define when a graph is connected and show that any walk between two vertices contains a path between those same vertices. The material follows Diestel's "Graph Theory", section 1.4.