Algorithm for shortest path to cover all the routes

Question

This is a variation of a question I came across in one of the mock-interview videos.

Assume there\'s a bunch of routes ex: [rome->dallas, dallas->rome, lo