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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
#!/usr/bin/env python
"""
Davis Southern Club Women
Shows how to make unipartite projections of the graph and compute the
properties of those graphs.
These data were collected by Davis et al
in the 1930s. They represent observed attendance at 14 social events
by 18 Southern women. The graph is bipartite (clubs, women).
Data from:
http://vlado.fmf.uni-lj.si/pub/networks/data/Ucinet/UciData.htm
"""
__author__ = """Aric Hagberg (hagberg@lanl.gov)"""
__date__ = "$Date: 2005-05-12 14:33:11 -0600 (Thu, 12 May 2005) $"
__credits__ = """"""
__revision__ = "$Revision: 998 $"
# Copyright (C) 2004 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
# All rights reserved.
# BSD license.
import string
import networkx as nx
def davis_club_graph(create_using=None, **kwds):
nwomen=14
nclubs=18
G=nx.generators.empty_graph(nwomen+nclubs,create_using=create_using,**kwds)
G.clear()
G.name="Davis Southern Club Women"
women="""\
EVELYN
LAURA
THERESA
BRENDA
CHARLOTTE
FRANCES
ELEANOR
PEARL
RUTH
VERNE
MYRNA
KATHERINE
SYLVIA
NORA
HELEN
DOROTHY
OLIVIA
FLORA"""
clubs="""\
E1
E2
E3
E4
E5
E6
E7
E8
E9
E10
E11
E12
E13
E14"""
davisdat="""\
1 1 1 1 1 1 0 1 1 0 0 0 0 0
1 1 1 0 1 1 1 1 0 0 0 0 0 0
0 1 1 1 1 1 1 1 1 0 0 0 0 0
1 0 1 1 1 1 1 1 0 0 0 0 0 0
0 0 1 1 1 0 1 0 0 0 0 0 0 0
0 0 1 0 1 1 0 1 0 0 0 0 0 0
0 0 0 0 1 1 1 1 0 0 0 0 0 0
0 0 0 0 0 1 0 1 1 0 0 0 0 0
0 0 0 0 1 0 1 1 1 0 0 0 0 0
0 0 0 0 0 0 1 1 1 0 0 1 0 0
0 0 0 0 0 0 0 1 1 1 0 1 0 0
0 0 0 0 0 0 0 1 1 1 0 1 1 1
0 0 0 0 0 0 1 1 1 1 0 1 1 1
0 0 0 0 0 1 1 0 1 1 1 1 1 1
0 0 0 0 0 0 1 1 0 1 1 1 1 1
0 0 0 0 0 0 0 1 1 1 0 1 0 0
0 0 0 0 0 0 0 0 1 0 1 0 0 0
0 0 0 0 0 0 0 0 1 0 1 0 0 0"""
# women names
w={}
n=0
for name in women.split('\n'):
w[n]=name
n+=1
# club names
c={}
n=0
for name in clubs.split('\n'):
c[n]=name
n+=1
# parse matrix
row=0
for line in davisdat.split('\n'):
thisrow=list(map(int,line.split(' ')))
for col in range(0,len(thisrow)):
if thisrow[col]==1:
G.add_edge(w[row],c[col])
row+=1
return (G,list(w.values()),list(c.values()))
def project(B,pv,result=False,**kwds):
"""
Returns a graph that is the unipartite projection of the
bipartite graph B onto the set of nodes given in list pv.
The nodes retain their names and are connected if they share a
common node in the vertex set of {B not pv}.
No attempt is made to verify that the input graph B is bipartite.
"""
if result:
G=result
else:
G=nx.Graph(**kwds)
for v in pv:
G.add_node(v)
for cv in B.neighbors(v):
G.add_edges_from([(v,u) for u in B.neighbors(cv)])
return G
if __name__ == "__main__":
# return graph and women and clubs lists
(G,women,clubs)=davis_club_graph()
# project bipartite graph onto women nodes
W=project(G,women)
# project bipartite graph onto club nodes
C=project(G,clubs)
print("Degree distributions of projected graphs")
print('')
print("Member #Friends")
for v in W:
print('%s %d' % (v,W.degree(v)))
print('')
print("Clubs #Members")
for v in C:
print('%s %d' % (v,C.degree(v)))
|
