Description
Brief Story: Mark is planning a vacation on a budget. He has set aside $650 for travel costs. Before selecting his final destination, he needs to set out all possible destinations that he can reach without going over budget.
Details: A weighted graph will be given that represents locations and direct connections between locations. Each location will be represented by a vertex and each direct connection will be represented by a weighted edge where the weight represents the price including both departure and return trips.
The weighted graph will be stored as a WeightedGraph object which contains an adjacency list. The expected output is a set of locations having type Set