+
    )i$                         R t RR.t^ RIt^ RIH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)NetworkXError)	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   & U/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/readwrite/leda.py	<genexpr>read_leda.<locals>.<genexpr>,   s     4tt[[""ts    )r   )pathr   linesGs   &f  r   r   r      s    . 5t4E5AH    c                b   \        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  rrTP#                  T\        T4      ,          T\        T
4      ,          T^R	 R7       KY  	  V# u upi u uppi   \         d   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BaseExceptionr   add_edge)r   r   idur   nnodesymbolsmtreversalr   errs   &             r   r   r   1   s   * %U[[&' 	
OOK0 48BJ DKK	
E 1XU  
T%[	B	RxJJLHHJ 	DKAD1a!e_e##%++H5R<VFQ	  DJJL1LDAaL12 	DKA1X	W$(K$5$5$7!A( 	


4A<c!fU1R[
A  HG	
0 2  	W"DQUG LMSVV	Ws/   G=G=!G=,H
$HH.H))H.)zUTF-8)__doc____all__networkxr'   networkx.exceptionr   networkx.utilsr   _dispatchabler   r    r   r   <module>r@      sp   	 
%  , $ 14T2 3 4 T2: 3:r   