+ )•üifãóP€RtR.t^RIt]P!RRR7RRl4tR#)z Ego graph. Ú ego_graphNT)Úpreserve_all_attrsÚ returns_graphcó°€V'd_Ve+\P!VP4WVR7wrgMg\\P!VP4WR74pM7Ve\P!WW%R7wrgM\P!WVR7pVP V4P 4pV'gVPV4V#)a‹Returns induced subgraph of neighbors centered at node n within a given radius. Parameters ---------- G : graph A NetworkX Graph or DiGraph n : node A single node radius : number, optional Include all neighbors of distance<=radius from n. center : bool, optional If False, do not include center node in graph undirected : bool, optional If True use both in- and out-neighbors of directed graphs. distance : key, optional Use specified edge data key as distance. For example, setting distance='weight' will use the edge weight to measure the distance from the node n. Notes ----- For directed graphs D this produces the "out" neighborhood or successors. If you want the neighborhood of predecessors first reverse the graph with D.reverse(). If you want both directions use the keyword argument undirected=True. Node, edge, and graph attributes are copied to the returned subgraph. )ÚcutoffÚweight)r)ÚnxÚsingle_source_dijkstraÚ to_undirectedÚdictÚ"single_source_shortest_path_lengthÚsubgraphÚcopyÚ remove_node) ÚGÚnÚradiusÚcenterÚ undirectedÚdistanceÚspÚ_ÚHs &&&&&& ÚU/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/generators/ego.pyrr s°€÷HØ Ò Ü×-Ò-Ø—‘Ó! 1¸Hô‰EˆBôÜ×5Ò5Ø—O‘OÓ% qôó‰Bð Ò Ü×-Ò-¨a¸6ÔS‰EˆBä×6Ò6°qÀFÔKˆBà ‰ 2‹×ÑÓ€Aß Ø ‰ aÔØ €Hó)éTFN)Ú__doc__Ú__all__ÚnetworkxrÚ _dispatchabler©rrÚr!s7ðñð ˆ-€ãð×Ò T¸Ô>ó7 ó?ò7 r