The Traveling Salesman Problem $($TSP$)$ is best described as:

A$.$ Finding the shortest path between two nodes in a graph

B$.$ Finding the maximum flow in a network

C$.$ Finding a cycle that visits each vertex exactly once and returns to the starting vertex.

D$.$ Finding the shortest path that visits each node at least once