# Chapter 14 - Graph Theory - 14.1 Graphs, Paths, and Circuits - Exercise Set 14.1: 60

A path is a sequence of adjacent vertices. Two vertices are adjacent if there is an edge which connects the two vertices. Also note that in a path, an edge which connects two adjacent vertices may not be used more than once.

#### Work Step by Step

A path is a sequence of adjacent vertices. Two vertices are adjacent if there is an edge which connects the two vertices. Also note that in a path, an edge which connects two adjacent vertices may not be used more than once. Just like in the real world, a path in a graph is a way of moving from one place to another.

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.