The path A,D,E,F,C,G,B is a Hamilton path that begins at A and ends at B.
Work Step by Step
A Hamilton path is a sequence of adjacent vertices that visits each vertex in the graph exactly once. Let's start at vertex A. For simplicity, let's travel counterclockwise around the outside of the rectangle. The path can travel to vertex D, then to vertex E, then to vertex F, and then to vertex C. The path must next travel to vertex G, and then finally to vertex B. This path is A,D,E,F,C,G,B. Since this path visits every vertex in the graph exactly once, this path is a Hamilton path. This is one Hamilton path that begins at A and ends at B, but there are other such Hamilton paths in the graph.