
    Given a list of bus route connections where each connection is represented as a tuple of two bus stops with bidirectional travel capability, write a function that determines the total number of unique stop pairs that have two-way routes between them. Count each bidirectional connection only once, regardless of the order in which the stops appear in the tuple pairs.
    

    
def count_bidirectional(test_list):
    """
    Given a list of bus route connections where each connection is represented as a tuple of two bus stops with bidirectional travel capability, write a function that determines the total number of unique stop pairs that have two-way routes between them. Count each bidirectional connection only once, regardless of the order in which the stops appear in the tuple pairs.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of bus route connections where each connection is represented as a tuple of two bus stops with bidirectional travel capability, write a function that determines the total number of unique stop pairs that have two-way routes between them. Count each bidirectional connection only once, regardless of the order in which the stops appear in the tuple pairs.
    

    """
    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