Developing Data Structures
Counting the number of entries in the cost map that have the new city as a key.
If this count is zero, not yet visited the city.
// remove top entry from queuechar * newCity = que.top().destination;int cost = que.top().distance;que.pop();if (travelCosts.count(newCity) == 0) { ... // have not seen it yet}