o ˷e,@s dZdgZddlZdddZdS) z Ego graph. ego_graphNTFc Cs|r!|durtj||||d\}}n'ttj|||d}n|dur1tj||||d\}}n ttj|||d}||}|sI|||S)aReturns 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. N)cutoffweight)r)nxsingle_source_dijkstra to_undirecteddict"single_source_shortest_path_lengthsubgraphcopy remove_node) Gnradiuscenter undirecteddistancesp_HrN/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/generators/ego.pyr s"#    )rTFN)__doc____all__networkxrrrrrrs