main.cpp

#include "solution.h"
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <deque>
#include <string>
#include <sstream>

void printUndirectedGraph(UndirectedGraphNode *node) {
    std::ostringstream out;
    std::unordered_map<int, std::unordered_set<int>> map{{0, std::unordered_set<int>()}};
    std::deque<UndirectedGraphNode*> cache;
    cache.push_back(node);
    do {
        std::sort(cache.begin(), cache.end(),[](UndirectedGraphNode* n1, UndirectedGraphNode* n2){
            return n1->label < n2->label;
        });
        UndirectedGraphNode *node = cache.front(); cache.pop_front();
        out << node->label;
        auto found = map.find(node->label);
        for (UndirectedGraphNode* neighbor : node->neighbors) {
            if (map.find(neighbor->label) == map.end()) cache.push_back(neighbor);
            if (found != map.end()) {
                std::unordered_set<int> &exist = found->second;
                if (exist.find(neighbor->label) == exist.end()) out << "," << neighbor->label;
            }
            map[neighbor->label].emplace(node->label);
        }
        out << "#";
    } while (!cache.empty());
    std::string out_str = out.str();
    std::cout << out_str.substr(0, out_str.size()-1) << std::endl;
}

int main() {
    Solution s;
    
    UndirectedGraphNode node0(0);
    UndirectedGraphNode node1(1);
    UndirectedGraphNode node2(2);
    UndirectedGraphNode node3(3);
    UndirectedGraphNode node4(4);
    UndirectedGraphNode node5(5);
    node0.neighbors.push_back(&node1);
    node0.neighbors.push_back(&node5);
    node1.neighbors.push_back(&node0);
    node1.neighbors.push_back(&node2);
    node1.neighbors.push_back(&node5);
    node2.neighbors.push_back(&node1);
    node2.neighbors.push_back(&node3);
    node3.neighbors.push_back(&node2);
    node3.neighbors.push_back(&node4);
    node3.neighbors.push_back(&node4);
    node4.neighbors.push_back(&node3);
    node4.neighbors.push_back(&node3);
    node4.neighbors.push_back(&node5);
    node4.neighbors.push_back(&node5);
    node5.neighbors.push_back(&node0);
    node5.neighbors.push_back(&node1);
    node5.neighbors.push_back(&node4);
    node5.neighbors.push_back(&node4);
    
    printUndirectedGraph(&node0);
    UndirectedGraphNode *node = s.cloneGraph(&node0);
    printUndirectedGraph(node);
}