def METHOD_NAME(g):
    adj_list = {}
    for node in range(g.num_nodes()):
        # For undirected graph. successors and
        # predecessors are equivalent.
        adj_list[node] = g.successors(node).tolist()
    return adj_list