b-0ddlZddlZddlmZ ddZGddeZdZdZdZ d Z d Z d Z d Z d ZdZdZddZ ddZdZdS)N) dot_graphc :t||fd|i|}|r|d|ddzz }tj|d|z}||d|zt |d} | || dS)Ntitle_, z%s.dotzwriting graph to %sw)rreplaceospathjoinopenwriteclose) basename edge_listverticeslabel dot_file_dirdebugkwargssfilenamefs 7/usr/lib/python3/dist-packages/samba/kcc/graph_utils.pywrite_dot_filers(I==U=f==A 2C%--b1111w||L(X*=>>H  #h./// XsAGGAJJJGGIIIIIceZdZdS) GraphErrorN)__name__ __module__ __qualname__rrrr*sDrrc|D]}t}|D]<\}}||kr||!||kr||=t|dzt|krtddS)zXThe graph is complete, which is to say there is an edge between every pair of nodes.zgraph is not fully connectedN)setaddlenr)edgesr edge_verticesvremotesabs rverify_graph_completer/.s==%%  DAqAvv Aa A w<z)verify_graph_connected..Xs9--aG++++++--r) r(rlistr&pop enumerater'appendreversedr sorted) r)rr*remaining_edgesdoomedier-r.rr4s @rverify_graph_connectedr@<s 0 x==A   F/00 05kkO/%%''((G #o.. ! !DAqDAqG|| A a    g A a     &!! # #A"" #'S]]22= UZZ----6(#3#3----- -mm 32rc&t|dkrt|||Stj|t|dz D]F} t|||#t$r%}|D]}||vrt d|zYd}~?d}~wwxYwdS)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*subsetr?edges r*verify_graph_connected_under_edge_failuresrF]s 5zzQ%eX}EEE(E Q??NN N "68] C C C C N N N N Nv%%$&FHL&MNNN& N N N N N NNNs A B)B  Bcl|D]/fd|D}fd|D}t|||0dS)zz@verify_graph_connected_under_vertex_failures..ps:::aqzzzzzrcg|]}|v| Sr#r#rIs rrKz@verify_graph_connected_under_vertex_failures..qs4441!QrN)r@)r)rr* sub_vertices sub_edgesr+s @r,verify_graph_connected_under_vertex_failuresrOlsiFF::::8::: 4444444 y, EEEEFFrc d|D} tj|dD]S\}}||z}|rGt|dkr||z}||nt d|d|d|TdSl) zThe graph contains no loops.c,g|]}t|Sr#r&r3r?s rrKz'verify_graph_forest..ws # # #SVV # # #rTr%z'there is a loop in the graph vertices z edges z intersection N)rBrCr(remover)r)rr*treesr-r. intersections rverify_graph_forestrXus # #U # # #E*5!44  DAqq5L F|$$))FALLOOOE$*'/hh||&EFFF F" F)rct|}d|D} tj|dD]J\}}||z}|r>t|dkr||z}||nt dKdSc)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,g|]}t|Sr#rRrSs rrKz2verify_graph_multi_edge_forest..s * * *SVV * * *rTrTr%zthere is a loop in the graphN)r&rBrCr(rUr)r)rr* unique_edgesrVr-r.rWs rverify_graph_multi_edge_forestr\su::L * *\ * * *E *5!44  DAqq5L E|$$))FALLOOOE$%CDDD  E F rct|t|z }|r2tddt|zdS)z$There are no vertices without edges.z#some vertices are not connected: %s Nr&rr r;)r)rr*lonelys rverify_graph_no_lonely_verticesras[ ]]S// /F 4?6&>>22344 444rct|t|z }|r2tddt|zdS)zBThe edge endpoints contain no vertices that are otherwise unknown.z,some edge vertices are seemingly unknown: %sr^Nr_)r)rr*unknowns r verify_graph_no_unknown_verticesrds[-  3x==0G5H6'??33455 555rc|st|dkrdSt|dt|zkrtdt|}t}|D]Y}|d|df}||vrC||vr?||||||Zi}|D]o\}} ||t| || t|p|D]*\} } t| dkrtd| z+t|D]S} || } | s | D]@|} | | | fd| DA|| =Tt|dkr7tdd |zt|||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%NrTzFdirected double ring requires at least twice as many edges as verticesrz2wanted double directed ring, found a leaf node(%s)c3(K|] }|k|V dSr2r#)r3rJns rr5z4verify_graph_directed_double_ring..s'::a1666666::rzZwanted double directed ring, but this looks like a split graph (%s can't reach each other)r) r(rr&r'rU setdefaultitemsr6keysupdater rFrO)r)rr* half_duplex duplex_linksrErev_edgeedge_mapr-r.vertex neighboursnset n_neighboursrgs @r!verify_graph_directed_double_ringrts$ S]]a'' 5zzAH %%%566 6e**K55L))GT!W% ;  8{#:#:   T " " "   t $ $ $   x ( ( (H--1Asuu%%))!,,,Asuu%%))!,,,,'nn.... z??a  $&,-.. . x}}''   ; ;A#A;L    ' ' '   ::::4::: : : : : V   8}}q78==??33455 5 /|X/<>>>0x1>@@@@@rc6t|dkrdSt|dkra t|dkr>|dd|ddkr |dd|ddkrdStdt|||S)zThis performs the directed_double_ring test but makes special concessions for small rings where the strict rules don't really apply.rTNrr%z0A two vertex graph should have an edge each way.)r(rrt)r)rr*s r*verify_graph_directed_double_ring_or_smallrv s 8}}q 8}}L JJ!OO !HQK58A; & & !HQK58A; & & FKLLL ,UHm L LLrFr#cg}d|D}t}|D]/\}}||||0||}nt|}|D]]}d|z} t| } | |||*#t$r'} ||| | jfYd} ~ Vd} ~ wwxYw|S)Nc:g|]}|ddS) r)r )r3rJs rrKz verify_graph..s&:::!!))C%%:::rzverify_graph_%s)r&r'globalsrr9__doc__) r)rdirected propertieserrorsr*r-r.pfnrr?s r verify_graphrs  F::z:::JEEM1!! x== --  " IIbM - AeX} - - - - - - - MM1a+ , , , , , , , , - Ms B CB;;CTc >| t||||| |||| | |  | rzt|||}|rh|d|pd}|d|z|D]\}}}|d|dd||r6td|d d d |DdSdSdS) N) rrrreformat_labelsr|r edge_colors edge_labels vertex_colors)r}ryrz %s FAILED:z>18: zThe 'z(' graph lacks the following properties: r^c3,K|]\}}}|d|VdS)rNr#)r3rr?docs rr5z!verify_and_dot..LsQ3L3L7@q!S@Aqq!!3D3L3L3L3L3L3Lr)rrrr )rr)rrrr|r}fatalrverifyrrrrr~rrr?rs rverify_and_dotr3sXx$0'6" #.m  M M M M  NeX)3555  N'xx"5E E,& ' ' '# , , 1cQQQQ*++++ N j"'%%3L3LDJ3L3L3L*L*L*L"MNNN N N N N  N NrcZttD]|\}}|drbt |dd|jr*t d|jznt }dS)N verify_graph_rz %s)r;rzri startswithprintr r{rstrip)kr+s rlist_verify_testsrPswyy(())1 << ( (  !))OR00 1 1 1y h!)"2"2"4"456666 r)NNNN)NFr#) NNTFr#TNTNNNN)r rB samba.graphrr Exceptionrr/r@rFrOrXr\rardrtrvrrrr#rrrsu* !!!!!!>B,0             = = =B N N NFFF44444555M@M@M@`MMM"2:>2748-115!% NNNN:r