
    Given a list of two-way delivery routes between distribution points, where each route allows trucks to travel in either direction, determine the total number of unique route connections available for rerouting delivery trucks. Consider that route (A,B) is equivalent to route (B,A) when counting unique connections, as trucks can travel both ways on any given route.
    

    
def count_bidirectional(test_list):
    """
    Given a list of two-way delivery routes between distribution points, where each route allows trucks to travel in either direction, determine the total number of unique route connections available for rerouting delivery trucks. Consider that route (A,B) is equivalent to route (B,A) when counting unique connections, as trucks can travel both ways on any given route.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of two-way delivery routes between distribution points, where each route allows trucks to travel in either direction, determine the total number of unique route connections available for rerouting delivery trucks. Consider that route (A,B) is equivalent to route (B,A) when counting unique connections, as trucks can travel both ways on any given route.
    

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