Method test_eigenvector_centrality

test/test_graph.py:239–247

(self)

        print "pattern.graph.Graph.shortest_paths()"
        
    def test_eigenvector_centrality(self):
        # Assert eigenvector centrality.
        self.assertEqual(self.g["a"]._weight, None)
        v = self.g.eigenvector_centrality()
        self.assertTrue(isinstance(v["a"], float))
        self.assertTrue(v["a"] == v[self.g.node("a")])
        self.assertTrue(v["a"] < v["c"])
        self.assertTrue(v["b"] < v["c"])
        print "pattern.graph.Graph.eigenvector_centrality()"
        
    def test_betweenness_centrality(self):
        # Assert betweenness centrality.