hlbSSKrSS/rSSS.r\4Sjr\R "SSS 9S S\4S j5rg) Nadjacency_dataadjacency_graphidkey)rrc UR5nUSnU(dSOUSnX4:Xa[R"S5e0nUR5US'X%S'[ UR R 55US'/US'/US 'UR5HupgUSR0URUEX60E5 /nU(aJUR 5H5upU R 5HupUR0U EX9XK0E5 M M7 O/UR 5HupUR0U EX90E5 M US RU5 M U$) aReturns data in adjacency format that is suitable for JSON serialization and use in JavaScript documents. Parameters ---------- G : NetworkX graph attrs : dict A dictionary that contains two keys 'id' and 'key'. The corresponding values provide the attribute names for storing NetworkX-internal graph data. The values should be unique. Default value: :samp:`dict(id='id', key='key')`. If some user-defined graph data use these attribute names as data keys, they may be silently dropped. Returns ------- data : dict A dictionary with adjacency formatted data. Raises ------ NetworkXError If values in attrs are not unique. Examples -------- >>> from networkx.readwrite import json_graph >>> G = nx.Graph([(1, 2)]) >>> data = json_graph.adjacency_data(G) To serialize with json >>> import json >>> s = json.dumps(data) Notes ----- Graph, node, and link attributes will be written when using this format but attribute keys must be strings if you want to serialize the resulting data with JSON. The default value of attrs will be changed in a future release of NetworkX. See Also -------- adjacency_graph, node_link_data, tree_data rNrzAttribute names are not unique.directed multigraphgraphnodes adjacency) is_multigraphnx NetworkXError is_directedlistr itemsr appendr ) Gattrsr id_rdatannbrdictadjnbrkeyskds Y/var/www/html/env/lib/python3.13/site-packages/networkx/readwrite/json_graph/adjacency.pyrrsDd"J +C $eElC z@AA D}}D#)DMDMDkkm  W 3 3C34 $]]_  JJLDAJJ6!6Ss67)-"--/ ?a??+* [  %$ KT)graphs returns_graphFcURSU5nURSU5nU(a[R"5nO[R"5nU(aUR 5nUSnU(dSOUSn[ URS/55Ul/nUSHdnUR5n U RU5n URU 5 URU 5 URU RU 5 Mf [US5HupX{n UHn U R5nURU5nU(d)URX5 XLURU5 MTURUS5nURXUS 9 XLUURU5 M M U$) aReturns graph from adjacency data format. Parameters ---------- data : dict Adjacency list formatted graph data directed : bool If True, and direction not specified in data, return a directed graph. multigraph : bool If True, and multigraph not specified in data, return a multigraph. attrs : dict A dictionary that contains two keys 'id' and 'key'. The corresponding values provide the attribute names for storing NetworkX-internal graph data. The values should be unique. Default value: :samp:`dict(id='id', key='key')`. Returns ------- G : NetworkX graph A NetworkX graph object Examples -------- >>> from networkx.readwrite import json_graph >>> G = nx.Graph([(1, 2)]) >>> data = json_graph.adjacency_data(G) >>> H = json_graph.adjacency_graph(data) Notes ----- The default value of attrs will be changed in a future release of NetworkX. See Also -------- adjacency_graph, node_link_data, tree_data r rrNrr r r )r)getr MultiGraphGraph to_directeddictr copypopradd_noder update enumerateadd_edge)rrr rr rrmappingr node_datanodeisourcetdata target_datatargetkys rrrTs~R, 3Jxx H-H  !!# +C $eElCtxx,-EKG ']FFH }}S!t t D  +  ${+,E**,K __S)Fv. f%,,[9 __S$/v26 f%b)00=- Lr )networkxr__all___attrsr _dispatchablerr rr=sS . /U ##IXT2#(TG3Gr