Union and Intersection of two Graphs

#include using namespace std;  void find_union(    vector G1,    vector G2){        map added;          vector G;              for (auto p : G1) {          string a = get(p);                  int b = get(p);        int c = get(p);                          G.push_back(            make_tuple(a, b, c));        added[a] = { b, c };    }              for (auto p : G2) {          string a = get(p);        int b = get(p);        int c = get(p);          pair x = { b, c };        pair y = { c, b };                          if (added[a] == x || added[a] == y)            continue;                  G.push_back(make_tuple(a, b, c));    }          cout