human
Complete this python program:
def main():
assistant
#Here is the Python code you requested.

    """Search for a node with high centrality.
    In this example, we generate a random graph, compute the centrality
    of each node, then perform the progressive widening search in order
    to find a node of high centrality.
    """
    G = nx.gnp_random_graph(100, 0.5)
    centrality = nx.eigenvector_centrality(G)
    avg_centrality = (sum(centrality.values()) / len(G))
    def has_high_centrality(v):
        return (centrality[v] >= avg_centrality)
    source = 0
    value = centrality.get
    condition = has_high_centrality
    found_node = progressive_widening_search(G, source, value, condition)
    c = centrality[found_node]
    print 'found    node    {0}    with    centrality    {1}'.format(found_node, c)