Which of the following best describes a HAMILTONIAN PATH.
A path that uses each EDGE of a graph exactly once and ends at a vertex different from the starting vertex.
A path that uses each VERTEX of a graph exactly once and ends at a vertex different from the starting vertex.
A path that uses each EDGE of a graph exactly once and ends at the starting vertex.
A path that uses each VERTEX of a graph exactly once and ends at the starting vertex.
