def create_dict_neighbors(H):
    """
    Given our undirected graph, Create a dictionary where value==node and key==set of its neighbours.
    """
    G = H.to_undirected()
    G_nodes = list(G.nodes())
    neighbors_dict = {}
    for i in range(len(G_nodes)):
        node = G_nodes[i]
        neighbors_dict.update({node: set(G[node])})
    return neighbors_dict