
    Given a list of user pairs who have expressed interest in attending the same event, where each pair (user1, user2) represents mutual interest, determine the number of unique bidirectional connections between users. Consider that if user A and user B are connected, both (A,B) and (B,A) represent the same connection and should be counted only once.
    

    
def count_bidirectional(test_list):
    """
    Given a list of user pairs who have expressed interest in attending the same event, where each pair (user1, user2) represents mutual interest, determine the number of unique bidirectional connections between users. Consider that if user A and user B are connected, both (A,B) and (B,A) represent the same connection and should be counted only once.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of user pairs who have expressed interest in attending the same event, where each pair (user1, user2) represents mutual interest, determine the number of unique bidirectional connections between users. Consider that if user A and user B are connected, both (A,B) and (B,A) represent the same connection and should be counted only once.
    

    """
    res = 0
    for idx in range(0, len(test_list)):
        for iidx in range(idx + 1, len(test_list)):
            if test_list[iidx][0] == test_list[idx][1] and test_list[idx][1] == test_list[iidx][0]:
                res += 1
    return res