+ )•üi‘ ãó~€Rt^RItRR.t]P!RR7R4t]P!RR7R4tR#)z$ Utilities for connectivity package NÚ!build_auxiliary_node_connectivityÚ!build_auxiliary_edge_connectivityT)Ú returns_graphcó0€VP4p/p\P!4p\V4FOwrEWBV&VP V R2VR7VP V R2VR7VP V R2V R2^R7KQ .pVP 4FYwrxVPW', R2W(, R234V'dK4VPW(, R2W', R234K[ VPV^R7W#PR&V#)a×Creates a directed graph D from an undirected graph G to compute flow based node connectivity. For an undirected graph G having `n` nodes and `m` edges we derive a directed graph D with `2n` nodes and `2m+n` arcs by replacing each original node `v` with two nodes `vA`, `vB` linked by an (internal) arc in D. Then for each edge (`u`, `v`) in G we add two arcs (`uB`, `vA`) and (`vB`, `uA`) in D. Finally we set the attribute capacity = 1 for each arc in D [1]_. For a directed graph having `n` nodes and `m` arcs we derive a directed graph D with `2n` nodes and `m+n` arcs by replacing each original node `v` with two nodes `vA`, `vB` linked by an (internal) arc (`vA`, `vB`) in D. Then for each arc (`u`, `v`) in G we add one arc (`uB`, `vA`) in D. Finally we set the attribute capacity = 1 for each arc in D. A dictionary with a mapping between nodes in the original graph and the auxiliary digraph is stored as a graph attribute: D.graph['mapping']. References ---------- .. [1] Kammer, Frank and Hanjo Taubig. Graph Connectivity. in Brandes and Erlebach, 'Network Analysis: Methodological Foundations', Lecture Notes in Computer Science, Volume 3418, Springer-Verlag, 2005. https://doi.org/10.1007/978-3-540-31955-9_7 ÚA)ÚidÚB©ÚcapacityÚmapping) Ú is_directedÚnxÚDiGraphÚ enumerateÚadd_nodeÚadd_edgeÚedgesÚappendÚadd_edges_fromÚgraph) ÚGÚdirectedr ÚHÚiÚnoderÚsourceÚtargets & Úd/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/algorithms/connectivity/utils.pyrr s€ð<}‰}‹€Hà€GÜ Š ‹ €Aä˜Q–<‰ˆØ‰ Ø ‰ aS˜7˜tˆ Ô$Ø ‰ aS˜7˜tˆ Ô$Ø ‰ aS˜7˜q˜c ˜G¨aˆ Ö0ñ  ð €EØŸ'™'ž)‰ˆØ ‰ ˜Ð)¨Ð+°µÐ/@ÀÐ-BÐCÔD߉xØ L‰L˜W_Ð-¨QÐ/°GµOÐ3DÀAÐ1FÐGÖ Hñ$ð×ÑU QÐÔ'ð!‡GGˆIÑØ €Hócó¨€VP4'dX\P!4pVPVP 44VP VP 4^R7V#\P!4pVPVP 44VP 4Fwr#VP W#3W23.^R7K V#)a*Auxiliary digraph for computing flow based edge connectivity If the input graph is undirected, we replace each edge (`u`,`v`) with two reciprocal arcs (`u`, `v`) and (`v`, `u`) and then we set the attribute 'capacity' for each arc to 1. If the input graph is directed we simply add the 'capacity' attribute. Part of algorithm 1 in [1]_ . References ---------- .. [1] Abdol-Hossein Esfahanian. Connectivity Algorithms. (this is a chapter, look for the reference of the book). http://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf r )r r rÚadd_nodes_fromÚnodesrr)rrrrs& rrr?s €ð ‡}}‡‚Ü JŠJ‹LˆØ ×јŸ™›Ô#Ø ×јŸ™›¨QÐÔ/؈ä JŠJ‹LˆØ ×јŸ™›Ô#ØŸg™gži‰NˆFØ × Ñ ˜vÐ.°Ð0@ÐAÈAÐ Ö Nñ(àˆr)Ú__doc__Únetworkxr Ú__all__Ú _dispatchablerr©rrÚr'sYðñóà .Ð0SÐ T€ð×Ò Ô%ñ1 ó&ð1 ðh×Ò Ô%ñó&òr