Your logic is correct but solution is not. In the second example we can remove the black pegs and see that you're matching three 1's inside guess with a single 1 inside answer which is obviously wrong:

Answer set:  [1,_,_,2,2,2,_,_,_,2,2,2,3,3,3]
Guess set:   [3,_,_,1,1,1,_,_,_,1,1,1,1,1,1]
Your answer: [W,_,_,W,W,W,_,_,_,_,_,_,_,_,_]

If graph is connected isn't a solution, for example.
When you for example test {0:[1,2,3], 1:[0], 2:[0], 3:[0]}, this graph is connected, however you're able to split persons for two groups ([0] and [1,2,3] .
Graph don't have to be disconnected, to be True. I believe you failing this part, but I may assume wrong.

You need to provide some concrete information or nothing can be done.

Your code not working is not an issue (= a bug in the kata), maybe a question? Please refer to the documentation: https://docs.codewars.com/training/troubleshooting/