
    Given a list of delivery routes where each route is represented as a tuple of two locations (start and end points), write a function that determines the number of unique bidirectional routes between delivery points, considering that a route from point A to point B is equivalent to a route from point B to point A.
    

    
def count_bidirectional(test_list):
    """
    Given a list of delivery routes where each route is represented as a tuple of two locations (start and end points), write a function that determines the number of unique bidirectional routes between delivery points, considering that a route from point A to point B is equivalent to a route from point B to point A.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of delivery routes where each route is represented as a tuple of two locations (start and end points), write a function that determines the number of unique bidirectional routes between delivery points, considering that a route from point A to point B is equivalent to a route from point B to point A.
    

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