Graph.py
def Trans_List(G):
    '''
    caution: G must be directed graph representing with adjancy list
    '''
    GT = {}
    # initialize new adjancy list reprentation fo transpose of G
    for u in G:
        GT[u] = []
    
    for u in G:
        for v in G[u]:
            GT[v].append(u)
    return GT

    caution: G must be directed graph representing with adjancy list
    
G must be directed graph representing with adjancy list
G must be directed graph representing with adjancy list
def Trans_List(G):
    GT = {}
    for u in G:
        GT[u] = []
    for u in G:
        for v in G[u]:
            GT[v].append(u)
    return GT
def Trans_List ( G ) : GT = { } for u in G : GT [ u ] = [ ] for u in G : for v in G [ u ] : GT [ v ] . append ( u ) return GT
caution: G must be directed graph representing with adjancy list
caution : G must be directed graph representing with adjancy list
'''
    caution: G must be directed graph representing with adjancy list
    ''' # initialize new adjancy list reprentation fo transpose of G

G