def test_node_degree_xy_weighted(self):
     G = nx.Graph()
     G.add_edge(1, 2, weight=7)
     G.add_edge(2, 3, weight=10)
     xy = sorted(nx.node_degree_xy(G, weight='weight'))
     xy_result = sorted([(7, 17), (17, 10), (17, 7), (10, 17)])
     assert xy == xy_result
 def test_node_degree_xy_undirected_nodes(self):
     xy = sorted(nx.node_degree_xy(self.P4, nodes=[0, 1, -1]))
     xy_result = sorted([
         (1, 2),
         (2, 1),
     ])
     assert xy == xy_result
Exemplo n.º 3
0
 def test_node_degree_xy_weighted(self):
     G = nx.Graph()
     G.add_edge(1, 2, weight=7)
     G.add_edge(2, 3, weight=10)
     xy = sorted(nx.node_degree_xy(G, weight="weight"))
     xy_result = sorted([(7, 17), (17, 10), (17, 7), (10, 17)])
     assert_equal(xy, xy_result)
Exemplo n.º 4
0
 def test_node_degree_xy_directed(self):
     xy = sorted(nx.node_degree_xy(self.D))
     xy_result = sorted([(2, 1),
                         (2, 3),
                         (1, 3),
                         (1, 3)])
     assert_equal(xy, xy_result)
Exemplo n.º 5
0
 def test_node_degree_xy_directed(self):
     xy = sorted(nx.node_degree_xy(self.D))
     xy_result = sorted([(2, 1),
                         (2, 3),
                         (1, 3),
                         (1, 3)])
     assert xy == xy_result
Exemplo n.º 6
0
 def test_node_degree_xy_undirected(self):
     xy = sorted(nx.node_degree_xy(self.P4))
     xy_result = sorted([(1, 2),
                         (2, 1),
                         (2, 2),
                         (2, 2),
                         (1, 2),
                         (2, 1)])
     assert_equal(xy, xy_result)
Exemplo n.º 7
0
 def test_node_degree_xy_undirected(self):
     xy = sorted(nx.node_degree_xy(self.P4))
     xy_result = sorted([(1, 2),
                         (2, 1),
                         (2, 2),
                         (2, 2),
                         (1, 2),
                         (2, 1)])
     assert xy == xy_result
Exemplo n.º 8
0
 def test_node_degree_xy_multigraph(self):
     xy = sorted(nx.node_degree_xy(self.M))
     xy_result = sorted([(2, 3),
                         (2, 3),
                         (3, 2),
                         (3, 2),
                         (2, 3),
                         (3, 2),
                         (1, 2),
                         (2, 1)])
     assert_equal(xy, xy_result)
Exemplo n.º 9
0
 def test_node_degree_xy_multigraph(self):
     xy = sorted(nx.node_degree_xy(self.M))
     xy_result = sorted([(2, 3),
                         (2, 3),
                         (3, 2),
                         (3, 2),
                         (2, 3),
                         (3, 2),
                         (1, 2),
                         (2, 1)])
     assert xy == xy_result
 def test_node_degree_xy_selfloop(self):
     xy = sorted(nx.node_degree_xy(self.S))
     xy_result = sorted([(2, 2), (2, 2)])
     assert xy == xy_result
Exemplo n.º 11
0
 def test_node_degree_xy_selfloop(self):
     xy = sorted(nx.node_degree_xy(self.S))
     xy_result = sorted([(2, 2),
                         (2, 2)])
     assert_equal(xy, xy_result)
Exemplo n.º 12
0
 def test_node_degree_xy_undirected_nodes(self):
     xy = sorted(nx.node_degree_xy(self.P4, nodes=[0, 1, -1]))
     xy_result = sorted([(1, 2),
                         (2, 1), ])
     assert_equal(xy, xy_result)