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
|
#!/usr/bin/env python
from nose.tools import *
import networkx
class TestBlock:
def test_path(self):
G=networkx.path_graph(6)
partition=[[0,1],[2,3],[4,5]]
M=networkx.blockmodel(G,partition)
assert_equal(sorted(M.nodes()),[0,1,2])
assert_equal(sorted(M.edges()),[(0,1),(1,2)])
for n in M.nodes():
assert_equal(M.node[n]['nedges'],1)
assert_equal(M.node[n]['nnodes'],2)
assert_equal(M.node[n]['density'],1.0)
def test_multigraph_path(self):
G=networkx.MultiGraph(networkx.path_graph(6))
partition=[[0,1],[2,3],[4,5]]
M=networkx.blockmodel(G,partition,multigraph=True)
assert_equal(sorted(M.nodes()),[0,1,2])
assert_equal(sorted(M.edges()),[(0,1),(1,2)])
for n in M.nodes():
assert_equal(M.node[n]['nedges'],1)
assert_equal(M.node[n]['nnodes'],2)
assert_equal(M.node[n]['density'],1.0)
def test_directed_path(self):
G = networkx.DiGraph()
G.add_path(list(range(6)))
partition=[[0,1],[2,3],[4,5]]
M=networkx.blockmodel(G,partition)
assert_equal(sorted(M.nodes()),[0,1,2])
assert_equal(sorted(M.edges()),[(0,1),(1,2)])
for n in M.nodes():
assert_equal(M.node[n]['nedges'],1)
assert_equal(M.node[n]['nnodes'],2)
assert_equal(M.node[n]['density'],0.5)
def test_directed_multigraph_path(self):
G = networkx.MultiDiGraph()
G.add_path(list(range(6)))
partition=[[0,1],[2,3],[4,5]]
M=networkx.blockmodel(G,partition,multigraph=True)
assert_equal(sorted(M.nodes()),[0,1,2])
assert_equal(sorted(M.edges()),[(0,1),(1,2)])
for n in M.nodes():
assert_equal(M.node[n]['nedges'],1)
assert_equal(M.node[n]['nnodes'],2)
assert_equal(M.node[n]['density'],0.5)
@raises(networkx.NetworkXException)
def test_overlapping(self):
G=networkx.path_graph(6)
partition=[[0,1,2],[2,3],[4,5]]
M=networkx.blockmodel(G,partition)
def test_weighted_path(self):
G=networkx.path_graph(6)
G[0][1]['weight']=1
G[1][2]['weight']=2
G[2][3]['weight']=3
G[3][4]['weight']=4
G[4][5]['weight']=5
partition=[[0,1],[2,3],[4,5]]
M=networkx.blockmodel(G,partition)
assert_equal(sorted(M.nodes()),[0,1,2])
assert_equal(sorted(M.edges()),[(0,1),(1,2)])
assert_equal(M[0][1]['weight'],2)
assert_equal(M[1][2]['weight'],4)
for n in M.nodes():
assert_equal(M.node[n]['nedges'],1)
assert_equal(M.node[n]['nnodes'],2)
assert_equal(M.node[n]['density'],1.0)
def test_barbell(self):
G=networkx.barbell_graph(3,0)
partition=[[0,1,2],[3,4,5]]
M=networkx.blockmodel(G,partition)
assert_equal(sorted(M.nodes()),[0,1])
assert_equal(sorted(M.edges()),[(0,1)])
for n in M.nodes():
assert_equal(M.node[n]['nedges'],3)
assert_equal(M.node[n]['nnodes'],3)
assert_equal(M.node[n]['density'],1.0)
def test_barbell_plus(self):
G=networkx.barbell_graph(3,0)
G.add_edge(0,5) # add extra edge between bells
partition=[[0,1,2],[3,4,5]]
M=networkx.blockmodel(G,partition)
assert_equal(sorted(M.nodes()),[0,1])
assert_equal(sorted(M.edges()),[(0,1)])
assert_equal(M[0][1]['weight'],2)
for n in M.nodes():
assert_equal(M.node[n]['nedges'],3)
assert_equal(M.node[n]['nnodes'],3)
assert_equal(M.node[n]['density'],1.0)
|
