a
    Oˆc¤4  ã                   @   sØ   d Z ddlmZ ddlmZmZ ddlmZ ddlZ	ddl
mZ g d¢ZdZd	Zd
d„ eeƒD ƒZdd„ Zedƒddd„ƒZdd„ Zedƒdd„ ƒZedƒdd„ ƒZedƒdd„ ƒZedƒdd„ ƒZedƒdd„ ƒZdS )z*Functions for analyzing triads of a graph.é    )Údefaultdict)ÚcombinationsÚpermutations)ÚsampleN)Únot_implemented_for)Útriadic_censusÚis_triadÚall_tripletsÚ
all_triadsÚtriads_by_typeÚ
triad_typeÚrandom_triad)@é   é   r   é   r   é   é   é   r   r   é   é   r   r   r   é   r   r   r   r   r   é	   r   é   r   é
   r   é   r   r   é   é   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   r   é   )Ú003Ú012Ú102Ú021DÚ021UÚ021CÚ111DÚ111UÚ030TÚ030CÚ201Ú120DÚ120UÚ120CÚ210Ú300c                 C   s   i | ]\}}|t |d   “qS )r   )ÚTRIAD_NAMES)Ú.0ÚiÚcode© r2   ú]/home/yuhw/wc/wire-cell-python/wcpy/lib/python3.9/site-packages/networkx/algorithms/triads.pyÚ
<dictcomp>u   ó    r4   c                    sJ   ||df||df||df||df||df||dff}t ‡ fdd„|D ƒƒS )	zñReturns the integer code of the given triad.

    This is some fancy magic that comes from Batagelj and Mrvar's paper. It
    treats each edge joining a pair of `v`, `u`, and `w` as a bit in
    the binary representation of an integer.

    r   r   r   r   r   é    c                 3   s$   | ]\}}}|ˆ | v r|V  qd S ©Nr2   )r/   ÚuÚvÚx©ÚGr2   r3   Ú	<genexpr>�   r5   z_tricode.<locals>.<genexpr>)Úsum)r<   r9   r8   ÚwZcombosr2   r;   r3   Ú_tricodex   s    4r@   Z
undirectedc                    s.  t ˆ  |¡ƒ‰|dur.t|ƒtˆƒkr.tdƒ‚tˆ ƒ‰ˆtˆƒ }dd„ tˆƒD ƒ}|r~ˆ jˆ }| ‡fdd„t|ƒD ƒ¡ ‡ fdd„ˆ D ƒ}‡ fdd„ˆ D ƒ‰|rø‡ fd	d„|D ƒ‰t‡‡fd
d„|D ƒƒ}|d }t‡‡fdd„|D ƒƒ}|d }	dd„ tD ƒ}
ˆD �]Ð}|| }ˆ| }|�r6d } } }}|D �]^}|| || k�rV�q:|| }||B ||h }|D ]p}|| || k �s¾|| ||   k �r¬|| k �rrn n0||| v�rrt	ˆ |||ƒ}|
t
|   d7  < �qr||v �r|
d  ˆt|ƒ d 7  < n|
d  ˆt|ƒ d 7  < |�r:|ˆv�r:ˆ| }|t||ˆ @ ƒ7 }|t|| ˆ ƒ7 }ˆ| }|t||ˆ @ ƒ7 }|t|| ˆ ƒ7 }�q:|�r
|
d  |||d   7  < |
d  |	||d   7  < �q
ˆˆd  ˆd  d }||d  |d  d }|| }|t|
 ¡ ƒ |
d< |
S )a·  Determines the triadic census of a directed graph.

    The triadic census is a count of how many of the 16 possible types of
    triads are present in a directed graph. If a list of nodes is passed, then
    only those triads are taken into account which have elements of nodelist in them.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph
    nodelist : list
        List of nodes for which you want to calculate triadic census

    Returns
    -------
    census : dict
       Dictionary with triad type as keys and number of occurrences as values.

    Notes
    -----
    This algorithm has complexity $O(m)$ where $m$ is the number of edges in
    the graph.

    Raises
    ------
    ValueError
        If `nodelist` contains duplicate nodes or nodes not in `G`.
        If you want to ignore this you can preprocess with `set(nodelist) & G.nodes`

    See also
    --------
    triad_graph

    References
    ----------
    .. [1] Vladimir Batagelj and Andrej Mrvar, A subquadratic triad census
        algorithm for large sparse networks with small maximum degree,
        University of Ljubljana,
        http://vlado.fmf.uni-lj.si/pub/networks/doc/triads/triads.pdf

    Nz3nodelist includes duplicate nodes or nodes not in Gc                 S   s   i | ]\}}||“qS r2   r2   ©r/   r0   Únr2   r2   r3   r4   ·   r5   z"triadic_census.<locals>.<dictcomp>c                 3   s   | ]\}}||ˆ  fV  qd S r7   r2   rA   )ÚNr2   r3   r=   »   r5   z!triadic_census.<locals>.<genexpr>c                    s*   i | ]"}|ˆ j |  ¡ ˆ j|  ¡ B “qS r2   ©ÚpredÚkeysÚsucc©r/   rB   r;   r2   r3   r4   À   r5   c                    s*   i | ]"}|ˆ j |  ¡ ˆ j|  ¡ @ “qS r2   rD   rH   r;   r2   r3   r4   Á   r5   c                    s*   i | ]"}|ˆ j |  ¡ ˆ j|  ¡ A “qS r2   rD   rH   r;   r2   r3   r4   Ä   r5   c                 3   s(   | ] }ˆ| D ]}|ˆ vrd V  qqdS ©r   Nr2   ©r/   rB   Znbr)ÚnodesetÚsgl_nbrsr2   r3   r=   Æ   r5   r   c                 3   s(   | ] }ˆ | D ]}|ˆvrd V  qqdS rI   r2   rJ   )Údbl_nbrsrK   r2   r3   r=   È   r5   c                 S   s   i | ]
}|d “qS )r   r2   )r/   Únamer2   r2   r3   r4   Ì   r5   r   r   r    r   r   r   )ÚsetZnbunch_iterÚlenÚ
ValueErrorÚ	enumerateÚnodesÚupdater>   r.   r@   ÚTRICODE_TO_NAMEÚvalues)r<   ZnodelistZNnotÚmZnot_nodesetZnbrsZsglZsgl_edges_outsideZdblZdbl_edges_outsideZcensusr9   ZvnbrsZ	dbl_vnbrsZsgl_unbrs_bdyZsgl_unbrs_outZdbl_unbrs_bdyZdbl_unbrs_outr8   ZunbrsZ	neighborsr?   r1   Z	sgl_unbrsZ	dbl_unbrsZtotal_trianglesZtriangles_without_nodesetZtotal_censusr2   )r<   rC   rM   rK   rL   r3   r   „   sd    +


H
 r   c                    sD   t ˆ tjƒr@ˆ  ¡ dkr@t ˆ ¡r@t‡ fdd„ˆ  ¡ D ƒƒs@dS dS )zÎReturns True if the graph G is a triad, else False.

    Parameters
    ----------
    G : graph
       A NetworkX Graph

    Returns
    -------
    istriad : boolean
       Whether G is a valid triad
    r   c                 3   s   | ]}||fˆ   ¡ v V  qd S r7   )ÚedgesrH   r;   r2   r3   r=     r5   zis_triad.<locals>.<genexpr>TF)Ú
isinstanceÚnxZGraphÚorderZis_directedÚanyrS   r;   r2   r;   r3   r   ÿ   s
    r   c                 C   s   t |  ¡ dƒ}|S )zóReturns a generator of all possible sets of 3 nodes in a DiGraph.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph

    Returns
    -------
    triplets : generator of 3-tuples
       Generator of tuples of 3 nodes
    r   )r   rS   )r<   Útripletsr2   r2   r3   r	     s    r	   c                 c   s,   t |  ¡ dƒ}|D ]}|  |¡ ¡ V  qdS )zäA generator of all possible triads in G.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph

    Returns
    -------
    all_triads : generator of DiGraphs
       Generator of triads (order-3 DiGraphs)
    r   N)r   rS   ÚsubgraphÚcopy)r<   r]   Ztripletr2   r2   r3   r
   %  s    r
   c                 C   s4   t | ƒ}ttƒ}|D ]}t|ƒ}||  |¡ q|S )a  Returns a list of all triads for each triad type in a directed graph.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph

    Returns
    -------
    tri_by_type : dict
       Dictionary with triad types as keys and lists of triads as values.
    )r
   r   Úlistr   Úappend)r<   Zall_triZtri_by_typeZtriadrN   r2   r2   r3   r   8  s    r   c                 C   st  t | ƒst d¡‚t|  ¡ ƒ}|dkr*dS |dkr6dS |dkr®|  ¡ \}}t|ƒt|ƒkr^dS |d |d krrdS |d |d kr†d	S |d |d ks¦|d |d krªd
S �nÂ|dk�rpt|  ¡ dƒD ]¤\}}}t|ƒt|ƒk� rü|d |v � rö dS  dS t|ƒ t|ƒ¡t|ƒkrÆ|d |d |d h|d |d |d h  k�rZt|  ¡ ƒk�rdn n dS  dS qÆ�n |dk�rTt|  ¡ dƒD ]È\}}}}t|ƒt|ƒk�rˆt|ƒt|ƒk�r¾ dS |d h|d h  k�rðt|ƒ 	t|ƒ¡k�rún n dS |d h|d h  k�r,t|ƒ 	t|ƒ¡k�r6n n dS |d |d k�rˆ dS �qˆn|dk�rbdS |dk�rpdS dS )aM  Returns the sociological triad type for a triad.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph with 3 nodes

    Returns
    -------
    triad_type : str
       A string identifying the triad type

    Notes
    -----
    There can be 6 unique edges in a triad (order-3 DiGraph) (so 2^^6=64 unique
    triads given 3 nodes). These 64 triads each display exactly 1 of 16
    topologies of triads (topologies can be permuted). These topologies are
    identified by the following notation:

    {m}{a}{n}{type} (for example: 111D, 210, 102)

    Here:

    {m}     = number of mutual ties (takes 0, 1, 2, 3); a mutual tie is (0,1)
              AND (1,0)
    {a}     = number of assymmetric ties (takes 0, 1, 2, 3); an assymmetric tie
              is (0,1) BUT NOT (1,0) or vice versa
    {n}     = number of null ties (takes 0, 1, 2, 3); a null tie is NEITHER
              (0,1) NOR (1,0)
    {type}  = a letter (takes U, D, C, T) corresponding to up, down, cyclical
              and transitive. This is only used for topologies that can have
              more than one form (eg: 021D and 021U).

    References
    ----------
    .. [1] Snijders, T. (2012). "Transitivity and triads." University of
        Oxford.
        https://web.archive.org/web/20170830032057/http://www.stats.ox.ac.uk/~snijders/Trans_Triads_ha.pdf
    z"G is not a triad (order-3 DiGraph)r   r   r   r   r   r    r!   r"   r#   r   r%   r$   r'   r&   r   r(   r)   r*   r+   r   r,   r   r-   N)
r   rZ   ZNetworkXAlgorithmErrorrP   rX   rO   r   Úsymmetric_differencerS   Úintersection)r<   Z	num_edgesÚe1Úe2Ze3Ze4r2   r2   r3   r   P  sT    )
 
H
66

r   c                 C   s    t t|  ¡ ƒdƒ}|  |¡}|S )zâReturns a random triad from a directed graph.

    Parameters
    ----------
    G : digraph
       A NetworkX DiGraph

    Returns
    -------
    G2 : subgraph
       A randomly selected triad (order-3 NetworkX DiGraph)
    r   )r   r`   rS   r^   )r<   rS   ZG2r2   r2   r3   r   ¨  s    
r   )N)Ú__doc__Úcollectionsr   Ú	itertoolsr   r   Úrandomr   ZnetworkxrZ   Znetworkx.utilsr   Ú__all__ZTRICODESr.   rR   rU   r@   r   r   r	   r
   r   r   r   r2   r2   r2   r3   Ú<module>   s0   Ez



W
