One Hat Cyber Team
Your IP :
10.30.1.1
Server IP :
103.148.201.5
Server :
Linux web-olt 5.15.0-161-generic #171-Ubuntu SMP Sat Oct 11 08:17:01 UTC 2025 x86_64
Server Software :
Apache/2.4.52 (Ubuntu)
PHP Version :
8.1.29
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
samba
/
kcc
/
__pycache__
/
Edit File:
graph_utils.cpython-310.pyc
o �/a-0 � @ s� d dl Z d dlZd dlmZ d$dd�ZG dd� de�Zdd� Zd d � Zd d � Z d d� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd� Zd%d d �Z d&d d!�Zd"d#� ZdS )'� N)� dot_graphc K st t ||fd|i|��}|r| d|�dd� 7 } tj�|d| �}|d ur*|d| � t|d�} | �|� | �� d S )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_file s r c @ s e Zd ZdS )� GraphErrorN)�__name__� __module__� __qualname__r r r r r * s r c C sd |D ]-}t � }| D ]\}}||kr|�|� q ||kr |�|� q t|�d t|�kr/td��qdS )zXThe graph is complete, which is to say there is an edge between every pair of nodes.� z graph is not fully connectedN)�set�add�lenr )�edgesr � edge_vertices�v�remotes�a�br r r �verify_graph_complete. s ���r* c s� | st |�dkr dS td��t| �}t|�� �� g }t|�D ]%\}}|\}}|� v r6� �|� |�|� q |� v rD� �|� |�|� q |sHn t|�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 c 3 s � | ] }|� vr|V qd S �Nr )�.0r& ��reachedr r � <genexpr>X s � ��z)verify_graph_connected.<locals>.<genexpr>) r# r �listr! �pop� enumerater" �append�reversedr �sorted) r$ r r% �remaining_edges�doomed�i�er( r) r r r- r �verify_graph_connected< s6 � � �r: c C s� t | �dkr t| ||�S t�| t | �d �D ]+}zt|||� W q tyA } z| D ] }||vr6td| ��q*W Y d}~qd}~ww dS )z:The graph stays connected when any single edge is removed.r r zFThe graph will be disconnected when the connection from %s to %s failsN)r# r: � itertools� combinationsr )r$ r r% �subsetr9 �edger r r �*verify_graph_connected_under_edge_failures] s �� ����r? c s> |D ]� � fdd�|D �}� fdd�| D �}t |||� qdS )z<The graph stays connected when any single vertex is removed.c s g | ]}|� ur|�qS r r �r, �x�r& r r � <listcomp>p � z@verify_graph_connected_under_vertex_failures.<locals>.<listcomp>c s g | ]}� |vr|�qS r r r@ rB r r rC q rD N)r: )r$ r r% � sub_vertices� sub_edgesr rB r �,verify_graph_connected_under_vertex_failuresl s �rG c C sl dd� | D �} t �|d�D ]$\}}||@ }|r2t|�dkr)||O }|�|� n td|| |f ��qdS q)z The graph contains no loops.c S � g | ]}t |��qS r �r! �r, r9 r r r rC w � 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$ r r% �treesr( r) � intersectionr r r �verify_graph_forestu s ���rP c C sj t | �}dd� |D �} t�|d�D ] \}}||@ }|r1t|�dkr-||O }|�|� ntd��qdS q )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' c S rH r rI rJ r r r rC � rK z2verify_graph_multi_edge_forest.<locals>.<listcomp>TrL r z there is a loop in the graphN)r! r; r< r# rM r )r$ r r% � unique_edgesrN r( r) rO r r r � verify_graph_multi_edge_forest� s ��rR c C s. t |�t |� }|rtdd�t|�� ��dS )z$There are no vertices without edges.z#some vertices are not connected: %s� N�r! r r r5 )r$ r r% �lonelyr r r � verify_graph_no_lonely_vertices� � ��rV c C s. t |�t |� }|rtdd�t|�� ��dS )zBThe edge endpoints contain no vertices that are otherwise unknown.z,some edge vertices are seemingly unknown: %srS NrT )r$ r r% �unknownr r r � verify_graph_no_unknown_vertices� rW rY c s� | s t |�dkr dS t | �dt |� k rtd��t| �}t� }| D ]!}|d |d f}||v rB||v rB|�|� |�|� |�|� 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 ) a7 Each 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 NrL zFdirected double ring requires at least twice as many edges as verticesr z2wanted double directed ring, found a leaf node(%s)c 3 s � | ] }|� kr|V qd S r+ r r@ ��nr r r/ � 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# r r! r" rM � setdefault�itemsr0 �keys�updater r? rG )r$ r r% � half_duplex� duplex_linksr> �rev_edge�edge_mapr( r) �vertex� neighbours�nset� n_neighboursr rZ r �!verify_graph_directed_double_ring� sT � �� ���rh c C sr t |�dk rdS t |�dkr3 t | �dkr/| d d | d d kr/| d d | d d kr/dS td��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.rL Nr r z0A two vertex graph should have an edge each way.)r# r rh )r$ r r% r r r �*verify_graph_directed_double_ring_or_small s ri Fr c C s� g }dd� |D �}t � }| D ]\}}|�|� |�|� q|d u r$|}nt |�}|D ].}d| } t� | } z| | ||� W q* tyX } z|�|| | jf� W Y d } ~ q*d } ~ ww |S )Nc S s g | ]}|� d d��qS )� r )r r@ r r r rC rD z verify_graph.<locals>.<listcomp>zverify_graph_%s)r! r" �globalsr r3 �__doc__) r$ r �directed� properties�errorsr% r( r) �p�fnr r9 r r r � verify_graph s& ��rr Tc C s� | d urt | |||| |||| | | d� | rNt|||d�}|rPd| |p#df }|d| � |D ] \}}}|d||f � q.|rRtd|d�d d � |D ��f ��d S d S d S ) N) r r r �reformat_labelsrm r � edge_colors� edge_labels� vertex_colors)rn z%s %sr z %s FAILED:z %18s: %sz1The '%s' graph lacks the following properties: %srS c s s" � | ] \}}}d ||f V qdS )z%s: %sNr )r, rp r9 �docr r r r/ L s � �z!verify_and_dot.<locals>.<genexpr>)r rr r r )r r$ r r rs rm rn �fatalr �verifyr rt ru rv ro r rp r9 rw r r r �verify_and_dot3 s2 �� ���rz c C sV t t� �� �D ]!\} }| �d�r(t| �dd�� |jr%td|j�� � qt� qd S )N� verify_graph_r z %s)r5 rk r] � startswith�printr rl �rstrip)�kr& r r r �list_verify_testsP s ��r� )NNNN)NFr ) NNTFr TNTNNNN)r r; � samba.graphr r � Exceptionr r* r: r? rG rP rR rV rY rh ri rr rz r� r r r r �<module> s4 �! P �
Simpan