Ok, so my second for-loop was flawed since it only checked vectors right beside eachother.
Fixed it with a nested for-loop so it passed the test above, still WA tho :/
Pretty much: cin largest node letter, convert to int and insert into a vector repeat until empty line: { getline and split the string into int a, int b loop thru all vectors and check if a or b is in any vector if: insert the missing one into the vector if not: create a new vector with a and b (or o...