A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?

A. Depth First Search

B. Breadth First Search

C. Topological Sorting

D. Dijkstra's Shortest path algorithm

Answer: Option C