leetcode---Reconstruct Itinerary---dfs

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.

Note:
If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string. For example, the itinerary [“JFK”, “LGA”] has a smaller lexical order than [“JFK”, “LGB”].
All airports are represented by three capital letters (IATA code).
You may assume all tickets form at least one valid itinerary.
Example 1:
tickets = [[“MUC”, “LHR”], [“JFK”, “MUC”], [“SFO”, “SJC”], [“LHR”, “SFO”]]
Return [“JFK”, “MUC”, “LHR”, “SFO”, “SJC”].
Example 2:
tickets = [[“JFK”,”SFO”],[“JFK”,”ATL”],[“SFO”,”ATL”],[“ATL”,”JFK”],[“ATL”,”SFO”]]
Return [“JFK”,”ATL”,”JFK”,”SFO”,”ATL”,”SFO”].
Another possible reconstruction is [“JFK”,”SFO”,”ATL”,”JFK”,”ATL”,”SFO”]. But it is larger in lexical order.

class Solution {
public:
    void dfs(map<string, multiset<string>> &m, string s, vector<string> &v)
    {
        while(m[s].size())
        {
            string tmp = *m[s].begin();
            m[s].erase(m[s].begin());
            dfs(m, tmp, v);
        }
        v.push_back(s);
    }

    vector<string> findItinerary(vector<pair<string, string>> tickets) 
    {
        vector<string> v;
        map<string, multiset<string>> m;
        for(int i=0; i<tickets.size(); i++)
        {
            m[tickets[i].first].insert(tickets[i].second);
        }
        string s = "JFK";
        dfs(m, s, v);
        return vector<string>(v.rbegin(), v.rend());
    }
};