ó Êðh‘ ãóp•SrSSKrSS/r\R"SS9S5r\R"SS9S5rg) z$ Utilities for connectivity package éNÚ!build_auxiliary_node_connectivityÚ!build_auxiliary_edge_connectivityT)Ú returns_graphcóö•UR5n0n[R"5n[U5HFupEXBU'UR US3US9 UR US3US9 UR US3US3SS9 MH /nUR 5HHupxURX'S3X(S345 U(aM+URX(S3X'S345 MJ URUSS9 X#RS'U$)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 ÚX/var/www/html/env/lib/python3.13/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óš•UR5(aT[R"5nURUR 55 UR UR 5SS9 U$[R"5nURUR 55 UR 5Hup#UR X#4X24/SS9 M U$)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 )rrrÚ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©r rÚr)sYðñóà .Ð0SÐ T€ð×Ò Ñ%ñ1 ó&ð1 ðh×Ò Ñ%ñó&ñr