Leetcode Reconstruct Itinerary

题意：给出一个有向图，求出一条欧拉通路。

思路：求欧拉通路。DFS 和后序遍历。

class Solution {
public:
    vector<string> findItinerary(vector<pair<string, string>> tickets) {
        if(tickets.size() == 0) return re;
        
        for(int i = 0; i < tickets.size(); ++ i) {
            G[tickets[i].first].insert(tickets[i].second);
        }
        dfs("JFK");
        
        return vector<string>(re.rbegin(), re.rend());
    }
    
private:
    map<string, multiset<string>> G;
    vector<string> re;
    
    void dfs(string source) {
        while(G[source].size() != 0) {
            string nextSource = *G[source].begin();
            G[source].erase(G[source].begin());
            dfs(nextSource);
        }
        re.push_back(source);
    }
};