o
    ˷e                     @   s  d Z ddlmZ ddlZddlm  mZ e	 Z
e
jd Ze
jd Zed eee
ee ee
eZe  ed eD ]Zeee de  q?ee
eZe  ed eD ]Zeejed	d
 de  q]eje
ddZee
e e  dS )aM  
==========
Davis Club
==========

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).
    NtopbottomzBiadjacency matrixz#Friends, Member z#Friend meetings, Memberweight)r   i  )seed)__doc__matplotlib.pyplotpyplotpltnetworkxnxnetworkx.algorithms.bipartite
algorithms	bipartitedavis_southern_women_graphGgraphwomenclubsprintbiadjacency_matrixprojected_graphWwdegreeweighted_projected_graphspring_layoutposdrawshow r    r    |/var/www/ideatree/venv/lib/python3.10/site-packages/../../../share/doc/networkx-2.8.6/examples/algorithms/plot_davis_club.py<module>   s,    

