/usr/lib/python2.7/dist-packages/networkx/algorithms/assortativity/tests/test_pairs.py is in python-networkx 1.8.1-0ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 | #!/usr/bin/env python
from nose.tools import *
import networkx as nx
from base_test import BaseTestAttributeMixing,BaseTestDegreeMixing
class TestAttributeMixingXY(BaseTestAttributeMixing):
def test_node_attribute_xy_undirected(self):
attrxy=sorted(nx.node_attribute_xy(self.G,'fish'))
attrxy_result=sorted([('one','one'),
('one','one'),
('two','two'),
('two','two'),
('one','red'),
('red','one'),
('blue','two'),
('two','blue')
])
assert_equal(attrxy,attrxy_result)
def test_node_attribute_xy_undirected_nodes(self):
attrxy=sorted(nx.node_attribute_xy(self.G,'fish',
nodes=['one','yellow']))
attrxy_result=sorted( [
])
assert_equal(attrxy,attrxy_result)
def test_node_attribute_xy_directed(self):
attrxy=sorted(nx.node_attribute_xy(self.D,'fish'))
attrxy_result=sorted([('one','one'),
('two','two'),
('one','red'),
('two','blue')
])
assert_equal(attrxy,attrxy_result)
def test_node_attribute_xy_multigraph(self):
attrxy=sorted(nx.node_attribute_xy(self.M,'fish'))
attrxy_result=[('one','one'),
('one','one'),
('one','one'),
('one','one'),
('two','two'),
('two','two')
]
assert_equal(attrxy,attrxy_result)
def test_node_attribute_xy_selfloop(self):
attrxy=sorted(nx.node_attribute_xy(self.S,'fish'))
attrxy_result=[('one','one'),
('two','two')
]
assert_equal(attrxy,attrxy_result)
class TestDegreeMixingXY(BaseTestDegreeMixing):
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)
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)
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)
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)
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)
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)
|