+
    �°³j  ã                   ó¬   € R t RR.t^ RIt^ RIHt ]! ^ RR7      ]P                  ! RRR7      RR	 l4       4       t]P                  ! RRR7      R
 4       tR# )zÑ
Read graphs in LEDA format.

LEDA is a C++ class library for efficient data types and algorithms.

Format
------
See http://www.algorithmic-solutions.info/leda_guide/graphs/leda_native_graph_fileformat.html

Ú	read_ledaÚ
parse_ledaN)Ú	open_fileÚrb)ÚmodeT)ÚgraphsÚreturns_graphc                ó6   a€ V3R lV  4       p\        V4      pV# )a’  Read graph in LEDA format from path.

Parameters
----------
path : file or string
   Filename or file handle to read.
   Filenames ending in .gz or .bz2 will be decompressed.

Returns
-------
G : NetworkX graph

Examples
--------
>>> G = nx.read_leda("file.leda")  # doctest: +SKIP

References
----------
.. [1] http://www.algorithmic-solutions.info/leda_guide/graphs/leda_native_graph_fileformat.html
c              3   óD   <"  € T F  qP                  S4      x € K  	  R # 5i)N)Údecode)Ú.0ÚlineÚencodings   & €ÚX/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/readwrite/leda.pyÚ	<genexpr>Úread_leda.<locals>.<genexpr>+   s   øé € Ð4©t t�[‰[˜×"Ð"«tùs   ƒ )r   )Úpathr   ÚlinesÚGs   &f  r   r   r      s   ø€ ô. 5©tÓ4€EÜ�5Ó€AØ€Hó    c                óx  € \        V \        4      '       d   \        V P                  R4      4      p \        V  Uu. uF6  pVP	                  R4      '       d   K  VR8X  d   K%  VP                  R4      NK8  	  up4      p \        ^4       F  p\        V 4       K  	  \        \        V 4      4      pVR8X  d   \        P                  ! 4       pM\        P                  ! 4       p\        \        V 4      4      p/ p\        ^V^,           4       FA  p\        V 4      P                  4       P                  R4      pVR8X  d   \        V4      pWvV&   KC  	  TP                  VP                  4        UUu. uF  w  r(VNK	  	  upp4       \        \        V 4      4      p	\        V	4       FW  p \        V 4      P                  4       w  rŠr¼TP#                  T\        T4      ,          T\        T
4      ,          T^R	 R7       KY  	  V# u upi u uppi   \         d'   p\        P                   ! RT^,            24      ThRp?ii ; i)
a\  Read graph in LEDA format from string or iterable.

Parameters
----------
lines : string or iterable
   Data in LEDA format.

Returns
-------
G : NetworkX graph

Examples
--------
>>> G = nx.parse_leda(string)  # doctest: +SKIP

References
----------
.. [1] http://www.algorithmic-solutions.info/leda_guide/graphs/leda_native_graph_fileformat.html
Ú
Ú z|{}|  z"Too few fields in LEDA.GRAPH edge N)Úlabel)Ú#r   éÿÿÿÿéþÿÿÿ)Ú
isinstanceÚstrÚiterÚsplitÚ
startswithÚrstripÚrangeÚnextÚintÚnxÚDiGraphÚGraphÚstripÚadd_nodes_fromÚitemsÚBaseExceptionÚNetworkXErrorÚadd_edge)r   r   ÚiÚdur   ÚnÚnodeÚsymbolÚsÚmÚtÚreversalr   Úerrs   &             r   r   r   0   sâ  € ô* �%œ×ÒÜ�U—[‘[ Ó&Ó'ˆÜñ ó	
á�Ø—O‘O K×0ô à48¸B±Jô ˆD�K‰K˜ÖÙñ	
ó€Eô �1ŽXˆÜˆUŽñ ô 
ŒT�%‹[Ó	€BØ	ˆR„xÜ�JŠJ‹L‰ä�HŠH‹Jˆô 	ŒD�‹KÓ€AØ€DÜ�1�a˜!•eŽ_ˆÜ�e“×#Ñ#Ó%×+Ñ+¨HÓ5ˆØ�RŒ<Ü˜“VˆFØˆQ‹ñ	 ð ×Ñ D§J¡J¤LÔ1¡L™D˜A“a¡LÒ1Ô2ô 	ŒD�‹KÓ€AÜ�1ŽXˆð	Ü$(¨£K×$5Ñ$5Ó$7Ñ!ˆA�(ð 	
�
‰
�4œ˜A›•< ¤c¨!£f¥°U¸1¸R°[ˆ
ÖAñ ð €HùòK	
ùó0 2øô ô 	Ü×"Ò"Ø4°Q¸µU°GÐ<óàðûð	ús/   ºG=ÁG=Á!G=Å,H
Æ$HÈH9È!H4È4H9)zUTF-8)	Ú__doc__Ú__all__Únetworkxr&   Únetworkx.utilsr   Ú_dispatchabler   r   © r   r   Ú<module>r?      sm   ðñ	ð ˜Ð
%€ã Ý $ñ ˆ1�4ÔØ×Ò˜¨TÔ2óó 3ó ðð4 ×Ò˜¨TÔ2ñ<ó 3ò<r   