def get_neighborhood_edge(G, e, h):
    """
    Given an edge and a height/depth to
    traverse, find the neighborhood as defined in the CONGA
    paper.
    """
    neigh = set(G.neighborhood(e[0], order=h - 1))
    neigh.update(G.neighborhood(e[1], order=h - 1))
    return list(neigh)
