In this assignment, you're going to plan the cheapest route for a vacation.

Select $3$ cities you'd like to visit sometime in your life. These could be cities in the United States, or cities around the world, but they should be cities you'd need to fly to$.$

Visit a site like Google Flights. Set it for "One way", and pick a date a couple months in the future.

For each pair of cities $($the $3$ you chose and your home city$),$ look up the one$-$way airfare between the cities. For the sake of simplicity, we're going to assume the cost is the same both ways, so you don't need to look up both directions.

Create a graph on paper showing the $4$ cities and the cost between them.

Use Sorted Edges to determine a cheap order in which to visit the cities and return home. Be sure to show enough detail on the paper that I can tell you used Sorted Edges and not another method.