
    Given a list of successful student learning style combinations represented as paired tuples, count the number of unique bidirectional learning pathways where both styles can be effectively interchanged. Each learning style pair (a,b) is considered equivalent to its reverse pair (b,a), and the function should count such equivalent pairs only once to determine the total number of flexible learning approaches available.
    

    
def count_bidirectional(test_list):
    """
    Given a list of successful student learning style combinations represented as paired tuples, count the number of unique bidirectional learning pathways where both styles can be effectively interchanged. Each learning style pair (a,b) is considered equivalent to its reverse pair (b,a), and the function should count such equivalent pairs only once to determine the total number of flexible learning approaches available.
    

    """
def count_bidirectional(test_list):
    """
    Given a list of successful student learning style combinations represented as paired tuples, count the number of unique bidirectional learning pathways where both styles can be effectively interchanged. Each learning style pair (a,b) is considered equivalent to its reverse pair (b,a), and the function should count such equivalent pairs only once to determine the total number of flexible learning approaches available.
    

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