hSrSSKrSSKJr SS/r\R "SSS9S Sj5r\R "SSS9S S j5rg) aEGenerators for Harary graphs This module gives two generators for the Harary graph, which was introduced by the famous mathematician Frank Harary in his 1962 work [H]_. The first generator gives the Harary graph that maximizes the node connectivity with given number of nodes and given number of edges. The second generator gives the Harary graph that minimizes the number of edges in the graph with given node connectivity and number of nodes. References ---------- .. [H] Harary, F. "The Maximum Connectivity of a Graph." Proc. Nat. Acad. Sci. USA 48, 1142-1146, 1962. N) NetworkXErrorhnm_harary_graphhkn_harary_graphT)graphs returns_graphcUS:a [S5eXS- :a [S5eXUS- -S-:a [S5e[R"X5nSU-U-nUS-S:Xd US-S:XaUS-n[U5HGn[SUS-5H1nUR XfU- U-5 UR XfU-U-5 M3 MI US-(a+US-n[U5HnUR XfU-5 M SU-U-n U S:a,[U S-5HnUR XfU-S-5 M U$US- S-n[U5HGn[SUS-5H1nUR XfU- U-5 UR XfU-U-5 M3 MI US-n[XU-- 5HnUR XfU-U-5 M U$)a Returns the Harary graph with given numbers of nodes and edges. The Harary graph $H_{n,m}$ is the graph that maximizes node connectivity with $n$ nodes and $m$ edges. This maximum node connectivity is known to be floor($2m/n$). [1]_ Parameters ---------- n: integer The number of nodes the generated graph is to contain m: integer The number of edges the generated graph is to contain create_using : NetworkX graph constructor, optional Graph type to create (default=nx.Graph). If graph instance, then cleared before populated. Returns ------- NetworkX graph The Harary graph $H_{n,m}$. See Also -------- hkn_harary_graph Notes ----- This algorithm runs in $O(m)$ time. It is implemented by following the Reference [2]_. References ---------- .. [1] F. T. Boesch, A. Satyanarayana, and C. L. Suffel, "A Survey of Some Network Reliability Analysis and Synthesis Results," Networks, pp. 99-107, 2009. .. [2] Harary, F. "The Maximum Connectivity of a Graph." Proc. Nat. Acad. Sci. USA 48, 1142-1146, 1962. z!The number of nodes must be >= 1!z&The number of edges must be >= n - 1 !z'The number of edges must be <= n(n-1)/2r)rnx empty_graphrangeadd_edge) nm create_usingHdoffsetijhalfrs R/var/www/html/env/lib/python3.13/site-packages/networkx/generators/harary_graph.pyrrsZ 1u?@@q5yDEEA;! EFF q'A A A A A aqA1fqj) 11uk* 11uk** q56D4[ 1$h'! EAI q516] 1&j1n-# Ha%AqA1fqj) 11uk* 11uk**Avqv:~&A JJqt8q. )' HcUS:a [S5eXS-:a [S5eUS:Xa[R"X5nU$[R"X5nUS-S:Xd US-S:XaUS-n[ U5HGn[ SUS-5H1nUR XUU- U-5 UR XUU-U-5 M3 MI US-(a+US-n[ U5HnUR XUU-5 M U$US- S-n[ U5HGn[ SUS-5H1nUR XUU- U-5 UR XUU-U-5 M3 MI US-n[ US-5HnUR XUU-U-5 M U$)aReturns the Harary graph with given node connectivity and node number. The Harary graph $H_{k,n}$ is the graph that minimizes the number of edges needed with given node connectivity $k$ and node number $n$. This smallest number of edges is known to be ceil($kn/2$) [1]_. Parameters ---------- k: integer The node connectivity of the generated graph n: integer The number of nodes the generated graph is to contain create_using : NetworkX graph constructor, optional Graph type to create (default=nx.Graph). If graph instance, then cleared before populated. Returns ------- NetworkX graph The Harary graph $H_{k,n}$. See Also -------- hnm_harary_graph Notes ----- This algorithm runs in $O(kn)$ time. It is implemented by following the Reference [2]_. References ---------- .. [1] Weisstein, Eric W. "Harary Graph." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/HararyGraph.html. .. [2] Harary, F. "The Maximum Connectivity of a Graph." Proc. Nat. Acad. Sci. USA 48, 1142-1146, 1962. r z#The node connectivity must be >= 1!z$The number of nodes must be >= k+1 !r r)rr path_graphr r r)krrrrrrrs rrrtsX 1uABBq5yBCC Av MM! * q'A A A aqA1fqj) 11uk* 11uk** q56D4[ 1$h'! Ha%AqA1fqj) 11uk* 11uk**AvtaxA JJqt8q. )! Hr)N) __doc__networkxr networkx.exceptionr__all__ _dispatchablerrrrr$sd", 1 2T2X 3X vT2R 3R r