def METHOD_NAME(self):
    """Eigenvector centrality: K5"""
    G = nx.complete_graph(5)
    b = nx.eigenvector_centrality(G)
    v = math.sqrt(1 / 5.0)
    b_answer = dict.fromkeys(G, v)
    for n in sorted(G):
        assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
    nstart = {n: 1 for n in G}
    b = nx.eigenvector_centrality(G, nstart=nstart)
    for n in sorted(G):
        assert b[n] == pytest.approx(b_answer[n], abs=1e-7)
    b = nx.eigenvector_centrality_numpy(G)
    for n in sorted(G):
        assert b[n] == pytest.approx(b_answer[n], abs=1e-3)