ó ÊðhlãóH•SrS/rSSKr\R"SSS9SSj5rg)z Ego graph. Ú ego_graphéNT)Úpreserve_all_attrsÚ returns_graphcó¢•U(aWUb'[R"UR5XUS9upgOf[[R"UR5XS95nO9Ub[R"XX%S9upgO[[R"XUS95nUR U5R 5nU(dURU5 U$)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 ÚI/var/www/html/env/lib/python3.13/site-packages/networkx/generators/ego.pyrr sµ€öHØ Ñ Ü×-Ò-Ø—‘Ó! 1¸Hñ‰EˆBôÜ×5Ò5Ø—O‘OÓ% qñó‰Bð Ñ Ü×-Ò-¨a¸6ÑS‰EˆBä”b×;Ò;¸AÈÑPÓQˆBà ‰ 2‹×ÑÓ€AÞ Ø ‰ aÔØ €Hó)éTFN)Ú__doc__Ú__all__Únetworkxr Ú _dispatchabler©rrÚr"s7ðñð ˆ-€ãð×Ò T¸Ñ>ó7 ó?ñ7 r