HEX

File: //usr/lib/python3/dist-packages/samba/kcc/__pycache__/graph_utils.cpython-310.pyc
o

�/a-0�@s�ddlZddlZddlmZ		d$dd�ZGdd�de�Zdd�Zd	d
�Zdd�Z	d
d�Z
dd�Zdd�Zdd�Z
dd�Zdd�Zdd�Zd%dd�Z						d&d d!�Zd"d#�ZdS)'�N)�	dot_graphc
Kstt||fd|i|��}|r|d|�dd�7}tj�|d|�}|dur*|d|�t|d�}	|	�|�|	��dS)N�title�_�, �z%s.dotzwriting graph to %s�w)r�replace�os�path�join�open�write�close)
�basename�	edge_list�vertices�label�dot_file_dir�debug�kwargs�s�filename�f�r�7/usr/lib/python3/dist-packages/samba/kcc/graph_utils.py�write_dot_files

rc@seZdZdS)�
GraphErrorN)�__name__�
__module__�__qualname__rrrrr*srcCsd|D]-}t�}|D]\}}||kr|�|�q	||kr |�|�q	t|�dt|�kr/td��qdS)zXThe graph is complete, which is to say there is an edge between
    every pair of nodes.�zgraph is not fully connectedN)�set�add�lenr)�edgesr�
edge_vertices�v�remotes�a�brrr�verify_graph_complete.s
���r*c
s�|st|�dkr
dStd��t|�}t|����	g}t|�D]%\}}|\}}|�vr6��|�|�|�q|�vrD��|�|�|�q|sHnt|�D]}||=qLq|s[�t|�krqd}	|	d�	�fdd�t
|�D��7}	t|	��dS)	z&There is a path between any two nodes.r Nz9all vertices are disconnected because there are no edges:TzHthe graph is not connected, as the following vertices are unreachable:
 z
 c3s�|]	}|�vr|VqdS�Nr)�.0r&��reachedrr�	<genexpr>Xs���z)verify_graph_connected.<locals>.<genexpr>)r#r�listr!�pop�	enumerater"�append�reversedr�sorted)
r$rr%�remaining_edges�doomed�i�er(r)rrr-r�verify_graph_connected<s6


�� �r:cCs�t|�dkrt|||�St�|t|�d�D]+}zt|||�WqtyA}z|D]}||vr6td|��q*WYd}~qd}~wwdS)z:The graph stays connected when any single edge is removed.rr zFThe graph will be disconnected when the connection from %s to %s failsN)r#r:�	itertools�combinationsr)r$rr%�subsetr9�edgerrr�*verify_graph_connected_under_edge_failures]s ������r?cs>|D]��fdd�|D�}�fdd�|D�}t|||�qdS)z<The graph stays connected when any single vertex is removed.csg|]}|�ur|�qSrr�r,�x�r&rr�
<listcomp>p�z@verify_graph_connected_under_vertex_failures.<locals>.<listcomp>csg|]}�|vr|�qSrrr@rBrrrCqrDN)r:)r$rr%�sub_vertices�	sub_edgesrrBr�,verify_graph_connected_under_vertex_failuresls
�rGcCsldd�|D�}	t�|d�D]$\}}||@}|r2t|�dkr)||O}|�|�ntd|||f��qdSq)zThe graph contains no loops.cS�g|]}t|��qSr�r!�r,r9rrrrCw�z'verify_graph_forest.<locals>.<listcomp>T�r zDthere is a loop in the graph
 vertices %s
 edges %s
 intersection %sN)r;r<r#�remover)r$rr%�treesr(r)�intersectionrrr�verify_graph_forestus
���rPcCsjt|�}dd�|D�}	t�|d�D]\}}||@}|r1t|�dkr-||O}|�|�ntd��qdSq)a,This allows a forest with duplicate edges. That is if multiple
    edges go between the same two vertices, they are treated as a
    single edge by this test.

    e.g.:
                        o
    pass: o-o=o  o=o   (|)             fail:  o-o
            `o          o                     `o'
    cSrHrrIrJrrrrC�rKz2verify_graph_multi_edge_forest.<locals>.<listcomp>TrLr zthere is a loop in the graphN)r!r;r<r#rMr)r$rr%�unique_edgesrNr(r)rOrrr�verify_graph_multi_edge_forest�s

��rRcCs.t|�t|�}|rtdd�t|����dS)z$There are no vertices without edges.z#some vertices are not connected:
%s�
N�r!rrr5)r$rr%�lonelyrrr�verify_graph_no_lonely_vertices����rVcCs.t|�t|�}|rtdd�t|����dS)zBThe edge endpoints contain no vertices that are otherwise unknown.z,some edge vertices are seemingly unknown:
%srSNrT)r$rr%�unknownrrr� verify_graph_no_unknown_vertices�rWrYcs�|s
t|�dkr
dSt|�dt|�krtd��t|�}t�}|D]!}|d|df}||vrB||vrB|�|�|�|�|�|�q!i}|D]\}}	|�|t���|	�|�|	t���|�qG|��D]\}
}t|�dkrttd|
��qdt|���D]&}
||
}|s�q{|D]�|�}
|
�|
�|
�	�fdd�|D��q�||
=q{t|�dkr�td	d
�
|�����t|||�t|||�dS)a7Each node has at least two directed edges leaving it, and two
    arriving. The edges work in pairs that have the same end points
    but point in opposite directions. The pairs form a path that
    touches every vertex and form a loop.

    There might be other connections that *aren't* part of the ring.

    Deciding this for sure is NP-complete (the Hamiltonian path
    problem), but there are some easy failures that can be detected.
    So far we check for:
      - leaf nodes
      - disjoint subgraphs
      - robustness against edge and vertex failure
    r NrLzFdirected double ring requires at least twice as many edges as verticesrz2wanted double directed ring, found a leaf node(%s)c3s�|]	}|�kr|VqdSr+rr@��nrrr/�s�z4verify_graph_directed_double_ring.<locals>.<genexpr>zZwanted double directed ring, but this looks like a split graph
(%s can't reach each other)r)
r#rr!r"rM�
setdefault�itemsr0�keys�updaterr?rG)r$rr%�half_duplex�duplex_linksr>�rev_edge�edge_mapr(r)�vertex�
neighbours�nset�n_neighboursrrZr�!verify_graph_directed_double_ring�sT


���
���rhcCsrt|�dkrdSt|�dkr3	t|�dkr/|dd|ddkr/|dd|ddkr/dStd��t|||�S)z�This performs the directed_double_ring test but makes special
    concessions for small rings where the strict rules don't really
    apply.rLNrr z0A two vertex graph should have an edge each way.)r#rrh)r$rr%rrr�*verify_graph_directed_double_ring_or_small	sriFrcCs�g}dd�|D�}t�}|D]\}}|�|�|�|�q|dur$|}nt|�}|D].}d|}	t�|	}
z|
|||�Wq*tyX}z|�|||
jf�WYd}~q*d}~ww|S)NcSsg|]}|�dd��qS)� r)rr@rrrrCrDz verify_graph.<locals>.<listcomp>zverify_graph_%s)r!r"�globalsrr3�__doc__)r$r�directed�
properties�errorsr%r(r)�p�fnrr9rrr�verify_graphs&

��rrTc
Cs�|
durt|||||
||||||
d�|	rNt|||d�}|rPd||p#df}|d|�|D]
\}}}|d||f�q.|rRtd|d�d	d
�|D��f��dSdSdS)N)	rrr�reformat_labelsrmr�edge_colors�edge_labels�
vertex_colors)rnz%s %srz
%s FAILED:z	 %18s: %sz1The '%s' graph lacks the following properties:
%srScss"�|]\}}}d||fVqdS)z%s: %sNr)r,rpr9�docrrrr/Ls��z!verify_and_dot.<locals>.<genexpr>)rrrrr)rr$rrrsrmrn�fatalr�verifyrrtrurvrorrpr9rwrrr�verify_and_dot3s2
�����rzcCsVtt����D]!\}}|�d�r(t|�dd��|jr%td|j���qt�qdS)N�
verify_graph_rz    %s)r5rkr]�
startswith�printrrl�rstrip)�kr&rrr�list_verify_testsPs
��r�)NNNN)NFr)NNTFrTNTNNNN)r	r;�samba.graphrr�	Exceptionrr*r:r?rGrPrRrVrYrhrirrrzr�rrrr�<module>s4
�!	P

�