
    Given a list of delivery routes between distribution centers and delivery locations, where each route can be traversed in both directions during peak hours, count the number of unique bidirectional route pairs. Consider routes (A,B) and (B,A) as the same route pair when counting, and exclude routes where the origin and destination are the same location.
    

    
def count_bidirectional(test_list):
    """
    Given a list of delivery routes between distribution centers and delivery locations, where each route can be traversed in both directions during peak hours, count the number of unique bidirectional route pairs. Consider routes (A,B) and (B,A) as the same route pair when counting, and exclude routes where the origin and destination are the same location.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of delivery routes between distribution centers and delivery locations, where each route can be traversed in both directions during peak hours, count the number of unique bidirectional route pairs. Consider routes (A,B) and (B,A) as the same route pair when counting, and exclude routes where the origin and destination are the same location.
    

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