A ____ is a path through a graph that begins and ends on the same node and goes through every node exactly once.
A) Newtonian loop
B) McCarthian path
C) Hamiltonian circuit
D) complete trip

Question

Quizplus · Accepted Answer

A path through a graph that begins and ends on the same node and goes through every node exactly once is called a Hamiltonian circuit. Choice A "Newtonian loop" and choice B "McCarthian path" are not commonly used terms in graph theory, and choice D "complete trip" is not a standard term for this concept.

A ____ Is a Path Through a Graph That Begins